41.82/20.05 YES 41.82/20.05 41.82/20.06 Ultimate: Cannot open display: 41.82/20.06 This is Ultimate 0.1.24-8dc7c08-m 41.82/20.06 [2019-03-28 12:45:15,478 INFO L170 SettingsManager]: Resetting all preferences to default values... 41.82/20.06 [2019-03-28 12:45:15,480 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 41.82/20.06 [2019-03-28 12:45:15,492 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 41.82/20.06 [2019-03-28 12:45:15,492 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 41.82/20.06 [2019-03-28 12:45:15,493 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 41.82/20.06 [2019-03-28 12:45:15,494 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 41.82/20.06 [2019-03-28 12:45:15,496 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 41.82/20.06 [2019-03-28 12:45:15,497 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 41.82/20.06 [2019-03-28 12:45:15,498 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 41.82/20.06 [2019-03-28 12:45:15,499 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 41.82/20.06 [2019-03-28 12:45:15,499 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 41.82/20.06 [2019-03-28 12:45:15,500 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 41.82/20.06 [2019-03-28 12:45:15,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 41.82/20.06 [2019-03-28 12:45:15,502 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 41.82/20.06 [2019-03-28 12:45:15,503 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 41.82/20.06 [2019-03-28 12:45:15,504 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 41.82/20.06 [2019-03-28 12:45:15,505 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 41.82/20.06 [2019-03-28 12:45:15,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 41.82/20.06 [2019-03-28 12:45:15,509 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 41.82/20.06 [2019-03-28 12:45:15,510 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 41.82/20.06 [2019-03-28 12:45:15,511 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 41.82/20.06 [2019-03-28 12:45:15,513 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 41.82/20.06 [2019-03-28 12:45:15,513 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 41.82/20.06 [2019-03-28 12:45:15,514 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 41.82/20.06 [2019-03-28 12:45:15,514 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 41.82/20.06 [2019-03-28 12:45:15,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 41.82/20.06 [2019-03-28 12:45:15,516 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 41.82/20.06 [2019-03-28 12:45:15,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 41.82/20.06 [2019-03-28 12:45:15,517 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 41.82/20.06 [2019-03-28 12:45:15,517 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 41.82/20.06 [2019-03-28 12:45:15,518 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 41.82/20.06 [2019-03-28 12:45:15,519 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 41.82/20.06 [2019-03-28 12:45:15,519 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 41.82/20.06 [2019-03-28 12:45:15,520 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 41.82/20.06 [2019-03-28 12:45:15,520 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 41.82/20.06 [2019-03-28 12:45:15,520 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 41.82/20.06 [2019-03-28 12:45:15,521 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 41.82/20.06 [2019-03-28 12:45:15,522 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 41.82/20.06 [2019-03-28 12:45:15,522 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 41.82/20.06 [2019-03-28 12:45:15,537 INFO L110 SettingsManager]: Loading preferences was successful 41.82/20.06 [2019-03-28 12:45:15,537 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 41.82/20.06 [2019-03-28 12:45:15,538 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 41.82/20.06 [2019-03-28 12:45:15,538 INFO L133 SettingsManager]: * Rewrite not-equals=true 41.82/20.06 [2019-03-28 12:45:15,539 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 41.82/20.06 [2019-03-28 12:45:15,539 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 41.82/20.06 [2019-03-28 12:45:15,539 INFO L133 SettingsManager]: * Use SBE=true 41.82/20.06 [2019-03-28 12:45:15,539 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 41.82/20.06 [2019-03-28 12:45:15,539 INFO L133 SettingsManager]: * Use old map elimination=false 41.82/20.06 [2019-03-28 12:45:15,539 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 41.82/20.06 [2019-03-28 12:45:15,540 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 41.82/20.06 [2019-03-28 12:45:15,540 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 41.82/20.06 [2019-03-28 12:45:15,540 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 41.82/20.06 [2019-03-28 12:45:15,540 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 41.82/20.06 [2019-03-28 12:45:15,540 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 41.82/20.06 [2019-03-28 12:45:15,540 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 41.82/20.06 [2019-03-28 12:45:15,541 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 41.82/20.06 [2019-03-28 12:45:15,541 INFO L133 SettingsManager]: * Check division by zero=IGNORE 41.82/20.06 [2019-03-28 12:45:15,541 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 41.82/20.06 [2019-03-28 12:45:15,541 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 41.82/20.06 [2019-03-28 12:45:15,541 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 41.82/20.06 [2019-03-28 12:45:15,542 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 41.82/20.06 [2019-03-28 12:45:15,542 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 41.82/20.06 [2019-03-28 12:45:15,542 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 41.82/20.06 [2019-03-28 12:45:15,542 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 41.82/20.06 [2019-03-28 12:45:15,542 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 41.82/20.06 [2019-03-28 12:45:15,542 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 41.82/20.06 [2019-03-28 12:45:15,543 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 41.82/20.06 [2019-03-28 12:45:15,543 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 41.82/20.06 [2019-03-28 12:45:15,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 41.82/20.06 [2019-03-28 12:45:15,582 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 41.82/20.06 [2019-03-28 12:45:15,585 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 41.82/20.06 [2019-03-28 12:45:15,587 INFO L271 PluginConnector]: Initializing CDTParser... 41.82/20.06 [2019-03-28 12:45:15,587 INFO L276 PluginConnector]: CDTParser initialized 41.82/20.06 [2019-03-28 12:45:15,588 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 41.82/20.06 [2019-03-28 12:45:15,652 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/7973896da81a41e284616a1e7aae9647/FLAG8d3b09184 41.82/20.06 [2019-03-28 12:45:16,001 INFO L307 CDTParser]: Found 1 translation units. 41.82/20.06 [2019-03-28 12:45:16,002 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 41.82/20.06 [2019-03-28 12:45:16,002 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 41.82/20.06 [2019-03-28 12:45:16,009 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/7973896da81a41e284616a1e7aae9647/FLAG8d3b09184 41.82/20.06 [2019-03-28 12:45:16,404 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/7973896da81a41e284616a1e7aae9647 41.82/20.06 [2019-03-28 12:45:16,415 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 41.82/20.06 [2019-03-28 12:45:16,417 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 41.82/20.06 [2019-03-28 12:45:16,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 41.82/20.06 [2019-03-28 12:45:16,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 41.82/20.06 [2019-03-28 12:45:16,422 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 41.82/20.06 [2019-03-28 12:45:16,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:16" (1/1) ... 41.82/20.06 [2019-03-28 12:45:16,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc37c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16, skipping insertion in model container 41.82/20.06 [2019-03-28 12:45:16,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:16" (1/1) ... 41.82/20.06 [2019-03-28 12:45:16,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 41.82/20.06 [2019-03-28 12:45:16,454 INFO L176 MainTranslator]: Built tables and reachable declarations 41.82/20.06 [2019-03-28 12:45:16,624 INFO L206 PostProcessor]: Analyzing one entry point: main 41.82/20.06 [2019-03-28 12:45:16,637 INFO L191 MainTranslator]: Completed pre-run 41.82/20.06 [2019-03-28 12:45:16,719 INFO L206 PostProcessor]: Analyzing one entry point: main 41.82/20.06 [2019-03-28 12:45:16,735 INFO L195 MainTranslator]: Completed translation 41.82/20.06 [2019-03-28 12:45:16,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16 WrapperNode 41.82/20.06 [2019-03-28 12:45:16,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 41.82/20.06 [2019-03-28 12:45:16,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 41.82/20.06 [2019-03-28 12:45:16,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 41.82/20.06 [2019-03-28 12:45:16,737 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 41.82/20.06 [2019-03-28 12:45:16,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 41.82/20.06 [2019-03-28 12:45:16,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 41.82/20.06 [2019-03-28 12:45:16,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 41.82/20.06 [2019-03-28 12:45:16,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 41.82/20.06 [2019-03-28 12:45:16,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 41.82/20.06 [2019-03-28 12:45:16,778 INFO L276 PluginConnector]: Boogie Preprocessor initialized 41.82/20.06 [2019-03-28 12:45:16,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 41.82/20.06 [2019-03-28 12:45:16,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 41.82/20.06 [2019-03-28 12:45:16,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 41.82/20.06 [2019-03-28 12:45:16,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 41.82/20.06 [2019-03-28 12:45:16,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 41.82/20.06 [2019-03-28 12:45:16,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 41.82/20.06 [2019-03-28 12:45:16,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 41.82/20.06 [2019-03-28 12:45:16,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 41.82/20.06 [2019-03-28 12:45:16,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 41.82/20.06 [2019-03-28 12:45:16,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... 41.82/20.06 [2019-03-28 12:45:16,805 INFO L276 PluginConnector]: RCFGBuilder initialized 41.82/20.06 [2019-03-28 12:45:16,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (1/1) ... 41.82/20.06 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 41.82/20.06 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 41.82/20.06 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 41.82/20.06 [2019-03-28 12:45:16,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 41.82/20.06 [2019-03-28 12:45:16,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 41.82/20.06 [2019-03-28 12:45:16,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 41.82/20.06 [2019-03-28 12:45:16,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 41.82/20.06 [2019-03-28 12:45:16,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 41.82/20.06 [2019-03-28 12:45:16,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 41.82/20.06 [2019-03-28 12:45:17,102 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 41.82/20.06 [2019-03-28 12:45:17,103 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 41.82/20.06 [2019-03-28 12:45:17,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:17 BoogieIcfgContainer 41.82/20.06 [2019-03-28 12:45:17,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 41.82/20.06 [2019-03-28 12:45:17,105 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 41.82/20.06 [2019-03-28 12:45:17,105 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 41.82/20.06 [2019-03-28 12:45:17,107 INFO L276 PluginConnector]: BlockEncodingV2 initialized 41.82/20.06 [2019-03-28 12:45:17,108 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:17" (1/1) ... 41.82/20.06 [2019-03-28 12:45:17,127 INFO L313 BlockEncoder]: Initial Icfg 26 locations, 29 edges 41.82/20.06 [2019-03-28 12:45:17,129 INFO L258 BlockEncoder]: Using Remove infeasible edges 41.82/20.06 [2019-03-28 12:45:17,130 INFO L263 BlockEncoder]: Using Maximize final states 41.82/20.06 [2019-03-28 12:45:17,130 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 41.82/20.06 [2019-03-28 12:45:17,131 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 41.82/20.06 [2019-03-28 12:45:17,133 INFO L296 BlockEncoder]: Using Remove sink states 41.82/20.06 [2019-03-28 12:45:17,134 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 41.82/20.06 [2019-03-28 12:45:17,134 INFO L179 BlockEncoder]: Using Rewrite not-equals 41.82/20.06 [2019-03-28 12:45:17,161 INFO L185 BlockEncoder]: Using Use SBE 41.82/20.06 [2019-03-28 12:45:17,188 INFO L200 BlockEncoder]: SBE split 12 edges 41.82/20.06 [2019-03-28 12:45:17,193 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 41.82/20.06 [2019-03-28 12:45:17,195 INFO L71 MaximizeFinalStates]: 0 new accepting states 41.82/20.06 [2019-03-28 12:45:17,221 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 41.82/20.06 [2019-03-28 12:45:17,224 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 41.82/20.06 [2019-03-28 12:45:17,226 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 41.82/20.06 [2019-03-28 12:45:17,226 INFO L71 MaximizeFinalStates]: 0 new accepting states 41.82/20.06 [2019-03-28 12:45:17,226 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 41.82/20.06 [2019-03-28 12:45:17,227 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 41.82/20.06 [2019-03-28 12:45:17,227 INFO L313 BlockEncoder]: Encoded RCFG 19 locations, 35 edges 41.82/20.06 [2019-03-28 12:45:17,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:17 BasicIcfg 41.82/20.06 [2019-03-28 12:45:17,228 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 41.82/20.06 [2019-03-28 12:45:17,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 41.82/20.06 [2019-03-28 12:45:17,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... 41.82/20.06 [2019-03-28 12:45:17,232 INFO L276 PluginConnector]: TraceAbstraction initialized 41.82/20.06 [2019-03-28 12:45:17,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:45:16" (1/4) ... 41.82/20.06 [2019-03-28 12:45:17,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1059c84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:17, skipping insertion in model container 41.82/20.06 [2019-03-28 12:45:17,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (2/4) ... 41.82/20.06 [2019-03-28 12:45:17,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1059c84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:17, skipping insertion in model container 41.82/20.06 [2019-03-28 12:45:17,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:17" (3/4) ... 41.82/20.06 [2019-03-28 12:45:17,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1059c84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:17, skipping insertion in model container 41.82/20.06 [2019-03-28 12:45:17,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:17" (4/4) ... 41.82/20.06 [2019-03-28 12:45:17,237 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 41.82/20.06 [2019-03-28 12:45:17,248 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 41.82/20.06 [2019-03-28 12:45:17,257 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. 41.82/20.06 [2019-03-28 12:45:17,274 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. 41.82/20.06 [2019-03-28 12:45:17,303 INFO L133 ementStrategyFactory]: Using default assertion order modulation 41.82/20.06 [2019-03-28 12:45:17,304 INFO L382 AbstractCegarLoop]: Interprodecural is true 41.82/20.06 [2019-03-28 12:45:17,304 INFO L383 AbstractCegarLoop]: Hoare is true 41.82/20.06 [2019-03-28 12:45:17,305 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 41.82/20.06 [2019-03-28 12:45:17,305 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 41.82/20.06 [2019-03-28 12:45:17,305 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 41.82/20.06 [2019-03-28 12:45:17,305 INFO L387 AbstractCegarLoop]: Difference is false 41.82/20.06 [2019-03-28 12:45:17,305 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 41.82/20.06 [2019-03-28 12:45:17,305 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 41.82/20.06 [2019-03-28 12:45:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. 41.82/20.06 [2019-03-28 12:45:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 41.82/20.06 [2019-03-28 12:45:17,326 INFO L394 BasicCegarLoop]: Found error trace 41.82/20.06 [2019-03-28 12:45:17,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:17,328 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 41.82/20.06 [2019-03-28 12:45:17,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:17,333 INFO L82 PathProgramCache]: Analyzing trace with hash 4470606, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:17,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:17,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:17,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:17,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:17,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:17,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 41.82/20.06 [2019-03-28 12:45:17,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 41.82/20.06 [2019-03-28 12:45:17,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 41.82/20.06 [2019-03-28 12:45:17,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 41.82/20.06 [2019-03-28 12:45:17,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 41.82/20.06 [2019-03-28 12:45:17,527 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. 41.82/20.06 [2019-03-28 12:45:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 41.82/20.06 [2019-03-28 12:45:17,617 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. 41.82/20.06 [2019-03-28 12:45:17,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 41.82/20.06 [2019-03-28 12:45:17,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 41.82/20.06 [2019-03-28 12:45:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 41.82/20.06 [2019-03-28 12:45:17,632 INFO L225 Difference]: With dead ends: 20 41.82/20.06 [2019-03-28 12:45:17,632 INFO L226 Difference]: Without dead ends: 19 41.82/20.06 [2019-03-28 12:45:17,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 41.82/20.06 [2019-03-28 12:45:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 41.82/20.06 [2019-03-28 12:45:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 41.82/20.06 [2019-03-28 12:45:17,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 41.82/20.06 [2019-03-28 12:45:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. 41.82/20.06 [2019-03-28 12:45:17,674 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 34 transitions. Word has length 4 41.82/20.06 [2019-03-28 12:45:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. 41.82/20.06 [2019-03-28 12:45:17,675 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 34 transitions. 41.82/20.06 [2019-03-28 12:45:17,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 41.82/20.06 [2019-03-28 12:45:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 34 transitions. 41.82/20.06 [2019-03-28 12:45:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 41.82/20.06 [2019-03-28 12:45:17,676 INFO L394 BasicCegarLoop]: Found error trace 41.82/20.06 [2019-03-28 12:45:17,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:17,676 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 41.82/20.06 [2019-03-28 12:45:17,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:17,677 INFO L82 PathProgramCache]: Analyzing trace with hash 4470603, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:17,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:17,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:17,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:17,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:17,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:17,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 41.82/20.06 [2019-03-28 12:45:17,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 41.82/20.06 [2019-03-28 12:45:17,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 41.82/20.06 [2019-03-28 12:45:17,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 41.82/20.06 [2019-03-28 12:45:17,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 41.82/20.06 [2019-03-28 12:45:17,702 INFO L87 Difference]: Start difference. First operand 19 states and 34 transitions. Second operand 3 states. 41.82/20.06 [2019-03-28 12:45:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 41.82/20.06 [2019-03-28 12:45:17,776 INFO L93 Difference]: Finished difference Result 19 states and 34 transitions. 41.82/20.06 [2019-03-28 12:45:17,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 41.82/20.06 [2019-03-28 12:45:17,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 41.82/20.06 [2019-03-28 12:45:17,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 41.82/20.06 [2019-03-28 12:45:17,778 INFO L225 Difference]: With dead ends: 19 41.82/20.06 [2019-03-28 12:45:17,778 INFO L226 Difference]: Without dead ends: 18 41.82/20.06 [2019-03-28 12:45:17,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 41.82/20.06 [2019-03-28 12:45:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 41.82/20.06 [2019-03-28 12:45:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 41.82/20.06 [2019-03-28 12:45:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 41.82/20.06 [2019-03-28 12:45:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. 41.82/20.06 [2019-03-28 12:45:17,783 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 32 transitions. Word has length 4 41.82/20.06 [2019-03-28 12:45:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. 41.82/20.06 [2019-03-28 12:45:17,783 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 32 transitions. 41.82/20.06 [2019-03-28 12:45:17,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 41.82/20.06 [2019-03-28 12:45:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 32 transitions. 41.82/20.06 [2019-03-28 12:45:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 41.82/20.06 [2019-03-28 12:45:17,784 INFO L394 BasicCegarLoop]: Found error trace 41.82/20.06 [2019-03-28 12:45:17,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:17,784 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 41.82/20.06 [2019-03-28 12:45:17,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash 4470605, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:17,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:17,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:17,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:17,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:17,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:17,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 41.82/20.06 [2019-03-28 12:45:17,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 41.82/20.06 [2019-03-28 12:45:17,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 41.82/20.06 [2019-03-28 12:45:17,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 41.82/20.06 [2019-03-28 12:45:17,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 41.82/20.06 [2019-03-28 12:45:17,816 INFO L87 Difference]: Start difference. First operand 18 states and 32 transitions. Second operand 4 states. 41.82/20.06 [2019-03-28 12:45:17,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 41.82/20.06 [2019-03-28 12:45:17,871 INFO L93 Difference]: Finished difference Result 18 states and 32 transitions. 41.82/20.06 [2019-03-28 12:45:17,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 41.82/20.06 [2019-03-28 12:45:17,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 41.82/20.06 [2019-03-28 12:45:17,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 41.82/20.06 [2019-03-28 12:45:17,873 INFO L225 Difference]: With dead ends: 18 41.82/20.06 [2019-03-28 12:45:17,873 INFO L226 Difference]: Without dead ends: 17 41.82/20.06 [2019-03-28 12:45:17,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 41.82/20.06 [2019-03-28 12:45:17,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 41.82/20.06 [2019-03-28 12:45:17,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 41.82/20.06 [2019-03-28 12:45:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 41.82/20.06 [2019-03-28 12:45:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. 41.82/20.06 [2019-03-28 12:45:17,877 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 4 41.82/20.06 [2019-03-28 12:45:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. 41.82/20.06 [2019-03-28 12:45:17,877 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. 41.82/20.06 [2019-03-28 12:45:17,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 41.82/20.06 [2019-03-28 12:45:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. 41.82/20.06 [2019-03-28 12:45:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 41.82/20.06 [2019-03-28 12:45:17,878 INFO L394 BasicCegarLoop]: Found error trace 41.82/20.06 [2019-03-28 12:45:17,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:17,879 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 41.82/20.06 [2019-03-28 12:45:17,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:17,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1258387, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:17,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:17,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:17,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:17,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:17,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:17,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 41.82/20.06 [2019-03-28 12:45:17,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 41.82/20.06 [2019-03-28 12:45:17,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 41.82/20.06 [2019-03-28 12:45:17,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 41.82/20.06 [2019-03-28 12:45:17,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 41.82/20.06 [2019-03-28 12:45:17,921 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 4 states. 41.82/20.06 [2019-03-28 12:45:17,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 41.82/20.06 [2019-03-28 12:45:17,994 INFO L93 Difference]: Finished difference Result 17 states and 31 transitions. 41.82/20.06 [2019-03-28 12:45:17,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 41.82/20.06 [2019-03-28 12:45:17,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 41.82/20.06 [2019-03-28 12:45:17,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 41.82/20.06 [2019-03-28 12:45:17,996 INFO L225 Difference]: With dead ends: 17 41.82/20.06 [2019-03-28 12:45:17,996 INFO L226 Difference]: Without dead ends: 14 41.82/20.06 [2019-03-28 12:45:17,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 41.82/20.06 [2019-03-28 12:45:17,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 41.82/20.06 [2019-03-28 12:45:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 41.82/20.06 [2019-03-28 12:45:17,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 41.82/20.06 [2019-03-28 12:45:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. 41.82/20.06 [2019-03-28 12:45:17,999 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 6 41.82/20.06 [2019-03-28 12:45:18,000 INFO L84 Accepts]: Finished accepts. word is rejected. 41.82/20.06 [2019-03-28 12:45:18,000 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. 41.82/20.06 [2019-03-28 12:45:18,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 41.82/20.06 [2019-03-28 12:45:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. 41.82/20.06 [2019-03-28 12:45:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 41.82/20.06 [2019-03-28 12:45:18,001 INFO L394 BasicCegarLoop]: Found error trace 41.82/20.06 [2019-03-28 12:45:18,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:18,001 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 41.82/20.06 [2019-03-28 12:45:18,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:18,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1258389, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:18,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:18,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:18,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:18,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:18,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:18,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 41.82/20.06 [2019-03-28 12:45:18,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 41.82/20.06 [2019-03-28 12:45:18,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 41.82/20.06 [2019-03-28 12:45:18,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 41.82/20.06 [2019-03-28 12:45:18,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 41.82/20.06 [2019-03-28 12:45:18,085 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. 41.82/20.06 [2019-03-28 12:45:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 41.82/20.06 [2019-03-28 12:45:18,175 INFO L93 Difference]: Finished difference Result 23 states and 40 transitions. 41.82/20.06 [2019-03-28 12:45:18,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 41.82/20.06 [2019-03-28 12:45:18,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 41.82/20.06 [2019-03-28 12:45:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 41.82/20.06 [2019-03-28 12:45:18,177 INFO L225 Difference]: With dead ends: 23 41.82/20.06 [2019-03-28 12:45:18,177 INFO L226 Difference]: Without dead ends: 20 41.82/20.06 [2019-03-28 12:45:18,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 41.82/20.06 [2019-03-28 12:45:18,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 41.82/20.06 [2019-03-28 12:45:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. 41.82/20.06 [2019-03-28 12:45:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 41.82/20.06 [2019-03-28 12:45:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. 41.82/20.06 [2019-03-28 12:45:18,182 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 33 transitions. Word has length 6 41.82/20.06 [2019-03-28 12:45:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. 41.82/20.06 [2019-03-28 12:45:18,183 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 33 transitions. 41.82/20.06 [2019-03-28 12:45:18,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 41.82/20.06 [2019-03-28 12:45:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 33 transitions. 41.82/20.06 [2019-03-28 12:45:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 41.82/20.06 [2019-03-28 12:45:18,183 INFO L394 BasicCegarLoop]: Found error trace 41.82/20.06 [2019-03-28 12:45:18,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:18,184 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 41.82/20.06 [2019-03-28 12:45:18,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:18,184 INFO L82 PathProgramCache]: Analyzing trace with hash -938260353, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:18,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:18,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:18,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:18,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:18,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:18,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 41.82/20.06 [2019-03-28 12:45:18,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 41.82/20.06 [2019-03-28 12:45:18,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 41.82/20.06 [2019-03-28 12:45:18,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 41.82/20.06 [2019-03-28 12:45:18,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 41.82/20.06 [2019-03-28 12:45:18,309 INFO L87 Difference]: Start difference. First operand 19 states and 33 transitions. Second operand 7 states. 41.82/20.06 [2019-03-28 12:45:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 41.82/20.06 [2019-03-28 12:45:18,495 INFO L93 Difference]: Finished difference Result 36 states and 63 transitions. 41.82/20.06 [2019-03-28 12:45:18,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 41.82/20.06 [2019-03-28 12:45:18,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 41.82/20.06 [2019-03-28 12:45:18,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 41.82/20.06 [2019-03-28 12:45:18,496 INFO L225 Difference]: With dead ends: 36 41.82/20.06 [2019-03-28 12:45:18,496 INFO L226 Difference]: Without dead ends: 19 41.82/20.06 [2019-03-28 12:45:18,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 41.82/20.06 [2019-03-28 12:45:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 41.82/20.06 [2019-03-28 12:45:18,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 41.82/20.06 [2019-03-28 12:45:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 41.82/20.06 [2019-03-28 12:45:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. 41.82/20.06 [2019-03-28 12:45:18,501 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 11 41.82/20.06 [2019-03-28 12:45:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. 41.82/20.06 [2019-03-28 12:45:18,501 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 32 transitions. 41.82/20.06 [2019-03-28 12:45:18,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 41.82/20.06 [2019-03-28 12:45:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 32 transitions. 41.82/20.06 [2019-03-28 12:45:18,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 41.82/20.06 [2019-03-28 12:45:18,503 INFO L394 BasicCegarLoop]: Found error trace 41.82/20.06 [2019-03-28 12:45:18,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:18,504 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 41.82/20.06 [2019-03-28 12:45:18,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:18,504 INFO L82 PathProgramCache]: Analyzing trace with hash 15977358, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:18,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:18,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:18,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:18,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:18,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:18,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 41.82/20.06 [2019-03-28 12:45:18,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 41.82/20.06 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 41.82/20.06 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 41.82/20.06 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 41.82/20.06 [2019-03-28 12:45:18,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:18,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 22 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:18,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:18,795 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 41.82/20.06 [2019-03-28 12:45:18,796 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 41.82/20.06 [2019-03-28 12:45:18,804 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 41.82/20.06 [2019-03-28 12:45:18,805 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 41.82/20.06 [2019-03-28 12:45:18,805 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 41.82/20.06 [2019-03-28 12:45:18,885 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 41.82/20.06 [2019-03-28 12:45:18,885 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 41.82/20.06 [2019-03-28 12:45:18,889 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 41.82/20.06 [2019-03-28 12:45:18,907 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 41.82/20.06 [2019-03-28 12:45:18,913 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 41.82/20.06 [2019-03-28 12:45:18,914 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:35 41.82/20.06 [2019-03-28 12:45:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:19,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 41.82/20.06 [2019-03-28 12:45:19,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 41.82/20.06 [2019-03-28 12:45:19,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states 41.82/20.06 [2019-03-28 12:45:19,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. 41.82/20.06 [2019-03-28 12:45:19,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 41.82/20.06 [2019-03-28 12:45:19,041 INFO L87 Difference]: Start difference. First operand 19 states and 32 transitions. Second operand 13 states. 41.82/20.06 [2019-03-28 12:45:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 41.82/20.06 [2019-03-28 12:45:23,004 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. 41.82/20.06 [2019-03-28 12:45:23,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 41.82/20.06 [2019-03-28 12:45:23,005 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 41.82/20.06 [2019-03-28 12:45:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 41.82/20.06 [2019-03-28 12:45:23,006 INFO L225 Difference]: With dead ends: 53 41.82/20.06 [2019-03-28 12:45:23,006 INFO L226 Difference]: Without dead ends: 50 41.82/20.06 [2019-03-28 12:45:23,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 41.82/20.06 [2019-03-28 12:45:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. 41.82/20.06 [2019-03-28 12:45:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 21. 41.82/20.06 [2019-03-28 12:45:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 41.82/20.06 [2019-03-28 12:45:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. 41.82/20.06 [2019-03-28 12:45:23,012 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 33 transitions. Word has length 11 41.82/20.06 [2019-03-28 12:45:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. 41.82/20.06 [2019-03-28 12:45:23,013 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 33 transitions. 41.82/20.06 [2019-03-28 12:45:23,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. 41.82/20.06 [2019-03-28 12:45:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. 41.82/20.06 [2019-03-28 12:45:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 41.82/20.06 [2019-03-28 12:45:23,014 INFO L394 BasicCegarLoop]: Found error trace 41.82/20.06 [2019-03-28 12:45:23,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:23,014 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 41.82/20.06 [2019-03-28 12:45:23,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:23,014 INFO L82 PathProgramCache]: Analyzing trace with hash 15977359, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:23,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:23,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:23,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:23,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 41.82/20.06 [2019-03-28 12:45:23,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 41.82/20.06 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 41.82/20.06 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 41.82/20.06 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 41.82/20.06 [2019-03-28 12:45:23,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:23,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:23,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:23,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 41.82/20.06 [2019-03-28 12:45:23,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 41.82/20.06 [2019-03-28 12:45:23,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 41.82/20.06 [2019-03-28 12:45:23,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 41.82/20.06 [2019-03-28 12:45:23,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 41.82/20.06 [2019-03-28 12:45:23,121 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. Second operand 6 states. 41.82/20.06 [2019-03-28 12:45:23,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 41.82/20.06 [2019-03-28 12:45:23,191 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. 41.82/20.06 [2019-03-28 12:45:23,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 41.82/20.06 [2019-03-28 12:45:23,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 41.82/20.06 [2019-03-28 12:45:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 41.82/20.06 [2019-03-28 12:45:23,192 INFO L225 Difference]: With dead ends: 22 41.82/20.06 [2019-03-28 12:45:23,192 INFO L226 Difference]: Without dead ends: 19 41.82/20.06 [2019-03-28 12:45:23,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 41.82/20.06 [2019-03-28 12:45:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 41.82/20.06 [2019-03-28 12:45:23,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 41.82/20.06 [2019-03-28 12:45:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 41.82/20.06 [2019-03-28 12:45:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. 41.82/20.06 [2019-03-28 12:45:23,197 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 11 41.82/20.06 [2019-03-28 12:45:23,197 INFO L84 Accepts]: Finished accepts. word is rejected. 41.82/20.06 [2019-03-28 12:45:23,197 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 29 transitions. 41.82/20.06 [2019-03-28 12:45:23,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 41.82/20.06 [2019-03-28 12:45:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. 41.82/20.06 [2019-03-28 12:45:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 41.82/20.06 [2019-03-28 12:45:23,198 INFO L394 BasicCegarLoop]: Found error trace 41.82/20.06 [2019-03-28 12:45:23,198 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:23,199 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 41.82/20.06 [2019-03-28 12:45:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:23,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1478507482, now seen corresponding path program 2 times 41.82/20.06 [2019-03-28 12:45:23,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:23,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:23,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:23,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:23,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:23,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 41.82/20.06 [2019-03-28 12:45:23,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 41.82/20.06 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 41.82/20.06 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 41.82/20.06 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 41.82/20.06 [2019-03-28 12:45:23,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 41.82/20.06 [2019-03-28 12:45:23,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 41.82/20.06 [2019-03-28 12:45:23,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:23,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 24 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:23,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:23,470 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 41.82/20.06 [2019-03-28 12:45:23,470 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 41.82/20.06 [2019-03-28 12:45:23,475 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 41.82/20.06 [2019-03-28 12:45:23,475 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 41.82/20.06 [2019-03-28 12:45:23,476 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 41.82/20.06 [2019-03-28 12:45:23,494 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 41.82/20.06 [2019-03-28 12:45:23,494 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 41.82/20.06 [2019-03-28 12:45:23,500 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 41.82/20.06 [2019-03-28 12:45:23,501 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 41.82/20.06 [2019-03-28 12:45:23,501 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 41.82/20.06 [2019-03-28 12:45:23,603 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 41.82/20.06 [2019-03-28 12:45:23,604 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 41.82/20.06 [2019-03-28 12:45:23,605 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 41.82/20.06 [2019-03-28 12:45:23,617 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 41.82/20.06 [2019-03-28 12:45:23,619 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 41.82/20.06 [2019-03-28 12:45:23,619 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 41.82/20.06 [2019-03-28 12:45:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:23,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 41.82/20.06 [2019-03-28 12:45:23,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 41.82/20.06 [2019-03-28 12:45:23,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 41.82/20.06 [2019-03-28 12:45:23,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 41.82/20.06 [2019-03-28 12:45:23,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 41.82/20.06 [2019-03-28 12:45:23,711 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. Second operand 15 states. 41.82/20.06 [2019-03-28 12:45:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 41.82/20.06 [2019-03-28 12:45:25,426 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. 41.82/20.06 [2019-03-28 12:45:25,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 41.82/20.06 [2019-03-28 12:45:25,427 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 41.82/20.06 [2019-03-28 12:45:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 41.82/20.06 [2019-03-28 12:45:25,428 INFO L225 Difference]: With dead ends: 71 41.82/20.06 [2019-03-28 12:45:25,428 INFO L226 Difference]: Without dead ends: 70 41.82/20.06 [2019-03-28 12:45:25,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=450, Invalid=1272, Unknown=0, NotChecked=0, Total=1722 41.82/20.06 [2019-03-28 12:45:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. 41.82/20.06 [2019-03-28 12:45:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 43. 41.82/20.06 [2019-03-28 12:45:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. 41.82/20.06 [2019-03-28 12:45:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 66 transitions. 41.82/20.06 [2019-03-28 12:45:25,439 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 66 transitions. Word has length 16 41.82/20.06 [2019-03-28 12:45:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. 41.82/20.06 [2019-03-28 12:45:25,440 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 66 transitions. 41.82/20.06 [2019-03-28 12:45:25,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 41.82/20.06 [2019-03-28 12:45:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. 41.82/20.06 [2019-03-28 12:45:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 41.82/20.06 [2019-03-28 12:45:25,441 INFO L394 BasicCegarLoop]: Found error trace 41.82/20.06 [2019-03-28 12:45:25,441 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:25,441 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 41.82/20.06 [2019-03-28 12:45:25,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:25,442 INFO L82 PathProgramCache]: Analyzing trace with hash -787519795, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:25,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:25,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:25,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:25,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:25,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:25,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 41.82/20.06 [2019-03-28 12:45:25,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 41.82/20.06 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 41.82/20.06 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 41.82/20.06 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 41.82/20.06 [2019-03-28 12:45:25,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:25,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 27 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:25,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:25,627 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 41.82/20.06 [2019-03-28 12:45:25,627 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 41.82/20.06 [2019-03-28 12:45:25,632 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 41.82/20.06 [2019-03-28 12:45:25,633 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 41.82/20.06 [2019-03-28 12:45:25,633 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 41.82/20.06 [2019-03-28 12:45:25,649 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 41.82/20.06 [2019-03-28 12:45:25,650 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 41.82/20.06 [2019-03-28 12:45:25,652 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 41.82/20.06 [2019-03-28 12:45:25,652 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 41.82/20.06 [2019-03-28 12:45:25,653 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 41.82/20.06 [2019-03-28 12:45:25,679 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 41.82/20.06 [2019-03-28 12:45:25,680 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 41.82/20.06 [2019-03-28 12:45:25,681 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 41.82/20.06 [2019-03-28 12:45:25,690 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 41.82/20.06 [2019-03-28 12:45:25,691 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 41.82/20.06 [2019-03-28 12:45:25,691 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 41.82/20.06 [2019-03-28 12:45:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:25,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 41.82/20.06 [2019-03-28 12:45:25,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 41.82/20.06 [2019-03-28 12:45:25,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states 41.82/20.06 [2019-03-28 12:45:25,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 41.82/20.06 [2019-03-28 12:45:25,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 41.82/20.06 [2019-03-28 12:45:25,766 INFO L87 Difference]: Start difference. First operand 43 states and 66 transitions. Second operand 11 states. 41.82/20.06 [2019-03-28 12:45:25,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 41.82/20.06 [2019-03-28 12:45:25,925 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. 41.82/20.06 [2019-03-28 12:45:25,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 41.82/20.06 [2019-03-28 12:45:25,926 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 41.82/20.06 [2019-03-28 12:45:25,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 41.82/20.06 [2019-03-28 12:45:25,926 INFO L225 Difference]: With dead ends: 43 41.82/20.06 [2019-03-28 12:45:25,926 INFO L226 Difference]: Without dead ends: 0 41.82/20.06 [2019-03-28 12:45:25,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 41.82/20.06 [2019-03-28 12:45:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 41.82/20.06 [2019-03-28 12:45:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 41.82/20.06 [2019-03-28 12:45:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 41.82/20.06 [2019-03-28 12:45:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 41.82/20.06 [2019-03-28 12:45:25,928 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 41.82/20.06 [2019-03-28 12:45:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. 41.82/20.06 [2019-03-28 12:45:25,928 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 41.82/20.06 [2019-03-28 12:45:25,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. 41.82/20.06 [2019-03-28 12:45:25,929 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 41.82/20.06 [2019-03-28 12:45:25,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 41.82/20.06 [2019-03-28 12:45:25,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 41.82/20.06 [2019-03-28 12:45:25,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 41.82/20.06 [2019-03-28 12:45:25,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 41.82/20.06 [2019-03-28 12:45:25,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 41.82/20.06 [2019-03-28 12:45:26,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 41.82/20.06 [2019-03-28 12:45:26,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 41.82/20.06 [2019-03-28 12:45:26,871 WARN L188 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 50 41.82/20.06 [2019-03-28 12:45:26,875 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,875 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,875 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,875 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,875 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,876 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,876 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,876 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,876 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,876 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 21 23) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,876 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,876 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,876 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,877 INFO L448 ceAbstractionStarter]: For program point L9-1(lines 9 15) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,877 INFO L444 ceAbstractionStarter]: At program point L9-3(lines 9 15) the Hoare annotation is: (let ((.cse8 (select |#memory_int| ULTIMATE.start_cstrreplace_~p~0.base)) (.cse10 (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base)) (.cse12 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse11 (select |#length| ULTIMATE.start_cstrreplace_~p~0.base))) (let ((.cse4 (<= 1 .cse11)) (.cse7 (= ULTIMATE.start_cstrreplace_~p~0.offset 0)) (.cse9 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse0 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse1 (= ULTIMATE.start_main_~length1~0 .cse12)) (.cse2 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse3 (= 1 (select |#valid| ULTIMATE.start_cstrreplace_~p~0.base))) (.cse5 (= 0 (select .cse10 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse12 (- 1))))) (.cse6 (= (select .cse8 (+ .cse11 (- 1))) 0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (<= 1 ULTIMATE.start_main_~length1~0) (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1))) 0)))) .cse5 .cse6 .cse7) (and (= 0 (select .cse8 ULTIMATE.start_cstrreplace_~p~0.offset)) .cse9 (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) 1) .cse0 .cse2 .cse1 .cse3 (= (select .cse10 ULTIMATE.start_main_~nondetString1~0.offset) 0) .cse4 .cse7) (and (<= (+ ULTIMATE.start_cstrreplace_~p~0.offset 1) .cse11) .cse9 .cse0 .cse1 .cse2 .cse3 (<= 1 ULTIMATE.start_cstrreplace_~p~0.offset) .cse5 .cse6)))) 41.82/20.06 [2019-03-28 12:45:26,877 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,877 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,878 INFO L448 ceAbstractionStarter]: For program point L10-1(lines 10 13) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,878 INFO L448 ceAbstractionStarter]: For program point L10-3(lines 10 13) no Hoare annotation was computed. 41.82/20.06 [2019-03-28 12:45:26,878 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 41.82/20.06 [2019-03-28 12:45:26,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.06 [2019-03-28 12:45:26,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.06 [2019-03-28 12:45:26,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.06 [2019-03-28 12:45:26,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,893 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,893 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.06 [2019-03-28 12:45:26,893 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.06 [2019-03-28 12:45:26,894 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,894 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.06 [2019-03-28 12:45:26,894 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,894 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.06 [2019-03-28 12:45:26,895 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,895 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.06 [2019-03-28 12:45:26,895 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,895 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.06 [2019-03-28 12:45:26,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.06 [2019-03-28 12:45:26,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,904 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.06 [2019-03-28 12:45:26,904 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.06 [2019-03-28 12:45:26,905 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.06 [2019-03-28 12:45:26,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.06 [2019-03-28 12:45:26,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.06 [2019-03-28 12:45:26,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.06 [2019-03-28 12:45:26,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.06 [2019-03-28 12:45:26,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.06 [2019-03-28 12:45:26,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.06 [2019-03-28 12:45:26,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.06 [2019-03-28 12:45:26,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:26,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:26 BasicIcfg 41.82/20.06 [2019-03-28 12:45:26,914 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 41.82/20.06 [2019-03-28 12:45:26,914 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 41.82/20.06 [2019-03-28 12:45:26,914 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 41.82/20.06 [2019-03-28 12:45:26,918 INFO L276 PluginConnector]: BuchiAutomizer initialized 41.82/20.06 [2019-03-28 12:45:26,919 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 41.82/20.06 [2019-03-28 12:45:26,919 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:45:16" (1/5) ... 41.82/20.06 [2019-03-28 12:45:26,919 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ca9430c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:26, skipping insertion in model container 41.82/20.06 [2019-03-28 12:45:26,920 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 41.82/20.06 [2019-03-28 12:45:26,920 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:16" (2/5) ... 41.82/20.06 [2019-03-28 12:45:26,920 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ca9430c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:26, skipping insertion in model container 41.82/20.06 [2019-03-28 12:45:26,920 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 41.82/20.06 [2019-03-28 12:45:26,920 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:17" (3/5) ... 41.82/20.06 [2019-03-28 12:45:26,920 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ca9430c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:26, skipping insertion in model container 41.82/20.06 [2019-03-28 12:45:26,921 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 41.82/20.06 [2019-03-28 12:45:26,921 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:17" (4/5) ... 41.82/20.06 [2019-03-28 12:45:26,921 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ca9430c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:26, skipping insertion in model container 41.82/20.06 [2019-03-28 12:45:26,921 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 41.82/20.06 [2019-03-28 12:45:26,921 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:26" (5/5) ... 41.82/20.06 [2019-03-28 12:45:26,923 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 41.82/20.06 [2019-03-28 12:45:26,943 INFO L133 ementStrategyFactory]: Using default assertion order modulation 41.82/20.06 [2019-03-28 12:45:26,943 INFO L374 BuchiCegarLoop]: Interprodecural is true 41.82/20.06 [2019-03-28 12:45:26,943 INFO L375 BuchiCegarLoop]: Hoare is true 41.82/20.06 [2019-03-28 12:45:26,943 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 41.82/20.06 [2019-03-28 12:45:26,944 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 41.82/20.06 [2019-03-28 12:45:26,944 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 41.82/20.06 [2019-03-28 12:45:26,944 INFO L379 BuchiCegarLoop]: Difference is false 41.82/20.06 [2019-03-28 12:45:26,944 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 41.82/20.06 [2019-03-28 12:45:26,944 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 41.82/20.06 [2019-03-28 12:45:26,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. 41.82/20.06 [2019-03-28 12:45:26,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 41.82/20.06 [2019-03-28 12:45:26,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 41.82/20.06 [2019-03-28 12:45:26,952 INFO L119 BuchiIsEmpty]: Starting construction of run 41.82/20.06 [2019-03-28 12:45:26,956 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:26,957 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:26,957 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 41.82/20.06 [2019-03-28 12:45:26,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. 41.82/20.06 [2019-03-28 12:45:26,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 41.82/20.06 [2019-03-28 12:45:26,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 41.82/20.06 [2019-03-28 12:45:26,958 INFO L119 BuchiIsEmpty]: Starting construction of run 41.82/20.06 [2019-03-28 12:45:26,959 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:26,959 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:26,964 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue [117] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_#t~malloc5.offset] 14#L21true [78] L21-->L21-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 10#L21-2true [92] L21-2-->L25: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~malloc5.offset] 20#L25true [65] L25-->L25-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} AuxVars[] AssignedVars[#memory_int] 19#L25-1true [100] L25-1-->L9-3: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet6_2| 256)) (.cse1 (mod |v_ULTIMATE.start_main_#t~nondet7_2| 256))) (and (= v_ULTIMATE.start_cstrreplace_~s.base_1 |v_ULTIMATE.start_cstrreplace_#in~s.base_1|) (> .cse0 127) (= v_ULTIMATE.start_cstrreplace_~old_1 |v_ULTIMATE.start_cstrreplace_#in~old_1|) (= |v_ULTIMATE.start_cstrreplace_#in~s.offset_1| v_ULTIMATE.start_main_~nondetString1~0.offset_5) (= v_ULTIMATE.start_cstrreplace_~numReplaced~0_1 0) (= v_ULTIMATE.start_cstrreplace_~p~0.base_1 v_ULTIMATE.start_cstrreplace_~s.base_1) (= v_ULTIMATE.start_cstrreplace_~new_1 |v_ULTIMATE.start_cstrreplace_#in~new_1|) (= v_ULTIMATE.start_cstrreplace_~p~0.offset_1 v_ULTIMATE.start_cstrreplace_~s.offset_1) (= |v_ULTIMATE.start_cstrreplace_#in~new_1| (+ .cse1 (- 256))) (= |v_ULTIMATE.start_cstrreplace_#in~s.base_1| v_ULTIMATE.start_main_~nondetString1~0.base_6) (= |v_ULTIMATE.start_cstrreplace_#in~old_1| (+ .cse0 (- 256))) (= v_ULTIMATE.start_cstrreplace_~s.offset_1 |v_ULTIMATE.start_cstrreplace_#in~s.offset_1|) (> .cse1 127))) InVars {ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_cstrreplace_#in~old=|v_ULTIMATE.start_cstrreplace_#in~old_1|, ULTIMATE.start_cstrreplace_#res=|v_ULTIMATE.start_cstrreplace_#res_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_1, ULTIMATE.start_cstrreplace_~numReplaced~0=v_ULTIMATE.start_cstrreplace_~numReplaced~0_1, ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_1|, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_1|, ULTIMATE.start_cstrreplace_~s.base=v_ULTIMATE.start_cstrreplace_~s.base_1, ULTIMATE.start_cstrreplace_~new=v_ULTIMATE.start_cstrreplace_~new_1, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6, ULTIMATE.start_cstrreplace_#in~s.offset=|v_ULTIMATE.start_cstrreplace_#in~s.offset_1|, ULTIMATE.start_cstrreplace_#in~s.base=|v_ULTIMATE.start_cstrreplace_#in~s.base_1|, ULTIMATE.start_cstrreplace_#t~post2=|v_ULTIMATE.start_cstrreplace_#t~post2_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_1|, ULTIMATE.start_cstrreplace_~s.offset=v_ULTIMATE.start_cstrreplace_~s.offset_1, ULTIMATE.start_cstrreplace_#in~new=|v_ULTIMATE.start_cstrreplace_#in~new_1|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_~old, ULTIMATE.start_cstrreplace_#in~old, ULTIMATE.start_cstrreplace_#res, ULTIMATE.start_cstrreplace_~p~0.offset, ULTIMATE.start_cstrreplace_~numReplaced~0, ULTIMATE.start_cstrreplace_#t~mem0, ULTIMATE.start_cstrreplace_#t~mem1, ULTIMATE.start_cstrreplace_~s.base, ULTIMATE.start_cstrreplace_~new, ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#in~s.offset, ULTIMATE.start_cstrreplace_#in~s.base, ULTIMATE.start_cstrreplace_#t~post2, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~s.offset, ULTIMATE.start_cstrreplace_#in~new, ULTIMATE.start_cstrreplace_~p~0.base] 5#L9-3true 41.82/20.06 [2019-03-28 12:45:26,964 INFO L796 eck$LassoCheckResult]: Loop: 5#L9-3true [52] L9-3-->L9-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_cstrreplace_~p~0.base_3) 1) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrreplace_~p~0.base_3)) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrreplace_~p~0.base_3) v_ULTIMATE.start_cstrreplace_~p~0.offset_3) |v_ULTIMATE.start_cstrreplace_#t~mem0_2|)) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 9#L9-1true [105] L9-1-->L10: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem0_6| 0) InVars {ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_6|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 13#L10true [58] L10-->L10-1: Formula: (and (= (select |v_#valid_9| v_ULTIMATE.start_cstrreplace_~p~0.base_6) 1) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_5) (= |v_ULTIMATE.start_cstrreplace_#t~mem1_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrreplace_~p~0.base_6) v_ULTIMATE.start_cstrreplace_~p~0.offset_5)) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrreplace_~p~0.base_6))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 12#L10-1true [112] L10-1-->L10-3: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem1_6| v_ULTIMATE.start_cstrreplace_~old_4) InVars {ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_6|} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 7#L10-3true [69] L10-3-->L9-3: Formula: (and (= v_ULTIMATE.start_cstrreplace_~p~0.offset_9 (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_10 1)) (= v_ULTIMATE.start_cstrreplace_~p~0.base_12 v_ULTIMATE.start_cstrreplace_~p~0.base_13)) InVars {ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_10, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_13} OutVars{ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_2|, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_2|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_12, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~p~0.base, ULTIMATE.start_cstrreplace_~p~0.offset] 5#L9-3true 41.82/20.06 [2019-03-28 12:45:26,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:26,965 INFO L82 PathProgramCache]: Analyzing trace with hash 139095333, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:26,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:26,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:26,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:26,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:26,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:26,997 INFO L82 PathProgramCache]: Analyzing trace with hash 79839577, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:26,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:26,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:26,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:26,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:26,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:27,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:27,005 INFO L82 PathProgramCache]: Analyzing trace with hash -664638795, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:27,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:27,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:27,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:27,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:27,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:27,227 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 41.82/20.06 [2019-03-28 12:45:27,306 INFO L216 LassoAnalysis]: Preferences: 41.82/20.06 [2019-03-28 12:45:27,308 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 41.82/20.06 [2019-03-28 12:45:27,308 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 41.82/20.06 [2019-03-28 12:45:27,308 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 41.82/20.06 [2019-03-28 12:45:27,308 INFO L127 ssoRankerPreferences]: Use exernal solver: false 41.82/20.06 [2019-03-28 12:45:27,308 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 41.82/20.06 [2019-03-28 12:45:27,309 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 41.82/20.06 [2019-03-28 12:45:27,309 INFO L130 ssoRankerPreferences]: Path of dumped script: 41.82/20.06 [2019-03-28 12:45:27,309 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 41.82/20.06 [2019-03-28 12:45:27,309 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 41.82/20.06 [2019-03-28 12:45:27,309 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 41.82/20.06 [2019-03-28 12:45:27,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:27,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:27,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:27,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:27,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:27,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:27,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:27,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:27,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:27,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:27,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:27,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:27,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:27,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:27,827 INFO L300 LassoAnalysis]: Preprocessing complete. 41.82/20.06 [2019-03-28 12:45:27,833 INFO L497 LassoAnalysis]: Using template 'affine'. 41.82/20.06 [2019-03-28 12:45:27,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:27,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:27,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:27,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:27,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:27,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:27,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:27,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:27,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:27,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:27,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:27,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:27,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:27,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:27,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:27,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:27,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:27,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:27,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:27,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:27,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:27,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:27,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:27,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:27,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:27,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:27,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:27,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:27,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:27,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:27,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:27,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:27,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:27,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:27,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:27,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:27,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:27,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:27,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:27,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:27,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:27,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:27,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:27,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:27,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:27,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:27,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:27,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:27,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:27,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:27,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:27,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:27,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:27,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:27,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:27,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:27,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:27,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:27,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:27,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:27,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:27,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:27,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:27,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:27,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:27,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:27,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:27,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:27,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:27,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:27,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:27,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:27,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:27,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:27,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:27,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:27,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:27,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:27,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:27,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:27,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:27,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:27,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:27,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:27,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:27,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:27,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:27,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:27,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:27,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:27,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:27,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:27,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:27,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:27,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:27,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:27,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:27,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:27,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:27,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:27,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:27,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:27,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:27,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:27,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:27,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:27,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:27,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:27,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:27,924 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 41.82/20.06 [2019-03-28 12:45:27,943 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 41.82/20.06 [2019-03-28 12:45:27,944 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. 41.82/20.06 [2019-03-28 12:45:27,946 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 41.82/20.06 [2019-03-28 12:45:27,948 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 41.82/20.06 [2019-03-28 12:45:27,948 INFO L518 LassoAnalysis]: Proved termination. 41.82/20.06 [2019-03-28 12:45:27,949 INFO L520 LassoAnalysis]: Termination argument consisting of: 41.82/20.06 Ranking function f(ULTIMATE.start_cstrreplace_~p~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_1) = -1*ULTIMATE.start_cstrreplace_~p~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_1 41.82/20.06 Supporting invariants [] 41.82/20.06 [2019-03-28 12:45:27,971 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed 41.82/20.06 [2019-03-28 12:45:27,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:28,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:28,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:28,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:28,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:28,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:28,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:28,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:28,139 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 41.82/20.06 [2019-03-28 12:45:28,143 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates 41.82/20.06 [2019-03-28 12:45:28,144 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states. Second operand 4 states. 41.82/20.06 [2019-03-28 12:45:28,276 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 19 states.. Second operand 4 states. Result 45 states and 84 transitions. Complement of second has 8 states. 41.82/20.06 [2019-03-28 12:45:28,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states 41.82/20.06 [2019-03-28 12:45:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 41.82/20.06 [2019-03-28 12:45:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. 41.82/20.06 [2019-03-28 12:45:28,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 5 letters. Loop has 5 letters. 41.82/20.06 [2019-03-28 12:45:28,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. 41.82/20.06 [2019-03-28 12:45:28,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 10 letters. Loop has 5 letters. 41.82/20.06 [2019-03-28 12:45:28,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. 41.82/20.06 [2019-03-28 12:45:28,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 5 letters. Loop has 10 letters. 41.82/20.06 [2019-03-28 12:45:28,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. 41.82/20.06 [2019-03-28 12:45:28,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 84 transitions. 41.82/20.06 [2019-03-28 12:45:28,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 41.82/20.06 [2019-03-28 12:45:28,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 11 states and 18 transitions. 41.82/20.06 [2019-03-28 12:45:28,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 41.82/20.06 [2019-03-28 12:45:28,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 41.82/20.06 [2019-03-28 12:45:28,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 18 transitions. 41.82/20.06 [2019-03-28 12:45:28,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 41.82/20.06 [2019-03-28 12:45:28,294 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 18 transitions. 41.82/20.06 [2019-03-28 12:45:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 18 transitions. 41.82/20.06 [2019-03-28 12:45:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 41.82/20.06 [2019-03-28 12:45:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 41.82/20.06 [2019-03-28 12:45:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. 41.82/20.06 [2019-03-28 12:45:28,296 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 18 transitions. 41.82/20.06 [2019-03-28 12:45:28,296 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 18 transitions. 41.82/20.06 [2019-03-28 12:45:28,296 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 41.82/20.06 [2019-03-28 12:45:28,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 18 transitions. 41.82/20.06 [2019-03-28 12:45:28,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 41.82/20.06 [2019-03-28 12:45:28,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 41.82/20.06 [2019-03-28 12:45:28,297 INFO L119 BuchiIsEmpty]: Starting construction of run 41.82/20.06 [2019-03-28 12:45:28,297 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:28,297 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:28,298 INFO L794 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY [117] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_#t~malloc5.offset] 165#L21 [78] L21-->L21-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 166#L21-2 [92] L21-2-->L25: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~malloc5.offset] 173#L25 [65] L25-->L25-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} AuxVars[] AssignedVars[#memory_int] 172#L25-1 [99] L25-1-->L9-3: Formula: (let ((.cse1 (mod |v_ULTIMATE.start_main_#t~nondet6_2| 256)) (.cse0 (mod |v_ULTIMATE.start_main_#t~nondet7_2| 256))) (and (= v_ULTIMATE.start_cstrreplace_~s.base_1 |v_ULTIMATE.start_cstrreplace_#in~s.base_1|) (= v_ULTIMATE.start_cstrreplace_~old_1 |v_ULTIMATE.start_cstrreplace_#in~old_1|) (= |v_ULTIMATE.start_cstrreplace_#in~s.offset_1| v_ULTIMATE.start_main_~nondetString1~0.offset_5) (= v_ULTIMATE.start_cstrreplace_~numReplaced~0_1 0) (= .cse0 |v_ULTIMATE.start_cstrreplace_#in~new_1|) (= v_ULTIMATE.start_cstrreplace_~p~0.base_1 v_ULTIMATE.start_cstrreplace_~s.base_1) (= v_ULTIMATE.start_cstrreplace_~new_1 |v_ULTIMATE.start_cstrreplace_#in~new_1|) (= v_ULTIMATE.start_cstrreplace_~p~0.offset_1 v_ULTIMATE.start_cstrreplace_~s.offset_1) (= |v_ULTIMATE.start_cstrreplace_#in~s.base_1| v_ULTIMATE.start_main_~nondetString1~0.base_6) (= v_ULTIMATE.start_cstrreplace_~s.offset_1 |v_ULTIMATE.start_cstrreplace_#in~s.offset_1|) (<= .cse1 127) (= |v_ULTIMATE.start_cstrreplace_#in~old_1| .cse1) (<= .cse0 127))) InVars {ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_cstrreplace_#in~old=|v_ULTIMATE.start_cstrreplace_#in~old_1|, ULTIMATE.start_cstrreplace_#res=|v_ULTIMATE.start_cstrreplace_#res_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_1, ULTIMATE.start_cstrreplace_~numReplaced~0=v_ULTIMATE.start_cstrreplace_~numReplaced~0_1, ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_1|, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_1|, ULTIMATE.start_cstrreplace_~s.base=v_ULTIMATE.start_cstrreplace_~s.base_1, ULTIMATE.start_cstrreplace_~new=v_ULTIMATE.start_cstrreplace_~new_1, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6, ULTIMATE.start_cstrreplace_#in~s.offset=|v_ULTIMATE.start_cstrreplace_#in~s.offset_1|, ULTIMATE.start_cstrreplace_#in~s.base=|v_ULTIMATE.start_cstrreplace_#in~s.base_1|, ULTIMATE.start_cstrreplace_#t~post2=|v_ULTIMATE.start_cstrreplace_#t~post2_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_1|, ULTIMATE.start_cstrreplace_~s.offset=v_ULTIMATE.start_cstrreplace_~s.offset_1, ULTIMATE.start_cstrreplace_#in~new=|v_ULTIMATE.start_cstrreplace_#in~new_1|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_~old, ULTIMATE.start_cstrreplace_#in~old, ULTIMATE.start_cstrreplace_#res, ULTIMATE.start_cstrreplace_~p~0.offset, ULTIMATE.start_cstrreplace_~numReplaced~0, ULTIMATE.start_cstrreplace_#t~mem0, ULTIMATE.start_cstrreplace_#t~mem1, ULTIMATE.start_cstrreplace_~s.base, ULTIMATE.start_cstrreplace_~new, ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#in~s.offset, ULTIMATE.start_cstrreplace_#in~s.base, ULTIMATE.start_cstrreplace_#t~post2, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~s.offset, ULTIMATE.start_cstrreplace_#in~new, ULTIMATE.start_cstrreplace_~p~0.base] 170#L9-3 41.82/20.06 [2019-03-28 12:45:28,298 INFO L796 eck$LassoCheckResult]: Loop: 170#L9-3 [52] L9-3-->L9-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_cstrreplace_~p~0.base_3) 1) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrreplace_~p~0.base_3)) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrreplace_~p~0.base_3) v_ULTIMATE.start_cstrreplace_~p~0.offset_3) |v_ULTIMATE.start_cstrreplace_#t~mem0_2|)) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 171#L9-1 [105] L9-1-->L10: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem0_6| 0) InVars {ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_6|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 163#L10 [58] L10-->L10-1: Formula: (and (= (select |v_#valid_9| v_ULTIMATE.start_cstrreplace_~p~0.base_6) 1) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_5) (= |v_ULTIMATE.start_cstrreplace_#t~mem1_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrreplace_~p~0.base_6) v_ULTIMATE.start_cstrreplace_~p~0.offset_5)) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrreplace_~p~0.base_6))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 164#L10-1 [112] L10-1-->L10-3: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem1_6| v_ULTIMATE.start_cstrreplace_~old_4) InVars {ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_6|} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 169#L10-3 [69] L10-3-->L9-3: Formula: (and (= v_ULTIMATE.start_cstrreplace_~p~0.offset_9 (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_10 1)) (= v_ULTIMATE.start_cstrreplace_~p~0.base_12 v_ULTIMATE.start_cstrreplace_~p~0.base_13)) InVars {ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_10, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_13} OutVars{ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_2|, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_2|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_12, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~p~0.base, ULTIMATE.start_cstrreplace_~p~0.offset] 170#L9-3 41.82/20.06 [2019-03-28 12:45:28,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:28,299 INFO L82 PathProgramCache]: Analyzing trace with hash 139095332, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:28,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:28,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:28,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:28,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:28,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:28,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:28,312 INFO L82 PathProgramCache]: Analyzing trace with hash 79839577, now seen corresponding path program 2 times 41.82/20.06 [2019-03-28 12:45:28,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:28,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:28,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:28,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:28,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:28,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:28,319 INFO L82 PathProgramCache]: Analyzing trace with hash -693267946, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:28,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:28,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:28,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:28,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:28,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:28,576 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 41.82/20.06 [2019-03-28 12:45:28,663 INFO L216 LassoAnalysis]: Preferences: 41.82/20.06 [2019-03-28 12:45:28,663 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 41.82/20.06 [2019-03-28 12:45:28,663 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 41.82/20.06 [2019-03-28 12:45:28,663 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 41.82/20.06 [2019-03-28 12:45:28,664 INFO L127 ssoRankerPreferences]: Use exernal solver: false 41.82/20.06 [2019-03-28 12:45:28,664 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 41.82/20.06 [2019-03-28 12:45:28,664 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 41.82/20.06 [2019-03-28 12:45:28,664 INFO L130 ssoRankerPreferences]: Path of dumped script: 41.82/20.06 [2019-03-28 12:45:28,664 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 41.82/20.06 [2019-03-28 12:45:28,664 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 41.82/20.06 [2019-03-28 12:45:28,664 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 41.82/20.06 [2019-03-28 12:45:28,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:28,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:28,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:28,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:28,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:28,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:28,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:28,833 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 41.82/20.06 [2019-03-28 12:45:28,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:28,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:28,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:28,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:28,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:28,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:28,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:29,253 INFO L300 LassoAnalysis]: Preprocessing complete. 41.82/20.06 [2019-03-28 12:45:29,253 INFO L497 LassoAnalysis]: Using template 'affine'. 41.82/20.06 [2019-03-28 12:45:29,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:29,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:29,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:29,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:29,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:29,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:29,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:29,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:29,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:29,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:29,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:29,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:29,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:29,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:29,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:29,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:29,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:29,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:29,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:29,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:29,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:29,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:29,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:29,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:29,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:29,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:29,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:29,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:29,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:29,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:29,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:29,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:29,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:29,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:29,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:29,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:29,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:29,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:29,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:29,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:29,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:29,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:29,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:29,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:29,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:29,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:29,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:29,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:29,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:29,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:29,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:29,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:29,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:29,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:29,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:29,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:29,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:29,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:29,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:29,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:29,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:29,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:29,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:29,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:29,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:29,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:29,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:29,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:29,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:29,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:29,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:29,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:29,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:29,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:29,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:29,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:29,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:29,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:29,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:29,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:29,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:29,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:29,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:29,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:29,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:29,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:29,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:29,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:29,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:29,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:29,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:29,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:29,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:29,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:29,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:29,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:29,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:29,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:29,331 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 41.82/20.06 [2019-03-28 12:45:29,347 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 41.82/20.06 [2019-03-28 12:45:29,348 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. 41.82/20.06 [2019-03-28 12:45:29,348 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 41.82/20.06 [2019-03-28 12:45:29,349 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 41.82/20.06 [2019-03-28 12:45:29,349 INFO L518 LassoAnalysis]: Proved termination. 41.82/20.06 [2019-03-28 12:45:29,350 INFO L520 LassoAnalysis]: Termination argument consisting of: 41.82/20.06 Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_2, ULTIMATE.start_cstrreplace_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_2 - 1*ULTIMATE.start_cstrreplace_~p~0.offset 41.82/20.06 Supporting invariants [] 41.82/20.06 [2019-03-28 12:45:29,369 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed 41.82/20.06 [2019-03-28 12:45:29,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:29,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:29,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:29,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:29,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:29,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:29,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:29,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:29,550 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 41.82/20.06 [2019-03-28 12:45:29,551 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates 41.82/20.06 [2019-03-28 12:45:29,551 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 18 transitions. cyclomatic complexity: 8 Second operand 4 states. 41.82/20.06 [2019-03-28 12:45:29,614 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 18 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 23 states and 37 transitions. Complement of second has 5 states. 41.82/20.06 [2019-03-28 12:45:29,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states 41.82/20.06 [2019-03-28 12:45:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 41.82/20.06 [2019-03-28 12:45:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. 41.82/20.06 [2019-03-28 12:45:29,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 5 letters. Loop has 5 letters. 41.82/20.06 [2019-03-28 12:45:29,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. 41.82/20.06 [2019-03-28 12:45:29,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 10 letters. Loop has 5 letters. 41.82/20.06 [2019-03-28 12:45:29,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. 41.82/20.06 [2019-03-28 12:45:29,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 5 letters. Loop has 10 letters. 41.82/20.06 [2019-03-28 12:45:29,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. 41.82/20.06 [2019-03-28 12:45:29,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 37 transitions. 41.82/20.06 [2019-03-28 12:45:29,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 41.82/20.06 [2019-03-28 12:45:29,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 11 states and 17 transitions. 41.82/20.06 [2019-03-28 12:45:29,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 41.82/20.06 [2019-03-28 12:45:29,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 41.82/20.06 [2019-03-28 12:45:29,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 17 transitions. 41.82/20.06 [2019-03-28 12:45:29,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 41.82/20.06 [2019-03-28 12:45:29,621 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. 41.82/20.06 [2019-03-28 12:45:29,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 17 transitions. 41.82/20.06 [2019-03-28 12:45:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 41.82/20.06 [2019-03-28 12:45:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 41.82/20.06 [2019-03-28 12:45:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. 41.82/20.06 [2019-03-28 12:45:29,622 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. 41.82/20.06 [2019-03-28 12:45:29,623 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. 41.82/20.06 [2019-03-28 12:45:29,623 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 41.82/20.06 [2019-03-28 12:45:29,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 17 transitions. 41.82/20.06 [2019-03-28 12:45:29,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 41.82/20.06 [2019-03-28 12:45:29,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 41.82/20.06 [2019-03-28 12:45:29,624 INFO L119 BuchiIsEmpty]: Starting construction of run 41.82/20.06 [2019-03-28 12:45:29,624 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:29,624 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:29,625 INFO L794 eck$LassoCheckResult]: Stem: 293#ULTIMATE.startENTRY [117] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_#t~malloc5.offset] 291#L21 [78] L21-->L21-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 292#L21-2 [92] L21-2-->L25: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~malloc5.offset] 299#L25 [65] L25-->L25-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} AuxVars[] AssignedVars[#memory_int] 298#L25-1 [98] L25-1-->L9-3: Formula: (let ((.cse1 (mod |v_ULTIMATE.start_main_#t~nondet6_2| 256)) (.cse0 (mod |v_ULTIMATE.start_main_#t~nondet7_2| 256))) (and (= v_ULTIMATE.start_cstrreplace_~s.base_1 |v_ULTIMATE.start_cstrreplace_#in~s.base_1|) (= v_ULTIMATE.start_cstrreplace_~old_1 |v_ULTIMATE.start_cstrreplace_#in~old_1|) (= |v_ULTIMATE.start_cstrreplace_#in~s.offset_1| v_ULTIMATE.start_main_~nondetString1~0.offset_5) (= v_ULTIMATE.start_cstrreplace_~numReplaced~0_1 0) (= v_ULTIMATE.start_cstrreplace_~p~0.base_1 v_ULTIMATE.start_cstrreplace_~s.base_1) (= v_ULTIMATE.start_cstrreplace_~new_1 |v_ULTIMATE.start_cstrreplace_#in~new_1|) (= v_ULTIMATE.start_cstrreplace_~p~0.offset_1 v_ULTIMATE.start_cstrreplace_~s.offset_1) (= |v_ULTIMATE.start_cstrreplace_#in~new_1| (+ .cse0 (- 256))) (= |v_ULTIMATE.start_cstrreplace_#in~s.base_1| v_ULTIMATE.start_main_~nondetString1~0.base_6) (= v_ULTIMATE.start_cstrreplace_~s.offset_1 |v_ULTIMATE.start_cstrreplace_#in~s.offset_1|) (<= .cse1 127) (= |v_ULTIMATE.start_cstrreplace_#in~old_1| .cse1) (> .cse0 127))) InVars {ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_cstrreplace_#in~old=|v_ULTIMATE.start_cstrreplace_#in~old_1|, ULTIMATE.start_cstrreplace_#res=|v_ULTIMATE.start_cstrreplace_#res_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_1, ULTIMATE.start_cstrreplace_~numReplaced~0=v_ULTIMATE.start_cstrreplace_~numReplaced~0_1, ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_1|, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_1|, ULTIMATE.start_cstrreplace_~s.base=v_ULTIMATE.start_cstrreplace_~s.base_1, ULTIMATE.start_cstrreplace_~new=v_ULTIMATE.start_cstrreplace_~new_1, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6, ULTIMATE.start_cstrreplace_#in~s.offset=|v_ULTIMATE.start_cstrreplace_#in~s.offset_1|, ULTIMATE.start_cstrreplace_#in~s.base=|v_ULTIMATE.start_cstrreplace_#in~s.base_1|, ULTIMATE.start_cstrreplace_#t~post2=|v_ULTIMATE.start_cstrreplace_#t~post2_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_1|, ULTIMATE.start_cstrreplace_~s.offset=v_ULTIMATE.start_cstrreplace_~s.offset_1, ULTIMATE.start_cstrreplace_#in~new=|v_ULTIMATE.start_cstrreplace_#in~new_1|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_~old, ULTIMATE.start_cstrreplace_#in~old, ULTIMATE.start_cstrreplace_#res, ULTIMATE.start_cstrreplace_~p~0.offset, ULTIMATE.start_cstrreplace_~numReplaced~0, ULTIMATE.start_cstrreplace_#t~mem0, ULTIMATE.start_cstrreplace_#t~mem1, ULTIMATE.start_cstrreplace_~s.base, ULTIMATE.start_cstrreplace_~new, ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#in~s.offset, ULTIMATE.start_cstrreplace_#in~s.base, ULTIMATE.start_cstrreplace_#t~post2, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~s.offset, ULTIMATE.start_cstrreplace_#in~new, ULTIMATE.start_cstrreplace_~p~0.base] 296#L9-3 41.82/20.06 [2019-03-28 12:45:29,625 INFO L796 eck$LassoCheckResult]: Loop: 296#L9-3 [52] L9-3-->L9-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_cstrreplace_~p~0.base_3) 1) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrreplace_~p~0.base_3)) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrreplace_~p~0.base_3) v_ULTIMATE.start_cstrreplace_~p~0.offset_3) |v_ULTIMATE.start_cstrreplace_#t~mem0_2|)) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 297#L9-1 [105] L9-1-->L10: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem0_6| 0) InVars {ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_6|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 289#L10 [58] L10-->L10-1: Formula: (and (= (select |v_#valid_9| v_ULTIMATE.start_cstrreplace_~p~0.base_6) 1) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_5) (= |v_ULTIMATE.start_cstrreplace_#t~mem1_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrreplace_~p~0.base_6) v_ULTIMATE.start_cstrreplace_~p~0.offset_5)) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrreplace_~p~0.base_6))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 290#L10-1 [112] L10-1-->L10-3: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem1_6| v_ULTIMATE.start_cstrreplace_~old_4) InVars {ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_6|} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 295#L10-3 [69] L10-3-->L9-3: Formula: (and (= v_ULTIMATE.start_cstrreplace_~p~0.offset_9 (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_10 1)) (= v_ULTIMATE.start_cstrreplace_~p~0.base_12 v_ULTIMATE.start_cstrreplace_~p~0.base_13)) InVars {ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_10, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_13} OutVars{ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_2|, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_2|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_12, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~p~0.base, ULTIMATE.start_cstrreplace_~p~0.offset] 296#L9-3 41.82/20.06 [2019-03-28 12:45:29,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:29,625 INFO L82 PathProgramCache]: Analyzing trace with hash 139095331, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:29,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:29,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:29,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:29,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:29,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:29,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:29,637 INFO L82 PathProgramCache]: Analyzing trace with hash 79839577, now seen corresponding path program 3 times 41.82/20.06 [2019-03-28 12:45:29,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:29,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:29,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:29,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:29,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:29,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:29,644 INFO L82 PathProgramCache]: Analyzing trace with hash -721897097, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:29,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:29,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:29,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:29,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:29,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:29,896 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 41.82/20.06 [2019-03-28 12:45:29,986 INFO L216 LassoAnalysis]: Preferences: 41.82/20.06 [2019-03-28 12:45:29,987 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 41.82/20.06 [2019-03-28 12:45:29,987 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 41.82/20.06 [2019-03-28 12:45:29,987 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 41.82/20.06 [2019-03-28 12:45:29,987 INFO L127 ssoRankerPreferences]: Use exernal solver: false 41.82/20.06 [2019-03-28 12:45:29,987 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 41.82/20.06 [2019-03-28 12:45:29,987 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 41.82/20.06 [2019-03-28 12:45:29,987 INFO L130 ssoRankerPreferences]: Path of dumped script: 41.82/20.06 [2019-03-28 12:45:29,987 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 41.82/20.06 [2019-03-28 12:45:29,988 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 41.82/20.06 [2019-03-28 12:45:29,988 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 41.82/20.06 [2019-03-28 12:45:29,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:29,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:29,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:30,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:30,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:30,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:30,157 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 41.82/20.06 [2019-03-28 12:45:30,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:30,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:30,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:30,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:30,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:30,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:30,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:30,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:30,574 INFO L300 LassoAnalysis]: Preprocessing complete. 41.82/20.06 [2019-03-28 12:45:30,575 INFO L497 LassoAnalysis]: Using template 'affine'. 41.82/20.06 [2019-03-28 12:45:30,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:30,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:30,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:30,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:30,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:30,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:30,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:30,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:30,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:30,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:30,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:30,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:30,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:30,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:30,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:30,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:30,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:30,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:30,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:30,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:30,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:30,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:30,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:30,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:30,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:30,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:30,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:30,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:30,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:30,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:30,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:30,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:30,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:30,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:30,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:30,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:30,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:30,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:30,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:30,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:30,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:30,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:30,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:30,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:30,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:30,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:30,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:30,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:30,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:30,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:30,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:30,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:30,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:30,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:30,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:30,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:30,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:30,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:30,627 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 41.82/20.06 [2019-03-28 12:45:30,639 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 41.82/20.06 [2019-03-28 12:45:30,639 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. 41.82/20.06 [2019-03-28 12:45:30,639 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 41.82/20.06 [2019-03-28 12:45:30,640 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 41.82/20.06 [2019-03-28 12:45:30,641 INFO L518 LassoAnalysis]: Proved termination. 41.82/20.06 [2019-03-28 12:45:30,641 INFO L520 LassoAnalysis]: Termination argument consisting of: 41.82/20.06 Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_3, ULTIMATE.start_cstrreplace_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_3 - 1*ULTIMATE.start_cstrreplace_~p~0.offset 41.82/20.06 Supporting invariants [] 41.82/20.06 [2019-03-28 12:45:30,651 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed 41.82/20.06 [2019-03-28 12:45:30,653 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:30,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:30,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:30,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:30,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:30,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:30,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:30,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:30,814 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 41.82/20.06 [2019-03-28 12:45:30,815 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates 41.82/20.06 [2019-03-28 12:45:30,815 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. 41.82/20.06 [2019-03-28 12:45:30,876 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 17 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 23 states and 36 transitions. Complement of second has 5 states. 41.82/20.06 [2019-03-28 12:45:30,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states 41.82/20.06 [2019-03-28 12:45:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 41.82/20.06 [2019-03-28 12:45:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. 41.82/20.06 [2019-03-28 12:45:30,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 5 letters. 41.82/20.06 [2019-03-28 12:45:30,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. 41.82/20.06 [2019-03-28 12:45:30,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 10 letters. Loop has 5 letters. 41.82/20.06 [2019-03-28 12:45:30,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. 41.82/20.06 [2019-03-28 12:45:30,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 10 letters. 41.82/20.06 [2019-03-28 12:45:30,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. 41.82/20.06 [2019-03-28 12:45:30,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 36 transitions. 41.82/20.06 [2019-03-28 12:45:30,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 41.82/20.06 [2019-03-28 12:45:30,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 11 states and 16 transitions. 41.82/20.06 [2019-03-28 12:45:30,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 41.82/20.06 [2019-03-28 12:45:30,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 41.82/20.06 [2019-03-28 12:45:30,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. 41.82/20.06 [2019-03-28 12:45:30,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 41.82/20.06 [2019-03-28 12:45:30,883 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. 41.82/20.06 [2019-03-28 12:45:30,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. 41.82/20.06 [2019-03-28 12:45:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 41.82/20.06 [2019-03-28 12:45:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 41.82/20.06 [2019-03-28 12:45:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. 41.82/20.06 [2019-03-28 12:45:30,885 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. 41.82/20.06 [2019-03-28 12:45:30,885 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. 41.82/20.06 [2019-03-28 12:45:30,885 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 41.82/20.06 [2019-03-28 12:45:30,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. 41.82/20.06 [2019-03-28 12:45:30,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 41.82/20.06 [2019-03-28 12:45:30,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 41.82/20.06 [2019-03-28 12:45:30,886 INFO L119 BuchiIsEmpty]: Starting construction of run 41.82/20.06 [2019-03-28 12:45:30,886 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:30,886 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 41.82/20.06 [2019-03-28 12:45:30,887 INFO L794 eck$LassoCheckResult]: Stem: 419#ULTIMATE.startENTRY [117] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_#t~malloc5.offset] 417#L21 [78] L21-->L21-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 418#L21-2 [92] L21-2-->L25: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~malloc5.offset] 425#L25 [65] L25-->L25-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} AuxVars[] AssignedVars[#memory_int] 424#L25-1 [97] L25-1-->L9-3: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet6_2| 256)) (.cse1 (mod |v_ULTIMATE.start_main_#t~nondet7_2| 256))) (and (= v_ULTIMATE.start_cstrreplace_~s.base_1 |v_ULTIMATE.start_cstrreplace_#in~s.base_1|) (> .cse0 127) (= v_ULTIMATE.start_cstrreplace_~old_1 |v_ULTIMATE.start_cstrreplace_#in~old_1|) (= |v_ULTIMATE.start_cstrreplace_#in~s.offset_1| v_ULTIMATE.start_main_~nondetString1~0.offset_5) (= v_ULTIMATE.start_cstrreplace_~numReplaced~0_1 0) (= .cse1 |v_ULTIMATE.start_cstrreplace_#in~new_1|) (= v_ULTIMATE.start_cstrreplace_~p~0.base_1 v_ULTIMATE.start_cstrreplace_~s.base_1) (= v_ULTIMATE.start_cstrreplace_~new_1 |v_ULTIMATE.start_cstrreplace_#in~new_1|) (= v_ULTIMATE.start_cstrreplace_~p~0.offset_1 v_ULTIMATE.start_cstrreplace_~s.offset_1) (= |v_ULTIMATE.start_cstrreplace_#in~s.base_1| v_ULTIMATE.start_main_~nondetString1~0.base_6) (= |v_ULTIMATE.start_cstrreplace_#in~old_1| (+ .cse0 (- 256))) (= v_ULTIMATE.start_cstrreplace_~s.offset_1 |v_ULTIMATE.start_cstrreplace_#in~s.offset_1|) (<= .cse1 127))) InVars {ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_cstrreplace_#in~old=|v_ULTIMATE.start_cstrreplace_#in~old_1|, ULTIMATE.start_cstrreplace_#res=|v_ULTIMATE.start_cstrreplace_#res_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_1, ULTIMATE.start_cstrreplace_~numReplaced~0=v_ULTIMATE.start_cstrreplace_~numReplaced~0_1, ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_1|, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_1|, ULTIMATE.start_cstrreplace_~s.base=v_ULTIMATE.start_cstrreplace_~s.base_1, ULTIMATE.start_cstrreplace_~new=v_ULTIMATE.start_cstrreplace_~new_1, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6, ULTIMATE.start_cstrreplace_#in~s.offset=|v_ULTIMATE.start_cstrreplace_#in~s.offset_1|, ULTIMATE.start_cstrreplace_#in~s.base=|v_ULTIMATE.start_cstrreplace_#in~s.base_1|, ULTIMATE.start_cstrreplace_#t~post2=|v_ULTIMATE.start_cstrreplace_#t~post2_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_1|, ULTIMATE.start_cstrreplace_~s.offset=v_ULTIMATE.start_cstrreplace_~s.offset_1, ULTIMATE.start_cstrreplace_#in~new=|v_ULTIMATE.start_cstrreplace_#in~new_1|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_~old, ULTIMATE.start_cstrreplace_#in~old, ULTIMATE.start_cstrreplace_#res, ULTIMATE.start_cstrreplace_~p~0.offset, ULTIMATE.start_cstrreplace_~numReplaced~0, ULTIMATE.start_cstrreplace_#t~mem0, ULTIMATE.start_cstrreplace_#t~mem1, ULTIMATE.start_cstrreplace_~s.base, ULTIMATE.start_cstrreplace_~new, ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#in~s.offset, ULTIMATE.start_cstrreplace_#in~s.base, ULTIMATE.start_cstrreplace_#t~post2, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~s.offset, ULTIMATE.start_cstrreplace_#in~new, ULTIMATE.start_cstrreplace_~p~0.base] 422#L9-3 41.82/20.06 [2019-03-28 12:45:30,887 INFO L796 eck$LassoCheckResult]: Loop: 422#L9-3 [52] L9-3-->L9-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_cstrreplace_~p~0.base_3) 1) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrreplace_~p~0.base_3)) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrreplace_~p~0.base_3) v_ULTIMATE.start_cstrreplace_~p~0.offset_3) |v_ULTIMATE.start_cstrreplace_#t~mem0_2|)) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 423#L9-1 [105] L9-1-->L10: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem0_6| 0) InVars {ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_6|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 415#L10 [58] L10-->L10-1: Formula: (and (= (select |v_#valid_9| v_ULTIMATE.start_cstrreplace_~p~0.base_6) 1) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_5) (= |v_ULTIMATE.start_cstrreplace_#t~mem1_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrreplace_~p~0.base_6) v_ULTIMATE.start_cstrreplace_~p~0.offset_5)) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrreplace_~p~0.base_6))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 416#L10-1 [112] L10-1-->L10-3: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem1_6| v_ULTIMATE.start_cstrreplace_~old_4) InVars {ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_6|} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 421#L10-3 [69] L10-3-->L9-3: Formula: (and (= v_ULTIMATE.start_cstrreplace_~p~0.offset_9 (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_10 1)) (= v_ULTIMATE.start_cstrreplace_~p~0.base_12 v_ULTIMATE.start_cstrreplace_~p~0.base_13)) InVars {ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_10, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_13} OutVars{ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_2|, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_2|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_12, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~p~0.base, ULTIMATE.start_cstrreplace_~p~0.offset] 422#L9-3 41.82/20.06 [2019-03-28 12:45:30,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:30,887 INFO L82 PathProgramCache]: Analyzing trace with hash 139095330, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:30,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:30,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:30,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:30,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:30,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:30,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash 79839577, now seen corresponding path program 4 times 41.82/20.06 [2019-03-28 12:45:30,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:30,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:30,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:30,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:30,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:30,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:30,904 INFO L82 PathProgramCache]: Analyzing trace with hash -750526248, now seen corresponding path program 1 times 41.82/20.06 [2019-03-28 12:45:30,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 41.82/20.06 [2019-03-28 12:45:30,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 41.82/20.06 [2019-03-28 12:45:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:30,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 41.82/20.06 [2019-03-28 12:45:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 41.82/20.06 [2019-03-28 12:45:31,106 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 41.82/20.06 [2019-03-28 12:45:31,172 INFO L216 LassoAnalysis]: Preferences: 41.82/20.06 [2019-03-28 12:45:31,173 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 41.82/20.06 [2019-03-28 12:45:31,173 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 41.82/20.06 [2019-03-28 12:45:31,173 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 41.82/20.06 [2019-03-28 12:45:31,173 INFO L127 ssoRankerPreferences]: Use exernal solver: false 41.82/20.06 [2019-03-28 12:45:31,173 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 41.82/20.06 [2019-03-28 12:45:31,173 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 41.82/20.06 [2019-03-28 12:45:31,173 INFO L130 ssoRankerPreferences]: Path of dumped script: 41.82/20.06 [2019-03-28 12:45:31,173 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 41.82/20.06 [2019-03-28 12:45:31,174 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 41.82/20.06 [2019-03-28 12:45:31,174 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 41.82/20.06 [2019-03-28 12:45:31,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:31,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:31,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:31,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:31,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:31,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:31,356 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 41.82/20.06 [2019-03-28 12:45:31,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:31,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:31,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:31,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:31,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:31,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:31,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:31,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 41.82/20.06 [2019-03-28 12:45:31,745 INFO L300 LassoAnalysis]: Preprocessing complete. 41.82/20.06 [2019-03-28 12:45:31,745 INFO L497 LassoAnalysis]: Using template 'affine'. 41.82/20.06 [2019-03-28 12:45:31,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:31,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:31,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:31,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:31,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:31,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:31,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:31,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:31,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:31,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:31,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:31,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:31,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:31,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:31,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:31,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:31,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:31,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:31,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:31,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:31,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:31,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:31,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:31,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:31,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:31,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:31,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:31,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:31,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:31,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:31,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:31,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:31,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:31,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:31,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:31,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:31,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:31,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 41.82/20.06 [2019-03-28 12:45:31,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:31,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:31,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:31,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:31,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:31,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:31,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:31,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:31,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:31,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:31,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:31,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:31,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:31,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 41.82/20.06 [2019-03-28 12:45:31,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 41.82/20.06 Termination analysis: LINEAR_WITH_GUESSES 41.82/20.06 Number of strict supporting invariants: 0 41.82/20.06 Number of non-strict supporting invariants: 1 41.82/20.06 Consider only non-deceasing supporting invariants: true 41.82/20.06 Simplify termination arguments: true 41.82/20.06 Simplify supporting invariants: trueOverapproximate stem: false 41.82/20.06 [2019-03-28 12:45:31,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. 41.82/20.06 [2019-03-28 12:45:31,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 41.82/20.06 [2019-03-28 12:45:31,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 41.82/20.06 [2019-03-28 12:45:31,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 41.82/20.06 [2019-03-28 12:45:31,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 41.82/20.06 [2019-03-28 12:45:31,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 41.82/20.06 [2019-03-28 12:45:31,776 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 41.82/20.06 [2019-03-28 12:45:31,781 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 41.82/20.06 [2019-03-28 12:45:31,782 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 41.82/20.06 [2019-03-28 12:45:31,782 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 41.82/20.06 [2019-03-28 12:45:31,783 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 41.82/20.06 [2019-03-28 12:45:31,783 INFO L518 LassoAnalysis]: Proved termination. 41.82/20.06 [2019-03-28 12:45:31,783 INFO L520 LassoAnalysis]: Termination argument consisting of: 41.82/20.06 Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_4, ULTIMATE.start_cstrreplace_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_4 - 1*ULTIMATE.start_cstrreplace_~p~0.offset 41.82/20.06 Supporting invariants [] 41.82/20.06 [2019-03-28 12:45:31,793 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed 41.82/20.06 [2019-03-28 12:45:31,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.06 [2019-03-28 12:45:31,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 41.82/20.06 [2019-03-28 12:45:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:31,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:31,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:31,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:31,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 41.82/20.06 [2019-03-28 12:45:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 41.82/20.06 [2019-03-28 12:45:31,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core 41.82/20.06 [2019-03-28 12:45:31,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... 41.82/20.06 [2019-03-28 12:45:31,962 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 41.82/20.06 [2019-03-28 12:45:31,963 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates 41.82/20.06 [2019-03-28 12:45:31,963 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. 41.82/20.06 [2019-03-28 12:45:32,019 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 16 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 17 states and 26 transitions. Complement of second has 5 states. 41.82/20.06 [2019-03-28 12:45:32,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states 41.82/20.06 [2019-03-28 12:45:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 41.82/20.06 [2019-03-28 12:45:32,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. 41.82/20.06 [2019-03-28 12:45:32,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 5 letters. Loop has 5 letters. 41.82/20.06 [2019-03-28 12:45:32,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. 41.82/20.06 [2019-03-28 12:45:32,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 10 letters. Loop has 5 letters. 41.82/20.06 [2019-03-28 12:45:32,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. 41.82/20.06 [2019-03-28 12:45:32,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 5 letters. Loop has 10 letters. 41.82/20.06 [2019-03-28 12:45:32,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. 41.82/20.06 [2019-03-28 12:45:32,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 26 transitions. 41.82/20.06 [2019-03-28 12:45:32,024 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 41.82/20.06 [2019-03-28 12:45:32,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 0 states and 0 transitions. 41.82/20.06 [2019-03-28 12:45:32,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 41.82/20.07 [2019-03-28 12:45:32,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 41.82/20.07 [2019-03-28 12:45:32,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 41.82/20.07 [2019-03-28 12:45:32,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 41.82/20.07 [2019-03-28 12:45:32,025 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 41.82/20.07 [2019-03-28 12:45:32,025 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 41.82/20.07 [2019-03-28 12:45:32,025 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 41.82/20.07 [2019-03-28 12:45:32,025 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 41.82/20.07 [2019-03-28 12:45:32,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 41.82/20.07 [2019-03-28 12:45:32,026 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 41.82/20.07 [2019-03-28 12:45:32,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 41.82/20.07 [2019-03-28 12:45:32,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:32 BasicIcfg 41.82/20.07 [2019-03-28 12:45:32,032 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 41.82/20.07 [2019-03-28 12:45:32,032 INFO L168 Benchmark]: Toolchain (without parser) took 15616.58 ms. Allocated memory was 649.6 MB in the beginning and 935.9 MB in the end (delta: 286.3 MB). Free memory was 558.5 MB in the beginning and 731.5 MB in the end (delta: -173.0 MB). Peak memory consumption was 113.2 MB. Max. memory is 50.3 GB. 41.82/20.07 [2019-03-28 12:45:32,033 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 41.82/20.07 [2019-03-28 12:45:32,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.41 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 558.5 MB in the beginning and 641.1 MB in the end (delta: -82.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 50.3 GB. 41.82/20.07 [2019-03-28 12:45:32,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.17 ms. Allocated memory is still 674.8 MB. Free memory was 641.1 MB in the beginning and 638.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 41.82/20.07 [2019-03-28 12:45:32,035 INFO L168 Benchmark]: Boogie Preprocessor took 26.96 ms. Allocated memory is still 674.8 MB. Free memory was 638.0 MB in the beginning and 636.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 41.82/20.07 [2019-03-28 12:45:32,035 INFO L168 Benchmark]: RCFGBuilder took 299.56 ms. Allocated memory is still 674.8 MB. Free memory was 636.7 MB in the beginning and 615.9 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 50.3 GB. 41.82/20.07 [2019-03-28 12:45:32,036 INFO L168 Benchmark]: BlockEncodingV2 took 123.42 ms. Allocated memory is still 674.8 MB. Free memory was 615.9 MB in the beginning and 607.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 41.82/20.07 [2019-03-28 12:45:32,036 INFO L168 Benchmark]: TraceAbstraction took 9684.90 ms. Allocated memory was 674.8 MB in the beginning and 839.9 MB in the end (delta: 165.2 MB). Free memory was 606.5 MB in the beginning and 781.4 MB in the end (delta: -174.9 MB). Peak memory consumption was 322.9 MB. Max. memory is 50.3 GB. 41.82/20.07 [2019-03-28 12:45:32,037 INFO L168 Benchmark]: BuchiAutomizer took 5117.66 ms. Allocated memory was 839.9 MB in the beginning and 935.9 MB in the end (delta: 95.9 MB). Free memory was 781.4 MB in the beginning and 731.5 MB in the end (delta: 49.9 MB). Peak memory consumption was 145.8 MB. Max. memory is 50.3 GB. 41.82/20.07 [2019-03-28 12:45:32,042 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 41.82/20.07 --- Results --- 41.82/20.07 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 41.82/20.07 - StatisticsResult: Initial Icfg 41.82/20.07 26 locations, 29 edges 41.82/20.07 - StatisticsResult: Encoded RCFG 41.82/20.07 19 locations, 35 edges 41.82/20.07 * Results from de.uni_freiburg.informatik.ultimate.core: 41.82/20.07 - StatisticsResult: Toolchain Benchmarks 41.82/20.07 Benchmark results are: 41.82/20.07 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 41.82/20.07 * CACSL2BoogieTranslator took 318.41 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 558.5 MB in the beginning and 641.1 MB in the end (delta: -82.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 50.3 GB. 41.82/20.07 * Boogie Procedure Inliner took 40.17 ms. Allocated memory is still 674.8 MB. Free memory was 641.1 MB in the beginning and 638.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 41.82/20.07 * Boogie Preprocessor took 26.96 ms. Allocated memory is still 674.8 MB. Free memory was 638.0 MB in the beginning and 636.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 41.82/20.07 * RCFGBuilder took 299.56 ms. Allocated memory is still 674.8 MB. Free memory was 636.7 MB in the beginning and 615.9 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 50.3 GB. 41.82/20.07 * BlockEncodingV2 took 123.42 ms. Allocated memory is still 674.8 MB. Free memory was 615.9 MB in the beginning and 607.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 41.82/20.07 * TraceAbstraction took 9684.90 ms. Allocated memory was 674.8 MB in the beginning and 839.9 MB in the end (delta: 165.2 MB). Free memory was 606.5 MB in the beginning and 781.4 MB in the end (delta: -174.9 MB). Peak memory consumption was 322.9 MB. Max. memory is 50.3 GB. 41.82/20.07 * BuchiAutomizer took 5117.66 ms. Allocated memory was 839.9 MB in the beginning and 935.9 MB in the end (delta: 95.9 MB). Free memory was 781.4 MB in the beginning and 731.5 MB in the end (delta: 49.9 MB). Peak memory consumption was 145.8 MB. Max. memory is 50.3 GB. 41.82/20.07 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.07 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #memory_int 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #memory_int 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #memory_int 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #memory_int 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #memory_int 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #memory_int 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #memory_int 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #memory_int 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #memory_int 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #memory_int 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #memory_int 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #memory_int 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #memory_int 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #memory_int 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 - GenericResult: Unfinished Backtranslation 41.82/20.07 unknown boogie variable #length 41.82/20.07 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 41.82/20.07 - PositiveResult [Line: 10]: pointer dereference always succeeds 41.82/20.07 For all program executions holds that pointer dereference always succeeds at this location 41.82/20.07 - PositiveResult [Line: 25]: pointer dereference always succeeds 41.82/20.07 For all program executions holds that pointer dereference always succeeds at this location 41.82/20.07 - PositiveResult [Line: 9]: pointer dereference always succeeds 41.82/20.07 For all program executions holds that pointer dereference always succeeds at this location 41.82/20.07 - PositiveResult [Line: 10]: pointer dereference always succeeds 41.82/20.07 For all program executions holds that pointer dereference always succeeds at this location 41.82/20.07 - PositiveResult [Line: 11]: pointer dereference always succeeds 41.82/20.07 For all program executions holds that pointer dereference always succeeds at this location 41.82/20.07 - PositiveResult [Line: 9]: pointer dereference always succeeds 41.82/20.07 For all program executions holds that pointer dereference always succeeds at this location 41.82/20.07 - PositiveResult [Line: 11]: pointer dereference always succeeds 41.82/20.07 For all program executions holds that pointer dereference always succeeds at this location 41.82/20.07 - PositiveResult [Line: 25]: pointer dereference always succeeds 41.82/20.07 For all program executions holds that pointer dereference always succeeds at this location 41.82/20.07 - AllSpecificationsHoldResult: All specifications hold 41.82/20.07 8 specifications checked. All of them hold 41.82/20.07 - InvariantResult [Line: 9]: Loop Invariant 41.82/20.07 [2019-03-28 12:45:32,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.07 [2019-03-28 12:45:32,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.07 [2019-03-28 12:45:32,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.07 [2019-03-28 12:45:32,054 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,054 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,054 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,054 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.07 [2019-03-28 12:45:32,055 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.07 [2019-03-28 12:45:32,056 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,056 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.07 [2019-03-28 12:45:32,056 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,056 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.07 [2019-03-28 12:45:32,056 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.07 [2019-03-28 12:45:32,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.07 [2019-03-28 12:45:32,058 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,058 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.07 [2019-03-28 12:45:32,058 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,059 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.07 [2019-03-28 12:45:32,059 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.07 [2019-03-28 12:45:32,059 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 41.82/20.07 [2019-03-28 12:45:32,061 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,061 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,061 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.07 [2019-03-28 12:45:32,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.07 [2019-03-28 12:45:32,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.07 [2019-03-28 12:45:32,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.07 [2019-03-28 12:45:32,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.07 [2019-03-28 12:45:32,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.07 [2019-03-28 12:45:32,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 [2019-03-28 12:45:32,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 41.82/20.07 [2019-03-28 12:45:32,065 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 41.82/20.07 Derived loop invariant: (((((((((1 == \valid[nondetString1] && length1 == unknown-#length-unknown[nondetString1]) && nondetString1 == 0) && 1 == \valid[p]) && 1 <= unknown-#length-unknown[p]) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1] == 0) && p == 0) || (((((((((0 == unknown-#memory_int-unknown[p][p] && 1 <= length1) && nondetString1 + length1 <= 1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[p]) && unknown-#memory_int-unknown[nondetString1][nondetString1] == 0) && 1 <= unknown-#length-unknown[p]) && p == 0)) || ((((((((p + 1 <= unknown-#length-unknown[p] && 1 <= length1) && 1 == \valid[nondetString1]) && length1 == unknown-#length-unknown[nondetString1]) && nondetString1 == 0) && 1 == \valid[p]) && 1 <= p) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1] == 0) 41.82/20.07 - StatisticsResult: Ultimate Automizer benchmark data 41.82/20.07 CFG has 1 procedures, 19 locations, 8 error locations. SAFE Result, 9.5s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 34 SDtfs, 873 SDslu, 176 SDs, 0 SdLazy, 735 SolverSat, 361 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 57 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 9 NumberOfFragments, 178 HoareAnnotationTreeSize, 1 FomulaSimplifications, 1860 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1088 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 139 ConstructedInterpolants, 15 QuantifiedInterpolants, 20497 SizeOfPredicates, 31 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 17/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 41.82/20.07 - StatisticsResult: Constructed decomposition of program 41.82/20.07 Your program was decomposed into 4 terminating modules (0 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function -1 * p + unknown-#length-unknown[alloca(length1 * sizeof(char))] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length1 * sizeof(char))] + -1 * p and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length1 * sizeof(char))] + -1 * p and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length1 * sizeof(char))] + -1 * p and consists of 4 locations. 41.82/20.07 - StatisticsResult: Timing statistics 41.82/20.07 BüchiAutomizer plugin needed 5.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 32 SDtfs, 270 SDslu, 48 SDs, 0 SdLazy, 196 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital150 mio100 ax100 hnf100 lsp84 ukn89 mio100 lsp40 div126 bol100 ite100 ukn100 eq150 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 41.82/20.07 - TerminationAnalysisResult: Termination proven 41.82/20.07 Buchi Automizer proved that your program is terminating 41.82/20.07 RESULT: Ultimate proved your program to be correct! 41.82/20.07 !SESSION 2019-03-28 12:45:13.129 ----------------------------------------------- 41.82/20.07 eclipse.buildId=unknown 41.82/20.07 java.version=1.8.0_181 41.82/20.07 java.vendor=Oracle Corporation 41.82/20.07 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 41.82/20.07 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 41.82/20.07 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 41.82/20.07 41.82/20.07 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:45:32.292 41.82/20.07 !MESSAGE The workspace will exit with unsaved changes in this session. 41.82/20.07 Received shutdown request... 41.82/20.07 Ultimate: 41.82/20.07 GTK+ Version Check 41.82/20.07 EOF