66.53/35.80 YES 66.53/35.80 66.53/35.80 Ultimate: Cannot open display: 66.53/35.80 This is Ultimate 0.1.24-8dc7c08-m 66.53/35.80 [2019-03-28 12:46:15,371 INFO L170 SettingsManager]: Resetting all preferences to default values... 66.53/35.80 [2019-03-28 12:46:15,374 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 66.53/35.80 [2019-03-28 12:46:15,385 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 66.53/35.80 [2019-03-28 12:46:15,385 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 66.53/35.80 [2019-03-28 12:46:15,387 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 66.53/35.80 [2019-03-28 12:46:15,388 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 66.53/35.80 [2019-03-28 12:46:15,389 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 66.53/35.80 [2019-03-28 12:46:15,391 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 66.53/35.80 [2019-03-28 12:46:15,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 66.53/35.80 [2019-03-28 12:46:15,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 66.53/35.80 [2019-03-28 12:46:15,393 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 66.53/35.80 [2019-03-28 12:46:15,393 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 66.53/35.80 [2019-03-28 12:46:15,394 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 66.53/35.80 [2019-03-28 12:46:15,395 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 66.53/35.80 [2019-03-28 12:46:15,396 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 66.53/35.80 [2019-03-28 12:46:15,397 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 66.53/35.80 [2019-03-28 12:46:15,399 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 66.53/35.80 [2019-03-28 12:46:15,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 66.53/35.80 [2019-03-28 12:46:15,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 66.53/35.80 [2019-03-28 12:46:15,403 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 66.53/35.80 [2019-03-28 12:46:15,404 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 66.53/35.80 [2019-03-28 12:46:15,406 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 66.53/35.80 [2019-03-28 12:46:15,407 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 66.53/35.80 [2019-03-28 12:46:15,407 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 66.53/35.80 [2019-03-28 12:46:15,408 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 66.53/35.80 [2019-03-28 12:46:15,408 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 66.53/35.80 [2019-03-28 12:46:15,409 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 66.53/35.80 [2019-03-28 12:46:15,409 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 66.53/35.80 [2019-03-28 12:46:15,410 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 66.53/35.80 [2019-03-28 12:46:15,410 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 66.53/35.80 [2019-03-28 12:46:15,411 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 66.53/35.80 [2019-03-28 12:46:15,412 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 66.53/35.80 [2019-03-28 12:46:15,412 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 66.53/35.80 [2019-03-28 12:46:15,413 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 66.53/35.80 [2019-03-28 12:46:15,413 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 66.53/35.80 [2019-03-28 12:46:15,413 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 66.53/35.80 [2019-03-28 12:46:15,414 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 66.53/35.80 [2019-03-28 12:46:15,415 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 66.53/35.80 [2019-03-28 12:46:15,415 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 66.53/35.80 [2019-03-28 12:46:15,430 INFO L110 SettingsManager]: Loading preferences was successful 66.53/35.80 [2019-03-28 12:46:15,430 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 66.53/35.80 [2019-03-28 12:46:15,431 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 66.53/35.80 [2019-03-28 12:46:15,431 INFO L133 SettingsManager]: * Rewrite not-equals=true 66.53/35.80 [2019-03-28 12:46:15,432 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 66.53/35.80 [2019-03-28 12:46:15,432 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 66.53/35.80 [2019-03-28 12:46:15,432 INFO L133 SettingsManager]: * Use SBE=true 66.53/35.80 [2019-03-28 12:46:15,432 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 66.53/35.80 [2019-03-28 12:46:15,432 INFO L133 SettingsManager]: * Use old map elimination=false 66.53/35.80 [2019-03-28 12:46:15,432 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 66.53/35.80 [2019-03-28 12:46:15,433 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 66.53/35.80 [2019-03-28 12:46:15,433 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 66.53/35.80 [2019-03-28 12:46:15,433 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 66.53/35.80 [2019-03-28 12:46:15,433 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 66.53/35.80 [2019-03-28 12:46:15,433 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 66.53/35.80 [2019-03-28 12:46:15,433 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 66.53/35.80 [2019-03-28 12:46:15,434 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 66.53/35.80 [2019-03-28 12:46:15,434 INFO L133 SettingsManager]: * Check division by zero=IGNORE 66.53/35.80 [2019-03-28 12:46:15,434 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 66.53/35.80 [2019-03-28 12:46:15,434 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 66.53/35.80 [2019-03-28 12:46:15,434 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 66.53/35.80 [2019-03-28 12:46:15,435 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 66.53/35.80 [2019-03-28 12:46:15,435 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 66.53/35.80 [2019-03-28 12:46:15,435 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 66.53/35.80 [2019-03-28 12:46:15,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 66.53/35.80 [2019-03-28 12:46:15,435 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 66.53/35.80 [2019-03-28 12:46:15,435 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 66.53/35.80 [2019-03-28 12:46:15,436 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 66.53/35.80 [2019-03-28 12:46:15,436 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 66.53/35.80 [2019-03-28 12:46:15,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 66.53/35.80 [2019-03-28 12:46:15,474 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 66.53/35.80 [2019-03-28 12:46:15,478 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 66.53/35.80 [2019-03-28 12:46:15,479 INFO L271 PluginConnector]: Initializing CDTParser... 66.53/35.80 [2019-03-28 12:46:15,480 INFO L276 PluginConnector]: CDTParser initialized 66.53/35.80 [2019-03-28 12:46:15,480 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 66.53/35.80 [2019-03-28 12:46:15,540 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/f574c2a2af284bd79489316f4339e3fc/FLAGbdace52e9 66.53/35.80 [2019-03-28 12:46:15,891 INFO L307 CDTParser]: Found 1 translation units. 66.53/35.80 [2019-03-28 12:46:15,892 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 66.53/35.80 [2019-03-28 12:46:15,892 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 66.53/35.80 [2019-03-28 12:46:15,899 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/f574c2a2af284bd79489316f4339e3fc/FLAGbdace52e9 66.53/35.80 [2019-03-28 12:46:16,321 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/f574c2a2af284bd79489316f4339e3fc 66.53/35.80 [2019-03-28 12:46:16,332 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 66.53/35.80 [2019-03-28 12:46:16,334 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 66.53/35.80 [2019-03-28 12:46:16,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 66.53/35.80 [2019-03-28 12:46:16,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 66.53/35.80 [2019-03-28 12:46:16,339 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 66.53/35.80 [2019-03-28 12:46:16,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:46:16" (1/1) ... 66.53/35.80 [2019-03-28 12:46:16,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70918626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16, skipping insertion in model container 66.53/35.80 [2019-03-28 12:46:16,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:46:16" (1/1) ... 66.53/35.80 [2019-03-28 12:46:16,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 66.53/35.80 [2019-03-28 12:46:16,372 INFO L176 MainTranslator]: Built tables and reachable declarations 66.53/35.80 [2019-03-28 12:46:16,550 INFO L206 PostProcessor]: Analyzing one entry point: main 66.53/35.80 [2019-03-28 12:46:16,563 INFO L191 MainTranslator]: Completed pre-run 66.53/35.80 [2019-03-28 12:46:16,646 INFO L206 PostProcessor]: Analyzing one entry point: main 66.53/35.80 [2019-03-28 12:46:16,663 INFO L195 MainTranslator]: Completed translation 66.53/35.80 [2019-03-28 12:46:16,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16 WrapperNode 66.53/35.80 [2019-03-28 12:46:16,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 66.53/35.80 [2019-03-28 12:46:16,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 66.53/35.80 [2019-03-28 12:46:16,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 66.53/35.80 [2019-03-28 12:46:16,665 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 66.53/35.80 [2019-03-28 12:46:16,674 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:46:16" (1/1) ... 66.53/35.80 [2019-03-28 12:46:16,685 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:46:16" (1/1) ... 66.53/35.80 [2019-03-28 12:46:16,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 66.53/35.80 [2019-03-28 12:46:16,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 66.53/35.80 [2019-03-28 12:46:16,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 66.53/35.80 [2019-03-28 12:46:16,708 INFO L276 PluginConnector]: Boogie Preprocessor initialized 66.53/35.80 [2019-03-28 12:46:16,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 66.53/35.80 [2019-03-28 12:46:16,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 66.53/35.80 [2019-03-28 12:46:16,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 66.53/35.80 [2019-03-28 12:46:16,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 66.53/35.80 [2019-03-28 12:46:16,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 66.53/35.80 [2019-03-28 12:46:16,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 66.53/35.80 [2019-03-28 12:46:16,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 66.53/35.80 [2019-03-28 12:46:16,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 66.53/35.80 [2019-03-28 12:46:16,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 66.53/35.80 [2019-03-28 12:46:16,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... 66.53/35.80 [2019-03-28 12:46:16,736 INFO L276 PluginConnector]: RCFGBuilder initialized 66.53/35.80 [2019-03-28 12:46:16,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 66.53/35.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.53/35.80 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 66.53/35.80 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 66.53/35.80 [2019-03-28 12:46:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 66.53/35.80 [2019-03-28 12:46:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 66.53/35.80 [2019-03-28 12:46:16,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 66.53/35.80 [2019-03-28 12:46:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 66.53/35.80 [2019-03-28 12:46:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 66.53/35.80 [2019-03-28 12:46:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 66.53/35.80 [2019-03-28 12:46:17,032 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 66.53/35.80 [2019-03-28 12:46:17,033 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 66.53/35.80 [2019-03-28 12:46:17,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:17 BoogieIcfgContainer 66.53/35.80 [2019-03-28 12:46:17,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 66.53/35.80 [2019-03-28 12:46:17,035 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 66.53/35.80 [2019-03-28 12:46:17,035 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 66.53/35.80 [2019-03-28 12:46:17,037 INFO L276 PluginConnector]: BlockEncodingV2 initialized 66.53/35.80 [2019-03-28 12:46:17,038 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:17" (1/1) ... 66.53/35.80 [2019-03-28 12:46:17,055 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 36 edges 66.53/35.80 [2019-03-28 12:46:17,056 INFO L258 BlockEncoder]: Using Remove infeasible edges 66.53/35.80 [2019-03-28 12:46:17,057 INFO L263 BlockEncoder]: Using Maximize final states 66.53/35.80 [2019-03-28 12:46:17,057 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 66.53/35.80 [2019-03-28 12:46:17,058 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 66.53/35.80 [2019-03-28 12:46:17,059 INFO L296 BlockEncoder]: Using Remove sink states 66.53/35.80 [2019-03-28 12:46:17,060 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 66.53/35.80 [2019-03-28 12:46:17,060 INFO L179 BlockEncoder]: Using Rewrite not-equals 66.53/35.80 [2019-03-28 12:46:17,083 INFO L185 BlockEncoder]: Using Use SBE 66.53/35.80 [2019-03-28 12:46:17,112 INFO L200 BlockEncoder]: SBE split 12 edges 66.53/35.80 [2019-03-28 12:46:17,117 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 66.53/35.80 [2019-03-28 12:46:17,119 INFO L71 MaximizeFinalStates]: 0 new accepting states 66.53/35.80 [2019-03-28 12:46:17,160 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 66.53/35.80 [2019-03-28 12:46:17,163 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 66.53/35.80 [2019-03-28 12:46:17,164 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 66.53/35.80 [2019-03-28 12:46:17,165 INFO L71 MaximizeFinalStates]: 0 new accepting states 66.53/35.80 [2019-03-28 12:46:17,165 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 66.53/35.80 [2019-03-28 12:46:17,166 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 66.53/35.80 [2019-03-28 12:46:17,166 INFO L313 BlockEncoder]: Encoded RCFG 21 locations, 38 edges 66.53/35.80 [2019-03-28 12:46:17,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:17 BasicIcfg 66.53/35.80 [2019-03-28 12:46:17,167 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 66.53/35.80 [2019-03-28 12:46:17,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 66.53/35.80 [2019-03-28 12:46:17,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... 66.53/35.80 [2019-03-28 12:46:17,171 INFO L276 PluginConnector]: TraceAbstraction initialized 66.53/35.80 [2019-03-28 12:46:17,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:46:16" (1/4) ... 66.53/35.80 [2019-03-28 12:46:17,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d28150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:46:17, skipping insertion in model container 66.53/35.80 [2019-03-28 12:46:17,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (2/4) ... 66.53/35.80 [2019-03-28 12:46:17,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d28150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:46:17, skipping insertion in model container 66.53/35.80 [2019-03-28 12:46:17,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:17" (3/4) ... 66.53/35.80 [2019-03-28 12:46:17,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d28150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:17, skipping insertion in model container 66.53/35.80 [2019-03-28 12:46:17,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:17" (4/4) ... 66.53/35.80 [2019-03-28 12:46:17,175 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 66.53/35.80 [2019-03-28 12:46:17,185 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 66.53/35.80 [2019-03-28 12:46:17,193 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. 66.53/35.80 [2019-03-28 12:46:17,210 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. 66.53/35.80 [2019-03-28 12:46:17,240 INFO L133 ementStrategyFactory]: Using default assertion order modulation 66.53/35.80 [2019-03-28 12:46:17,240 INFO L382 AbstractCegarLoop]: Interprodecural is true 66.53/35.80 [2019-03-28 12:46:17,241 INFO L383 AbstractCegarLoop]: Hoare is true 66.53/35.80 [2019-03-28 12:46:17,241 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 66.53/35.80 [2019-03-28 12:46:17,241 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 66.53/35.80 [2019-03-28 12:46:17,241 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 66.53/35.80 [2019-03-28 12:46:17,241 INFO L387 AbstractCegarLoop]: Difference is false 66.53/35.80 [2019-03-28 12:46:17,241 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 66.53/35.80 [2019-03-28 12:46:17,242 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 66.53/35.80 [2019-03-28 12:46:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. 66.53/35.80 [2019-03-28 12:46:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 66.53/35.80 [2019-03-28 12:46:17,263 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.80 [2019-03-28 12:46:17,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 66.53/35.80 [2019-03-28 12:46:17,264 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.80 [2019-03-28 12:46:17,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.80 [2019-03-28 12:46:17,269 INFO L82 PathProgramCache]: Analyzing trace with hash 164786450, now seen corresponding path program 1 times 66.53/35.80 [2019-03-28 12:46:17,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.80 [2019-03-28 12:46:17,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.80 [2019-03-28 12:46:17,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:17,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:17,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:17,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:17,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 66.53/35.81 [2019-03-28 12:46:17,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 66.53/35.81 [2019-03-28 12:46:17,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 66.53/35.81 [2019-03-28 12:46:17,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 66.53/35.81 [2019-03-28 12:46:17,478 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. 66.53/35.81 [2019-03-28 12:46:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:17,593 INFO L93 Difference]: Finished difference Result 21 states and 38 transitions. 66.53/35.81 [2019-03-28 12:46:17,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 66.53/35.81 [2019-03-28 12:46:17,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 66.53/35.81 [2019-03-28 12:46:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:17,609 INFO L225 Difference]: With dead ends: 21 66.53/35.81 [2019-03-28 12:46:17,609 INFO L226 Difference]: Without dead ends: 20 66.53/35.81 [2019-03-28 12:46:17,612 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 66.53/35.81 [2019-03-28 12:46:17,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 66.53/35.81 [2019-03-28 12:46:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 66.53/35.81 [2019-03-28 12:46:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 66.53/35.81 [2019-03-28 12:46:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 36 transitions. 66.53/35.81 [2019-03-28 12:46:17,651 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 36 transitions. Word has length 5 66.53/35.81 [2019-03-28 12:46:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:17,653 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 36 transitions. 66.53/35.81 [2019-03-28 12:46:17,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 66.53/35.81 [2019-03-28 12:46:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 36 transitions. 66.53/35.81 [2019-03-28 12:46:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 66.53/35.81 [2019-03-28 12:46:17,653 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:17,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:17,654 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:17,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:17,655 INFO L82 PathProgramCache]: Analyzing trace with hash 164786452, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:17,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:17,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:17,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:17,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:17,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:17,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:17,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 66.53/35.81 [2019-03-28 12:46:17,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 66.53/35.81 [2019-03-28 12:46:17,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 66.53/35.81 [2019-03-28 12:46:17,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 66.53/35.81 [2019-03-28 12:46:17,701 INFO L87 Difference]: Start difference. First operand 20 states and 36 transitions. Second operand 3 states. 66.53/35.81 [2019-03-28 12:46:17,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:17,775 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. 66.53/35.81 [2019-03-28 12:46:17,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 66.53/35.81 [2019-03-28 12:46:17,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 66.53/35.81 [2019-03-28 12:46:17,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:17,776 INFO L225 Difference]: With dead ends: 21 66.53/35.81 [2019-03-28 12:46:17,776 INFO L226 Difference]: Without dead ends: 20 66.53/35.81 [2019-03-28 12:46:17,778 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 66.53/35.81 [2019-03-28 12:46:17,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 66.53/35.81 [2019-03-28 12:46:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 66.53/35.81 [2019-03-28 12:46:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 66.53/35.81 [2019-03-28 12:46:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. 66.53/35.81 [2019-03-28 12:46:17,782 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 35 transitions. Word has length 5 66.53/35.81 [2019-03-28 12:46:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:17,783 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 35 transitions. 66.53/35.81 [2019-03-28 12:46:17,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 66.53/35.81 [2019-03-28 12:46:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 35 transitions. 66.53/35.81 [2019-03-28 12:46:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 66.53/35.81 [2019-03-28 12:46:17,783 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:17,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:17,784 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:17,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:17,784 INFO L82 PathProgramCache]: Analyzing trace with hash 164786453, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:17,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:17,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:17,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:17,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:17,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:17,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:17,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 66.53/35.81 [2019-03-28 12:46:17,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 66.53/35.81 [2019-03-28 12:46:17,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 66.53/35.81 [2019-03-28 12:46:17,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 66.53/35.81 [2019-03-28 12:46:17,820 INFO L87 Difference]: Start difference. First operand 20 states and 35 transitions. Second operand 4 states. 66.53/35.81 [2019-03-28 12:46:17,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:17,878 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. 66.53/35.81 [2019-03-28 12:46:17,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 66.53/35.81 [2019-03-28 12:46:17,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 66.53/35.81 [2019-03-28 12:46:17,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:17,879 INFO L225 Difference]: With dead ends: 20 66.53/35.81 [2019-03-28 12:46:17,879 INFO L226 Difference]: Without dead ends: 19 66.53/35.81 [2019-03-28 12:46:17,880 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 66.53/35.81 [2019-03-28 12:46:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 66.53/35.81 [2019-03-28 12:46:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 66.53/35.81 [2019-03-28 12:46:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 66.53/35.81 [2019-03-28 12:46:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. 66.53/35.81 [2019-03-28 12:46:17,884 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 34 transitions. Word has length 5 66.53/35.81 [2019-03-28 12:46:17,884 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:17,884 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 34 transitions. 66.53/35.81 [2019-03-28 12:46:17,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 66.53/35.81 [2019-03-28 12:46:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 34 transitions. 66.53/35.81 [2019-03-28 12:46:17,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 66.53/35.81 [2019-03-28 12:46:17,885 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:17,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:17,885 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:17,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:17,886 INFO L82 PathProgramCache]: Analyzing trace with hash 813411697, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:17,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:17,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:17,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:17,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:17,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:17,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:17,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 66.53/35.81 [2019-03-28 12:46:17,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 66.53/35.81 [2019-03-28 12:46:17,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 66.53/35.81 [2019-03-28 12:46:17,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 66.53/35.81 [2019-03-28 12:46:17,925 INFO L87 Difference]: Start difference. First operand 19 states and 34 transitions. Second operand 3 states. 66.53/35.81 [2019-03-28 12:46:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:17,986 INFO L93 Difference]: Finished difference Result 20 states and 34 transitions. 66.53/35.81 [2019-03-28 12:46:17,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 66.53/35.81 [2019-03-28 12:46:17,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 66.53/35.81 [2019-03-28 12:46:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:17,988 INFO L225 Difference]: With dead ends: 20 66.53/35.81 [2019-03-28 12:46:17,988 INFO L226 Difference]: Without dead ends: 19 66.53/35.81 [2019-03-28 12:46:17,988 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 66.53/35.81 [2019-03-28 12:46:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 66.53/35.81 [2019-03-28 12:46:17,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 66.53/35.81 [2019-03-28 12:46:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 66.53/35.81 [2019-03-28 12:46:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. 66.53/35.81 [2019-03-28 12:46:17,993 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 33 transitions. Word has length 6 66.53/35.81 [2019-03-28 12:46:17,993 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:17,993 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 33 transitions. 66.53/35.81 [2019-03-28 12:46:17,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 66.53/35.81 [2019-03-28 12:46:17,993 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 33 transitions. 66.53/35.81 [2019-03-28 12:46:17,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 66.53/35.81 [2019-03-28 12:46:17,994 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:17,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:17,994 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:17,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:17,995 INFO L82 PathProgramCache]: Analyzing trace with hash 813411698, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:17,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:17,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:17,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:17,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:17,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:18,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:18,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 66.53/35.81 [2019-03-28 12:46:18,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 66.53/35.81 [2019-03-28 12:46:18,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 66.53/35.81 [2019-03-28 12:46:18,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 66.53/35.81 [2019-03-28 12:46:18,035 INFO L87 Difference]: Start difference. First operand 19 states and 33 transitions. Second operand 4 states. 66.53/35.81 [2019-03-28 12:46:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:18,081 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. 66.53/35.81 [2019-03-28 12:46:18,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 66.53/35.81 [2019-03-28 12:46:18,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 66.53/35.81 [2019-03-28 12:46:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:18,082 INFO L225 Difference]: With dead ends: 19 66.53/35.81 [2019-03-28 12:46:18,083 INFO L226 Difference]: Without dead ends: 18 66.53/35.81 [2019-03-28 12:46:18,083 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 66.53/35.81 [2019-03-28 12:46:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 66.53/35.81 [2019-03-28 12:46:18,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 66.53/35.81 [2019-03-28 12:46:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 66.53/35.81 [2019-03-28 12:46:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. 66.53/35.81 [2019-03-28 12:46:18,087 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 32 transitions. Word has length 6 66.53/35.81 [2019-03-28 12:46:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:18,087 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 32 transitions. 66.53/35.81 [2019-03-28 12:46:18,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 66.53/35.81 [2019-03-28 12:46:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 32 transitions. 66.53/35.81 [2019-03-28 12:46:18,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 66.53/35.81 [2019-03-28 12:46:18,088 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:18,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:18,088 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:18,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:18,089 INFO L82 PathProgramCache]: Analyzing trace with hash 813411695, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:18,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:18,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:18,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:18,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:18,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 66.53/35.81 [2019-03-28 12:46:18,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 66.53/35.81 [2019-03-28 12:46:18,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 66.53/35.81 [2019-03-28 12:46:18,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 66.53/35.81 [2019-03-28 12:46:18,116 INFO L87 Difference]: Start difference. First operand 18 states and 32 transitions. Second operand 3 states. 66.53/35.81 [2019-03-28 12:46:18,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:18,157 INFO L93 Difference]: Finished difference Result 18 states and 32 transitions. 66.53/35.81 [2019-03-28 12:46:18,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 66.53/35.81 [2019-03-28 12:46:18,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 66.53/35.81 [2019-03-28 12:46:18,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:18,159 INFO L225 Difference]: With dead ends: 18 66.53/35.81 [2019-03-28 12:46:18,159 INFO L226 Difference]: Without dead ends: 17 66.53/35.81 [2019-03-28 12:46:18,159 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 66.53/35.81 [2019-03-28 12:46:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 66.53/35.81 [2019-03-28 12:46:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 66.53/35.81 [2019-03-28 12:46:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 66.53/35.81 [2019-03-28 12:46:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. 66.53/35.81 [2019-03-28 12:46:18,163 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 6 66.53/35.81 [2019-03-28 12:46:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:18,163 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. 66.53/35.81 [2019-03-28 12:46:18,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 66.53/35.81 [2019-03-28 12:46:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. 66.53/35.81 [2019-03-28 12:46:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 66.53/35.81 [2019-03-28 12:46:18,164 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:18,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:18,165 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:18,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:18,165 INFO L82 PathProgramCache]: Analyzing trace with hash 4612450, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:18,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:18,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:18,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:18,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:18,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:18,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 66.53/35.81 [2019-03-28 12:46:18,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 66.53/35.81 [2019-03-28 12:46:18,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 66.53/35.81 [2019-03-28 12:46:18,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 66.53/35.81 [2019-03-28 12:46:18,219 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 5 states. 66.53/35.81 [2019-03-28 12:46:18,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:18,325 INFO L93 Difference]: Finished difference Result 17 states and 30 transitions. 66.53/35.81 [2019-03-28 12:46:18,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 66.53/35.81 [2019-03-28 12:46:18,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 66.53/35.81 [2019-03-28 12:46:18,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:18,326 INFO L225 Difference]: With dead ends: 17 66.53/35.81 [2019-03-28 12:46:18,327 INFO L226 Difference]: Without dead ends: 16 66.53/35.81 [2019-03-28 12:46:18,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 66.53/35.81 [2019-03-28 12:46:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 66.53/35.81 [2019-03-28 12:46:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 66.53/35.81 [2019-03-28 12:46:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 66.53/35.81 [2019-03-28 12:46:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. 66.53/35.81 [2019-03-28 12:46:18,331 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 28 transitions. Word has length 8 66.53/35.81 [2019-03-28 12:46:18,332 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:18,332 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 28 transitions. 66.53/35.81 [2019-03-28 12:46:18,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 66.53/35.81 [2019-03-28 12:46:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 28 transitions. 66.53/35.81 [2019-03-28 12:46:18,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 66.53/35.81 [2019-03-28 12:46:18,332 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:18,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:18,333 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:18,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:18,333 INFO L82 PathProgramCache]: Analyzing trace with hash 4612452, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:18,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:18,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:18,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:18,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:18,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 66.53/35.81 [2019-03-28 12:46:18,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 66.53/35.81 [2019-03-28 12:46:18,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 66.53/35.81 [2019-03-28 12:46:18,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 66.53/35.81 [2019-03-28 12:46:18,383 INFO L87 Difference]: Start difference. First operand 16 states and 28 transitions. Second operand 5 states. 66.53/35.81 [2019-03-28 12:46:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:18,480 INFO L93 Difference]: Finished difference Result 21 states and 34 transitions. 66.53/35.81 [2019-03-28 12:46:18,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 66.53/35.81 [2019-03-28 12:46:18,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 66.53/35.81 [2019-03-28 12:46:18,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:18,481 INFO L225 Difference]: With dead ends: 21 66.53/35.81 [2019-03-28 12:46:18,482 INFO L226 Difference]: Without dead ends: 20 66.53/35.81 [2019-03-28 12:46:18,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 66.53/35.81 [2019-03-28 12:46:18,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 66.53/35.81 [2019-03-28 12:46:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. 66.53/35.81 [2019-03-28 12:46:18,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 66.53/35.81 [2019-03-28 12:46:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. 66.53/35.81 [2019-03-28 12:46:18,487 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 31 transitions. Word has length 8 66.53/35.81 [2019-03-28 12:46:18,487 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:18,487 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 31 transitions. 66.53/35.81 [2019-03-28 12:46:18,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 66.53/35.81 [2019-03-28 12:46:18,487 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 31 transitions. 66.53/35.81 [2019-03-28 12:46:18,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 66.53/35.81 [2019-03-28 12:46:18,488 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:18,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:18,488 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:18,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:18,489 INFO L82 PathProgramCache]: Analyzing trace with hash 4612453, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:18,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:18,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:18,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:18,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 66.53/35.81 [2019-03-28 12:46:18,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 66.53/35.81 [2019-03-28 12:46:18,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 66.53/35.81 [2019-03-28 12:46:18,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 66.53/35.81 [2019-03-28 12:46:18,579 INFO L87 Difference]: Start difference. First operand 18 states and 31 transitions. Second operand 7 states. 66.53/35.81 [2019-03-28 12:46:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:18,690 INFO L93 Difference]: Finished difference Result 20 states and 33 transitions. 66.53/35.81 [2019-03-28 12:46:18,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 66.53/35.81 [2019-03-28 12:46:18,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 66.53/35.81 [2019-03-28 12:46:18,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:18,691 INFO L225 Difference]: With dead ends: 20 66.53/35.81 [2019-03-28 12:46:18,691 INFO L226 Difference]: Without dead ends: 19 66.53/35.81 [2019-03-28 12:46:18,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 66.53/35.81 [2019-03-28 12:46:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 66.53/35.81 [2019-03-28 12:46:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. 66.53/35.81 [2019-03-28 12:46:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 66.53/35.81 [2019-03-28 12:46:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. 66.53/35.81 [2019-03-28 12:46:18,696 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 30 transitions. Word has length 8 66.53/35.81 [2019-03-28 12:46:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:18,696 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 30 transitions. 66.53/35.81 [2019-03-28 12:46:18,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 66.53/35.81 [2019-03-28 12:46:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 30 transitions. 66.53/35.81 [2019-03-28 12:46:18,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 66.53/35.81 [2019-03-28 12:46:18,697 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:18,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:18,697 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:18,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:18,698 INFO L82 PathProgramCache]: Analyzing trace with hash -28846887, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:18,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:18,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:18,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:18,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:18,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 66.53/35.81 [2019-03-28 12:46:18,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 66.53/35.81 [2019-03-28 12:46:18,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 66.53/35.81 [2019-03-28 12:46:18,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 66.53/35.81 [2019-03-28 12:46:18,741 INFO L87 Difference]: Start difference. First operand 18 states and 30 transitions. Second operand 5 states. 66.53/35.81 [2019-03-28 12:46:18,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:18,825 INFO L93 Difference]: Finished difference Result 19 states and 32 transitions. 66.53/35.81 [2019-03-28 12:46:18,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 66.53/35.81 [2019-03-28 12:46:18,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 66.53/35.81 [2019-03-28 12:46:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:18,826 INFO L225 Difference]: With dead ends: 19 66.53/35.81 [2019-03-28 12:46:18,826 INFO L226 Difference]: Without dead ends: 18 66.53/35.81 [2019-03-28 12:46:18,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 66.53/35.81 [2019-03-28 12:46:18,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 66.53/35.81 [2019-03-28 12:46:18,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. 66.53/35.81 [2019-03-28 12:46:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 66.53/35.81 [2019-03-28 12:46:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. 66.53/35.81 [2019-03-28 12:46:18,830 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 11 66.53/35.81 [2019-03-28 12:46:18,830 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:18,830 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 28 transitions. 66.53/35.81 [2019-03-28 12:46:18,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 66.53/35.81 [2019-03-28 12:46:18,830 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 28 transitions. 66.53/35.81 [2019-03-28 12:46:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 66.53/35.81 [2019-03-28 12:46:18,831 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:18,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:18,832 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:18,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash -28846885, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:18,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:18,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:18,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:18,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 66.53/35.81 [2019-03-28 12:46:18,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 66.53/35.81 [2019-03-28 12:46:18,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 66.53/35.81 [2019-03-28 12:46:18,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 66.53/35.81 [2019-03-28 12:46:18,882 INFO L87 Difference]: Start difference. First operand 17 states and 28 transitions. Second operand 6 states. 66.53/35.81 [2019-03-28 12:46:18,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:18,970 INFO L93 Difference]: Finished difference Result 22 states and 35 transitions. 66.53/35.81 [2019-03-28 12:46:18,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 66.53/35.81 [2019-03-28 12:46:18,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 66.53/35.81 [2019-03-28 12:46:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:18,971 INFO L225 Difference]: With dead ends: 22 66.53/35.81 [2019-03-28 12:46:18,971 INFO L226 Difference]: Without dead ends: 21 66.53/35.81 [2019-03-28 12:46:18,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 66.53/35.81 [2019-03-28 12:46:18,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 66.53/35.81 [2019-03-28 12:46:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. 66.53/35.81 [2019-03-28 12:46:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 66.53/35.81 [2019-03-28 12:46:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. 66.53/35.81 [2019-03-28 12:46:18,977 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 11 66.53/35.81 [2019-03-28 12:46:18,977 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:18,977 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 31 transitions. 66.53/35.81 [2019-03-28 12:46:18,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 66.53/35.81 [2019-03-28 12:46:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. 66.53/35.81 [2019-03-28 12:46:18,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 66.53/35.81 [2019-03-28 12:46:18,978 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:18,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:18,978 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:18,978 INFO L82 PathProgramCache]: Analyzing trace with hash -28846884, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:18,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:18,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:19,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:19,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 66.53/35.81 [2019-03-28 12:46:19,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 66.53/35.81 [2019-03-28 12:46:19,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 66.53/35.81 [2019-03-28 12:46:19,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 66.53/35.81 [2019-03-28 12:46:19,047 INFO L87 Difference]: Start difference. First operand 19 states and 31 transitions. Second operand 7 states. 66.53/35.81 [2019-03-28 12:46:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:19,177 INFO L93 Difference]: Finished difference Result 21 states and 34 transitions. 66.53/35.81 [2019-03-28 12:46:19,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 66.53/35.81 [2019-03-28 12:46:19,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 66.53/35.81 [2019-03-28 12:46:19,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:19,178 INFO L225 Difference]: With dead ends: 21 66.53/35.81 [2019-03-28 12:46:19,178 INFO L226 Difference]: Without dead ends: 20 66.53/35.81 [2019-03-28 12:46:19,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 66.53/35.81 [2019-03-28 12:46:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 66.53/35.81 [2019-03-28 12:46:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. 66.53/35.81 [2019-03-28 12:46:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 66.53/35.81 [2019-03-28 12:46:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. 66.53/35.81 [2019-03-28 12:46:19,182 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 30 transitions. Word has length 11 66.53/35.81 [2019-03-28 12:46:19,183 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:19,183 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 30 transitions. 66.53/35.81 [2019-03-28 12:46:19,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 66.53/35.81 [2019-03-28 12:46:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. 66.53/35.81 [2019-03-28 12:46:19,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 66.53/35.81 [2019-03-28 12:46:19,184 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:19,184 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:19,184 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:19,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:19,184 INFO L82 PathProgramCache]: Analyzing trace with hash -383674474, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:19,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:19,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:19,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:19,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:19,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:19,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 66.53/35.81 [2019-03-28 12:46:19,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 66.53/35.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.53/35.81 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 66.53/35.81 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 66.53/35.81 [2019-03-28 12:46:19,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:19,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core 66.53/35.81 [2019-03-28 12:46:19,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.53/35.81 [2019-03-28 12:46:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:19,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:19,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 66.53/35.81 [2019-03-28 12:46:19,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 66.53/35.81 [2019-03-28 12:46:19,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 66.53/35.81 [2019-03-28 12:46:19,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 66.53/35.81 [2019-03-28 12:46:19,355 INFO L87 Difference]: Start difference. First operand 19 states and 30 transitions. Second operand 8 states. 66.53/35.81 [2019-03-28 12:46:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:19,474 INFO L93 Difference]: Finished difference Result 21 states and 32 transitions. 66.53/35.81 [2019-03-28 12:46:19,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 66.53/35.81 [2019-03-28 12:46:19,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 66.53/35.81 [2019-03-28 12:46:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:19,475 INFO L225 Difference]: With dead ends: 21 66.53/35.81 [2019-03-28 12:46:19,476 INFO L226 Difference]: Without dead ends: 20 66.53/35.81 [2019-03-28 12:46:19,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 66.53/35.81 [2019-03-28 12:46:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 66.53/35.81 [2019-03-28 12:46:19,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. 66.53/35.81 [2019-03-28 12:46:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 66.53/35.81 [2019-03-28 12:46:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. 66.53/35.81 [2019-03-28 12:46:19,480 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 14 66.53/35.81 [2019-03-28 12:46:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:19,480 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 29 transitions. 66.53/35.81 [2019-03-28 12:46:19,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 66.53/35.81 [2019-03-28 12:46:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. 66.53/35.81 [2019-03-28 12:46:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 66.53/35.81 [2019-03-28 12:46:19,481 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:19,481 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:19,481 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash -383674473, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:19,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:19,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:19,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:19,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:19,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:19,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 66.53/35.81 [2019-03-28 12:46:19,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 66.53/35.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.53/35.81 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 66.53/35.81 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 66.53/35.81 [2019-03-28 12:46:19,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:19,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 28 conjunts are in the unsatisfiable core 66.53/35.81 [2019-03-28 12:46:19,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.53/35.81 [2019-03-28 12:46:19,774 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 66.53/35.81 [2019-03-28 12:46:19,774 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:19,786 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:19,787 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. 66.53/35.81 [2019-03-28 12:46:19,787 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 66.53/35.81 [2019-03-28 12:46:19,842 INFO L189 IndexEqualityManager]: detected not equals via solver 66.53/35.81 [2019-03-28 12:46:19,845 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 66.53/35.81 [2019-03-28 12:46:19,846 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:19,860 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:19,862 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:19,862 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:40 66.53/35.81 [2019-03-28 12:46:19,958 INFO L189 IndexEqualityManager]: detected not equals via solver 66.53/35.81 [2019-03-28 12:46:19,966 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:19,967 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 66.53/35.81 [2019-03-28 12:46:19,971 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 66.53/35.81 [2019-03-28 12:46:19,992 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:19,999 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:19,999 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:52, output treesize:27 66.53/35.81 [2019-03-28 12:46:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:20,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:20,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 66.53/35.81 [2019-03-28 12:46:20,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 66.53/35.81 [2019-03-28 12:46:20,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 66.53/35.81 [2019-03-28 12:46:20,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 66.53/35.81 [2019-03-28 12:46:20,121 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. Second operand 17 states. 66.53/35.81 [2019-03-28 12:46:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:21,257 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. 66.53/35.81 [2019-03-28 12:46:21,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 66.53/35.81 [2019-03-28 12:46:21,257 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 66.53/35.81 [2019-03-28 12:46:21,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:21,258 INFO L225 Difference]: With dead ends: 56 66.53/35.81 [2019-03-28 12:46:21,258 INFO L226 Difference]: Without dead ends: 55 66.53/35.81 [2019-03-28 12:46:21,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 66.53/35.81 [2019-03-28 12:46:21,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. 66.53/35.81 [2019-03-28 12:46:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. 66.53/35.81 [2019-03-28 12:46:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 66.53/35.81 [2019-03-28 12:46:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 44 transitions. 66.53/35.81 [2019-03-28 12:46:21,268 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 44 transitions. Word has length 14 66.53/35.81 [2019-03-28 12:46:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:21,268 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 44 transitions. 66.53/35.81 [2019-03-28 12:46:21,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 66.53/35.81 [2019-03-28 12:46:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 44 transitions. 66.53/35.81 [2019-03-28 12:46:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 66.53/35.81 [2019-03-28 12:46:21,269 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:21,269 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:21,269 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:21,270 INFO L82 PathProgramCache]: Analyzing trace with hash 992524143, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:21,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:21,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:21,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:21,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:21,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:21,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 66.53/35.81 [2019-03-28 12:46:21,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 66.53/35.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.53/35.81 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 66.53/35.81 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 66.53/35.81 [2019-03-28 12:46:21,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:21,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core 66.53/35.81 [2019-03-28 12:46:21,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.53/35.81 [2019-03-28 12:46:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:21,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:21,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 66.53/35.81 [2019-03-28 12:46:21,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 66.53/35.81 [2019-03-28 12:46:21,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 66.53/35.81 [2019-03-28 12:46:21,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 66.53/35.81 [2019-03-28 12:46:21,419 INFO L87 Difference]: Start difference. First operand 28 states and 44 transitions. Second operand 9 states. 66.53/35.81 [2019-03-28 12:46:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:21,589 INFO L93 Difference]: Finished difference Result 31 states and 50 transitions. 66.53/35.81 [2019-03-28 12:46:21,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 66.53/35.81 [2019-03-28 12:46:21,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 66.53/35.81 [2019-03-28 12:46:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:21,591 INFO L225 Difference]: With dead ends: 31 66.53/35.81 [2019-03-28 12:46:21,591 INFO L226 Difference]: Without dead ends: 30 66.53/35.81 [2019-03-28 12:46:21,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 66.53/35.81 [2019-03-28 12:46:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 66.53/35.81 [2019-03-28 12:46:21,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. 66.53/35.81 [2019-03-28 12:46:21,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 66.53/35.81 [2019-03-28 12:46:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. 66.53/35.81 [2019-03-28 12:46:21,598 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 15 66.53/35.81 [2019-03-28 12:46:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:21,599 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 42 transitions. 66.53/35.81 [2019-03-28 12:46:21,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 66.53/35.81 [2019-03-28 12:46:21,599 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. 66.53/35.81 [2019-03-28 12:46:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 66.53/35.81 [2019-03-28 12:46:21,600 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:21,600 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:21,600 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:21,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:21,600 INFO L82 PathProgramCache]: Analyzing trace with hash 992524144, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:21,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:21,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:21,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:21,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:21,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:21,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:21,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 66.53/35.81 [2019-03-28 12:46:21,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 66.53/35.81 [2019-03-28 12:46:21,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 66.53/35.81 [2019-03-28 12:46:21,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 66.53/35.81 [2019-03-28 12:46:21,708 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 8 states. 66.53/35.81 [2019-03-28 12:46:21,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:21,899 INFO L93 Difference]: Finished difference Result 63 states and 94 transitions. 66.53/35.81 [2019-03-28 12:46:21,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 66.53/35.81 [2019-03-28 12:46:21,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 66.53/35.81 [2019-03-28 12:46:21,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:21,900 INFO L225 Difference]: With dead ends: 63 66.53/35.81 [2019-03-28 12:46:21,900 INFO L226 Difference]: Without dead ends: 46 66.53/35.81 [2019-03-28 12:46:21,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 66.53/35.81 [2019-03-28 12:46:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. 66.53/35.81 [2019-03-28 12:46:21,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. 66.53/35.81 [2019-03-28 12:46:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 66.53/35.81 [2019-03-28 12:46:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. 66.53/35.81 [2019-03-28 12:46:21,911 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 15 66.53/35.81 [2019-03-28 12:46:21,911 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:21,911 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. 66.53/35.81 [2019-03-28 12:46:21,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 66.53/35.81 [2019-03-28 12:46:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. 66.53/35.81 [2019-03-28 12:46:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 66.53/35.81 [2019-03-28 12:46:21,912 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:21,912 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:21,912 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:21,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:21,913 INFO L82 PathProgramCache]: Analyzing trace with hash -393243502, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:21,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:21,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:21,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:21,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:21,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:22,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 66.53/35.81 [2019-03-28 12:46:22,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 66.53/35.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.53/35.81 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 66.53/35.81 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 66.53/35.81 [2019-03-28 12:46:22,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:22,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 27 conjunts are in the unsatisfiable core 66.53/35.81 [2019-03-28 12:46:22,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.53/35.81 [2019-03-28 12:46:22,127 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 66.53/35.81 [2019-03-28 12:46:22,127 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:22,137 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:22,138 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:22,139 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 66.53/35.81 [2019-03-28 12:46:22,251 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:22,252 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 66.53/35.81 [2019-03-28 12:46:22,254 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 66.53/35.81 [2019-03-28 12:46:22,269 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:22,273 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 66.53/35.81 [2019-03-28 12:46:22,273 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 66.53/35.81 [2019-03-28 12:46:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:22,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:22,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 66.53/35.81 [2019-03-28 12:46:22,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 66.53/35.81 [2019-03-28 12:46:22,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 66.53/35.81 [2019-03-28 12:46:22,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 66.53/35.81 [2019-03-28 12:46:22,339 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 15 states. 66.53/35.81 [2019-03-28 12:46:22,799 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 66.53/35.81 [2019-03-28 12:46:23,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:23,198 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. 66.53/35.81 [2019-03-28 12:46:23,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 66.53/35.81 [2019-03-28 12:46:23,199 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 66.53/35.81 [2019-03-28 12:46:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:23,200 INFO L225 Difference]: With dead ends: 60 66.53/35.81 [2019-03-28 12:46:23,200 INFO L226 Difference]: Without dead ends: 59 66.53/35.81 [2019-03-28 12:46:23,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 66.53/35.81 [2019-03-28 12:46:23,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. 66.53/35.81 [2019-03-28 12:46:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. 66.53/35.81 [2019-03-28 12:46:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. 66.53/35.81 [2019-03-28 12:46:23,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. 66.53/35.81 [2019-03-28 12:46:23,213 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 15 66.53/35.81 [2019-03-28 12:46:23,213 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:23,213 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 79 transitions. 66.53/35.81 [2019-03-28 12:46:23,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 66.53/35.81 [2019-03-28 12:46:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 79 transitions. 66.53/35.81 [2019-03-28 12:46:23,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 66.53/35.81 [2019-03-28 12:46:23,214 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:23,214 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:23,215 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:23,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:23,215 INFO L82 PathProgramCache]: Analyzing trace with hash 930982950, now seen corresponding path program 2 times 66.53/35.81 [2019-03-28 12:46:23,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:23,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:23,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:23,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:23,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:23,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:23,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 66.53/35.81 [2019-03-28 12:46:23,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 66.53/35.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.53/35.81 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 66.53/35.81 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 66.53/35.81 [2019-03-28 12:46:23,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 66.53/35.81 [2019-03-28 12:46:23,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 66.53/35.81 [2019-03-28 12:46:23,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:23,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 30 conjunts are in the unsatisfiable core 66.53/35.81 [2019-03-28 12:46:23,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.53/35.81 [2019-03-28 12:46:23,556 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:23,556 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 1 case distinctions, treesize of input 9 treesize of output 25 66.53/35.81 [2019-03-28 12:46:23,557 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:23,573 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size 66.53/35.81 [2019-03-28 12:46:23,574 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:23,574 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 66.53/35.81 [2019-03-28 12:46:23,595 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 66.53/35.81 [2019-03-28 12:46:23,596 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:23,602 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:23,602 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. 66.53/35.81 [2019-03-28 12:46:23,603 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 66.53/35.81 [2019-03-28 12:46:23,710 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:23,711 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 66.53/35.81 [2019-03-28 12:46:23,712 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 66.53/35.81 [2019-03-28 12:46:23,724 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:23,727 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 66.53/35.81 [2019-03-28 12:46:23,727 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:23 66.53/35.81 [2019-03-28 12:46:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:23,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:23,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 66.53/35.81 [2019-03-28 12:46:23,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 66.53/35.81 [2019-03-28 12:46:23,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 66.53/35.81 [2019-03-28 12:46:23,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 66.53/35.81 [2019-03-28 12:46:23,797 INFO L87 Difference]: Start difference. First operand 53 states and 79 transitions. Second operand 17 states. 66.53/35.81 [2019-03-28 12:46:24,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:24,944 INFO L93 Difference]: Finished difference Result 61 states and 92 transitions. 66.53/35.81 [2019-03-28 12:46:24,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 66.53/35.81 [2019-03-28 12:46:24,944 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 66.53/35.81 [2019-03-28 12:46:24,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:24,945 INFO L225 Difference]: With dead ends: 61 66.53/35.81 [2019-03-28 12:46:24,945 INFO L226 Difference]: Without dead ends: 60 66.53/35.81 [2019-03-28 12:46:24,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 66.53/35.81 [2019-03-28 12:46:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. 66.53/35.81 [2019-03-28 12:46:24,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. 66.53/35.81 [2019-03-28 12:46:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 66.53/35.81 [2019-03-28 12:46:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. 66.53/35.81 [2019-03-28 12:46:24,956 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 19 66.53/35.81 [2019-03-28 12:46:24,956 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:24,956 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. 66.53/35.81 [2019-03-28 12:46:24,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 66.53/35.81 [2019-03-28 12:46:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. 66.53/35.81 [2019-03-28 12:46:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 66.53/35.81 [2019-03-28 12:46:24,957 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:24,957 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:24,957 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:24,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:24,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1731453001, now seen corresponding path program 2 times 66.53/35.81 [2019-03-28 12:46:24,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:24,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:24,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:24,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:24,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:25,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 66.53/35.81 [2019-03-28 12:46:25,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 66.53/35.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.53/35.81 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 66.53/35.81 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 66.53/35.81 [2019-03-28 12:46:25,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 66.53/35.81 [2019-03-28 12:46:25,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 66.53/35.81 [2019-03-28 12:46:25,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:25,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 33 conjunts are in the unsatisfiable core 66.53/35.81 [2019-03-28 12:46:25,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.53/35.81 [2019-03-28 12:46:25,228 INFO L189 IndexEqualityManager]: detected not equals via solver 66.53/35.81 [2019-03-28 12:46:25,229 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 66.53/35.81 [2019-03-28 12:46:25,229 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:25,238 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:25,238 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:25,238 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 66.53/35.81 [2019-03-28 12:46:25,265 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 66.53/35.81 [2019-03-28 12:46:25,266 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:25,275 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:25,276 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. 66.53/35.81 [2019-03-28 12:46:25,276 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 66.53/35.81 [2019-03-28 12:46:25,311 INFO L189 IndexEqualityManager]: detected not equals via solver 66.53/35.81 [2019-03-28 12:46:25,312 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 66.53/35.81 [2019-03-28 12:46:25,313 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:25,323 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:25,324 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:25,324 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 66.53/35.81 [2019-03-28 12:46:25,426 INFO L189 IndexEqualityManager]: detected not equals via solver 66.53/35.81 [2019-03-28 12:46:25,433 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:25,433 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 66.53/35.81 [2019-03-28 12:46:25,434 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 66.53/35.81 [2019-03-28 12:46:25,449 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:25,452 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:25,452 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:27 66.53/35.81 [2019-03-28 12:46:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:25,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:25,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 66.53/35.81 [2019-03-28 12:46:25,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states 66.53/35.81 [2019-03-28 12:46:25,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. 66.53/35.81 [2019-03-28 12:46:25,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 66.53/35.81 [2019-03-28 12:46:25,585 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 18 states. 66.53/35.81 [2019-03-28 12:46:26,377 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 57 66.53/35.81 [2019-03-28 12:46:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:30,788 INFO L93 Difference]: Finished difference Result 90 states and 129 transitions. 66.53/35.81 [2019-03-28 12:46:30,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 66.53/35.81 [2019-03-28 12:46:30,789 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 66.53/35.81 [2019-03-28 12:46:30,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:30,789 INFO L225 Difference]: With dead ends: 90 66.53/35.81 [2019-03-28 12:46:30,789 INFO L226 Difference]: Without dead ends: 53 66.53/35.81 [2019-03-28 12:46:30,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=270, Invalid=1136, Unknown=0, NotChecked=0, Total=1406 66.53/35.81 [2019-03-28 12:46:30,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. 66.53/35.81 [2019-03-28 12:46:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. 66.53/35.81 [2019-03-28 12:46:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. 66.53/35.81 [2019-03-28 12:46:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. 66.53/35.81 [2019-03-28 12:46:30,802 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 20 66.53/35.81 [2019-03-28 12:46:30,802 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:30,802 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. 66.53/35.81 [2019-03-28 12:46:30,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. 66.53/35.81 [2019-03-28 12:46:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. 66.53/35.81 [2019-03-28 12:46:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 66.53/35.81 [2019-03-28 12:46:30,803 INFO L394 BasicCegarLoop]: Found error trace 66.53/35.81 [2019-03-28 12:46:30,804 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:30,804 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 66.53/35.81 [2019-03-28 12:46:30,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:30,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1656157372, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:30,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:30,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:30,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:30,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:30,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:30,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 66.53/35.81 [2019-03-28 12:46:30,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 66.53/35.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.53/35.81 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 66.53/35.81 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 66.53/35.81 [2019-03-28 12:46:30,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:31,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 37 conjunts are in the unsatisfiable core 66.53/35.81 [2019-03-28 12:46:31,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.53/35.81 [2019-03-28 12:46:31,018 INFO L189 IndexEqualityManager]: detected not equals via solver 66.53/35.81 [2019-03-28 12:46:31,020 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 66.53/35.81 [2019-03-28 12:46:31,020 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:31,031 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:31,032 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:31,032 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 66.53/35.81 [2019-03-28 12:46:31,059 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 66.53/35.81 [2019-03-28 12:46:31,059 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:31,068 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:31,069 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. 66.53/35.81 [2019-03-28 12:46:31,069 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 66.53/35.81 [2019-03-28 12:46:31,099 INFO L189 IndexEqualityManager]: detected not equals via solver 66.53/35.81 [2019-03-28 12:46:31,100 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 66.53/35.81 [2019-03-28 12:46:31,101 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:31,111 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:31,112 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:31,112 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 66.53/35.81 [2019-03-28 12:46:31,196 INFO L189 IndexEqualityManager]: detected not equals via solver 66.53/35.81 [2019-03-28 12:46:31,202 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:31,202 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 66.53/35.81 [2019-03-28 12:46:31,203 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 66.53/35.81 [2019-03-28 12:46:31,216 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.53/35.81 [2019-03-28 12:46:31,218 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 66.53/35.81 [2019-03-28 12:46:31,218 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:27 66.53/35.81 [2019-03-28 12:46:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:31,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:31,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 66.53/35.81 [2019-03-28 12:46:31,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 66.53/35.81 [2019-03-28 12:46:31,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 66.53/35.81 [2019-03-28 12:46:31,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 66.53/35.81 [2019-03-28 12:46:31,330 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand 17 states. 66.53/35.81 [2019-03-28 12:46:37,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:37,373 INFO L93 Difference]: Finished difference Result 137 states and 191 transitions. 66.53/35.81 [2019-03-28 12:46:37,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 66.53/35.81 [2019-03-28 12:46:37,374 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 66.53/35.81 [2019-03-28 12:46:37,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.53/35.81 [2019-03-28 12:46:37,375 INFO L225 Difference]: With dead ends: 137 66.53/35.81 [2019-03-28 12:46:37,375 INFO L226 Difference]: Without dead ends: 0 66.53/35.81 [2019-03-28 12:46:37,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 66.53/35.81 [2019-03-28 12:46:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 66.53/35.81 [2019-03-28 12:46:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 66.53/35.81 [2019-03-28 12:46:37,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 66.53/35.81 [2019-03-28 12:46:37,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 66.53/35.81 [2019-03-28 12:46:37,377 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 66.53/35.81 [2019-03-28 12:46:37,377 INFO L84 Accepts]: Finished accepts. word is rejected. 66.53/35.81 [2019-03-28 12:46:37,377 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 66.53/35.81 [2019-03-28 12:46:37,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 66.53/35.81 [2019-03-28 12:46:37,377 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 66.53/35.81 [2019-03-28 12:46:37,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 66.53/35.81 [2019-03-28 12:46:37,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 66.53/35.81 [2019-03-28 12:46:37,624 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 226 66.53/35.81 [2019-03-28 12:46:37,803 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 211 66.53/35.81 [2019-03-28 12:46:39,382 WARN L188 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 224 DAG size of output: 84 66.53/35.81 [2019-03-28 12:46:40,851 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 211 DAG size of output: 103 66.53/35.81 [2019-03-28 12:46:40,854 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,854 INFO L448 ceAbstractionStarter]: For program point L29-2(lines 26 41) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,854 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,855 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 38) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,855 INFO L448 ceAbstractionStarter]: For program point L19-3(lines 19 21) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,855 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,855 INFO L444 ceAbstractionStarter]: At program point L19-5(lines 19 21) the Hoare annotation is: (let ((.cse25 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse6 (<= 1 ULTIMATE.start_cstrpbrk_~s1.offset)) (.cse5 (= ULTIMATE.start_cstrpbrk_~s2.offset 0)) (.cse7 (= ULTIMATE.start_main_~length1~0 .cse25)) (.cse21 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse18 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse8 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse9 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~scanp~0.base))) (.cse10 (<= 1 (select |#length| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse11 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse12 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse13 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse17 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse14 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse15 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~s1.base))) (.cse16 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse24 (select |#length| ULTIMATE.start_cstrpbrk_~s1.base)) (.cse26 (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse0 (= 0 (select .cse26 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse25 (- 1))))) (.cse22 (<= (+ ULTIMATE.start_cstrpbrk_~s1.offset 1) .cse24)) (.cse3 (and .cse6 .cse5 .cse7 (or (<= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse25)) (and .cse21 (= 0 (select .cse26 ULTIMATE.start_main_~nondetString1~0.offset)))) .cse18 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 .cse16)) (.cse1 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrpbrk_~s2.base) (- 1))) 0)))) (.cse2 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~scanp~0.base) (+ (select |#length| ULTIMATE.start_cstrpbrk_~scanp~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset)))) (.cse19 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~scanp~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) (select |#length| ULTIMATE.start_cstrpbrk_~scanp~0.base)) (<= ULTIMATE.start_cstrpbrk_~scanp~0.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= 1 ULTIMATE.start_main_~length2~0)))) (.cse20 (= ULTIMATE.start_cstrpbrk_~scanp~0.offset 0)) (.cse23 (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s1.base) (+ .cse24 (- 1))) 0))) (or (and .cse0 (let ((.cse4 (= 0 ULTIMATE.start_cstrpbrk_~sc~0))) (or (and (<= (+ ULTIMATE.start_cstrpbrk_~scanp~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~scanp~0.base)) (<= 1 ULTIMATE.start_cstrpbrk_~scanp~0.offset) .cse1 .cse2 .cse3 (not .cse4)) (and .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse4 .cse17 .cse1 .cse2 .cse18 .cse19 .cse20))) .cse21 .cse22 .cse23) (and .cse0 .cse21 .cse22 (<= ULTIMATE.start_cstrpbrk_~s1.offset 1) (and .cse3 .cse1 .cse2 .cse19 .cse20) .cse23))))) 66.53/35.81 [2019-03-28 12:46:40,856 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 18 22) the Hoare annotation is: (let ((.cse17 (select |#length| ULTIMATE.start_cstrpbrk_~s1.base)) (.cse18 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse0 (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset .cse18 (- 1))))) (.cse9 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse14 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse10 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse1 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrpbrk_~s2.base) (- 1))) 0)))) (.cse2 (= ULTIMATE.start_cstrpbrk_~s2.offset 0)) (.cse3 (= ULTIMATE.start_main_~length1~0 .cse18)) (.cse4 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse5 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse6 (<= 1 (select |#length| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse7 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse8 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse11 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse12 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~s1.base))) (.cse15 (<= (+ ULTIMATE.start_cstrpbrk_~s1.offset 1) .cse17)) (.cse13 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse16 (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s1.base) (+ .cse17 (- 1))) 0))) (or (and .cse0 (and .cse1 (and (= 0 ULTIMATE.start_cstrpbrk_~sc~0) (<= 1 ULTIMATE.start_cstrpbrk_~scanp~0.offset) (and (<= 1 ULTIMATE.start_cstrpbrk_~s1.offset) .cse2 .cse3 .cse4 .cse5 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~scanp~0.base)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~scanp~0.base) (+ (select |#length| ULTIMATE.start_cstrpbrk_~scanp~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset))) (<= ULTIMATE.start_cstrpbrk_~scanp~0.offset (select |#length| ULTIMATE.start_cstrpbrk_~scanp~0.base))) .cse14 .cse15 .cse16) (and .cse0 .cse9 .cse14 .cse10 .cse1 (and .cse2 .cse3 (= 0 ULTIMATE.start_cstrpbrk_~s1.offset) .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse15 .cse13) .cse16)))) 66.53/35.81 [2019-03-28 12:46:40,856 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 32 34) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,856 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,856 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,856 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,856 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,857 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 21) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,857 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 38) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,857 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,857 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,857 INFO L448 ceAbstractionStarter]: For program point L18-3(lines 18 22) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,857 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,857 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. 66.53/35.81 [2019-03-28 12:46:40,858 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 66.53/35.81 [2019-03-28 12:46:40,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,868 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,906 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,907 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,907 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,907 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,908 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,908 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,909 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,909 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,910 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,910 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,910 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,911 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,911 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,911 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,911 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,912 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,912 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,912 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,913 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,913 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,914 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,914 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,914 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,914 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,915 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,915 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,915 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,915 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,937 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,937 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,937 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,940 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,940 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,940 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.53/35.81 [2019-03-28 12:46:40,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,947 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,947 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,947 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,947 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,948 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,948 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,948 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,952 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,952 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,952 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,952 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,953 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,953 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,953 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,953 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,953 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,956 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,956 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,956 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,956 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.53/35.81 [2019-03-28 12:46:40,958 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:40,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:40 BasicIcfg 66.53/35.81 [2019-03-28 12:46:40,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 66.53/35.81 [2019-03-28 12:46:40,961 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 66.53/35.81 [2019-03-28 12:46:40,961 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 66.53/35.81 [2019-03-28 12:46:40,965 INFO L276 PluginConnector]: BuchiAutomizer initialized 66.53/35.81 [2019-03-28 12:46:40,966 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 66.53/35.81 [2019-03-28 12:46:40,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:46:16" (1/5) ... 66.53/35.81 [2019-03-28 12:46:40,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e6bf940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:46:40, skipping insertion in model container 66.53/35.81 [2019-03-28 12:46:40,967 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 66.53/35.81 [2019-03-28 12:46:40,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (2/5) ... 66.53/35.81 [2019-03-28 12:46:40,967 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e6bf940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:46:40, skipping insertion in model container 66.53/35.81 [2019-03-28 12:46:40,967 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 66.53/35.81 [2019-03-28 12:46:40,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:17" (3/5) ... 66.53/35.81 [2019-03-28 12:46:40,968 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e6bf940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:40, skipping insertion in model container 66.53/35.81 [2019-03-28 12:46:40,968 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 66.53/35.81 [2019-03-28 12:46:40,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:17" (4/5) ... 66.53/35.81 [2019-03-28 12:46:40,968 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e6bf940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:40, skipping insertion in model container 66.53/35.81 [2019-03-28 12:46:40,968 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 66.53/35.81 [2019-03-28 12:46:40,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:40" (5/5) ... 66.53/35.81 [2019-03-28 12:46:40,970 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 66.53/35.81 [2019-03-28 12:46:40,992 INFO L133 ementStrategyFactory]: Using default assertion order modulation 66.53/35.81 [2019-03-28 12:46:40,992 INFO L374 BuchiCegarLoop]: Interprodecural is true 66.53/35.81 [2019-03-28 12:46:40,992 INFO L375 BuchiCegarLoop]: Hoare is true 66.53/35.81 [2019-03-28 12:46:40,992 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 66.53/35.81 [2019-03-28 12:46:40,992 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 66.53/35.81 [2019-03-28 12:46:40,993 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 66.53/35.81 [2019-03-28 12:46:40,993 INFO L379 BuchiCegarLoop]: Difference is false 66.53/35.81 [2019-03-28 12:46:40,993 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 66.53/35.81 [2019-03-28 12:46:40,993 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 66.53/35.81 [2019-03-28 12:46:40,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. 66.53/35.81 [2019-03-28 12:46:41,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.53/35.81 [2019-03-28 12:46:41,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 66.53/35.81 [2019-03-28 12:46:41,001 INFO L119 BuchiIsEmpty]: Starting construction of run 66.53/35.81 [2019-03-28 12:46:41,006 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:41,006 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:41,006 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 66.53/35.81 [2019-03-28 12:46:41,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. 66.53/35.81 [2019-03-28 12:46:41,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.53/35.81 [2019-03-28 12:46:41,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 66.53/35.81 [2019-03-28 12:46:41,007 INFO L119 BuchiIsEmpty]: Starting construction of run 66.53/35.81 [2019-03-28 12:46:41,008 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:41,008 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:41,013 INFO L794 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue [144] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start_main_~length2~0] 13#L29true [77] L29-->L29-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 7#L29-2true [105] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 17#L32-1true [121] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4|) 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4|)) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_4|) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4| 1)) (> |v_ULTIMATE.start_main_#t~malloc7.base_4| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_4|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_4|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 4#L37true [87] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |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))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| 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_9|, #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_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #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_4|} AuxVars[] AssignedVars[#memory_int] 22#L37-1true [145] L37-1-->L19-6: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_6 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_6) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_7|, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_8|, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_6, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_8|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, #length=|v_#length_12|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_6, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_8, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_6, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_6, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, #memory_int, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 20#L19-6true 66.53/35.81 [2019-03-28 12:46:41,014 INFO L796 eck$LassoCheckResult]: Loop: 20#L19-6true [98] L19-6-->L18-1: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_4) (= |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| v_ULTIMATE.start_cstrpbrk_~s1.offset_4) (= v_ULTIMATE.start_cstrpbrk_~s1.base_3 |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_4} OutVars{ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2|, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset, ULTIMATE.start_cstrpbrk_~s1.base] 9#L18-1true [146] L18-1-->L18-3: Formula: (and (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| v_ULTIMATE.start_cstrpbrk_~c~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_9, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem1] 3#L18-3true [134] L18-3-->L19-5: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (< 0 v_ULTIMATE.start_cstrpbrk_~c~0_5)) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_7|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 21#L19-5true [99] L19-5-->L19-1: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4 |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4 (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5)) InVars {ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~scanp~0.offset] 12#L19-1true [149] L19-1-->L19-3: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| v_ULTIMATE.start_cstrpbrk_~sc~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|)) (= 1 (select |v_#valid_23| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_9, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~mem3] 6#L19-3true [90] L19-3-->L19-6: Formula: (= 0 v_ULTIMATE.start_cstrpbrk_~sc~0_4) InVars {ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_4} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_6|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_4|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_#t~mem3] 20#L19-6true 66.53/35.81 [2019-03-28 12:46:41,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:41,014 INFO L82 PathProgramCache]: Analyzing trace with hash 789492424, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:41,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:41,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:41,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.53/35.81 [2019-03-28 12:46:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.53/35.81 [2019-03-28 12:46:41,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash -462880909, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:41,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:41,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.53/35.81 [2019-03-28 12:46:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.53/35.81 [2019-03-28 12:46:41,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:41,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1159872762, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:41,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:41,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:41,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:41,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:41,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 66.53/35.81 [2019-03-28 12:46:41,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 66.53/35.81 [2019-03-28 12:46:41,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 66.53/35.81 [2019-03-28 12:46:41,256 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 8 states. 66.53/35.81 [2019-03-28 12:46:41,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:41,591 INFO L93 Difference]: Finished difference Result 34 states and 59 transitions. 66.53/35.81 [2019-03-28 12:46:41,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 66.53/35.81 [2019-03-28 12:46:41,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 59 transitions. 66.53/35.81 [2019-03-28 12:46:41,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.53/35.81 [2019-03-28 12:46:41,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 13 states and 21 transitions. 66.53/35.81 [2019-03-28 12:46:41,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 66.53/35.81 [2019-03-28 12:46:41,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 66.53/35.81 [2019-03-28 12:46:41,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 21 transitions. 66.53/35.81 [2019-03-28 12:46:41,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 66.53/35.81 [2019-03-28 12:46:41,599 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. 66.53/35.81 [2019-03-28 12:46:41,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 21 transitions. 66.53/35.81 [2019-03-28 12:46:41,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. 66.53/35.81 [2019-03-28 12:46:41,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 66.53/35.81 [2019-03-28 12:46:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. 66.53/35.81 [2019-03-28 12:46:41,602 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. 66.53/35.81 [2019-03-28 12:46:41,602 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. 66.53/35.81 [2019-03-28 12:46:41,602 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 66.53/35.81 [2019-03-28 12:46:41,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 21 transitions. 66.53/35.81 [2019-03-28 12:46:41,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.53/35.81 [2019-03-28 12:46:41,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 66.53/35.81 [2019-03-28 12:46:41,603 INFO L119 BuchiIsEmpty]: Starting construction of run 66.53/35.81 [2019-03-28 12:46:41,604 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:41,604 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:41,604 INFO L794 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRY [144] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start_main_~length2~0] 90#L29 [104] L29-->L29-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[] 86#L29-2 [105] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 87#L32-1 [121] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4|) 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4|)) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_4|) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4| 1)) (> |v_ULTIMATE.start_main_#t~malloc7.base_4| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_4|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_4|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 81#L37 [87] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |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))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| 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_9|, #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_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #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_4|} AuxVars[] AssignedVars[#memory_int] 82#L37-1 [145] L37-1-->L19-6: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_6 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_6) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_7|, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_8|, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_6, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_8|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, #length=|v_#length_12|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_6, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_8, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_6, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_6, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, #memory_int, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 84#L19-6 66.53/35.81 [2019-03-28 12:46:41,605 INFO L796 eck$LassoCheckResult]: Loop: 84#L19-6 [98] L19-6-->L18-1: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_4) (= |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| v_ULTIMATE.start_cstrpbrk_~s1.offset_4) (= v_ULTIMATE.start_cstrpbrk_~s1.base_3 |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_4} OutVars{ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2|, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset, ULTIMATE.start_cstrpbrk_~s1.base] 88#L18-1 [146] L18-1-->L18-3: Formula: (and (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| v_ULTIMATE.start_cstrpbrk_~c~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_9, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem1] 79#L18-3 [134] L18-3-->L19-5: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (< 0 v_ULTIMATE.start_cstrpbrk_~c~0_5)) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_7|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 80#L19-5 [99] L19-5-->L19-1: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4 |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4 (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5)) InVars {ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~scanp~0.offset] 89#L19-1 [149] L19-1-->L19-3: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| v_ULTIMATE.start_cstrpbrk_~sc~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|)) (= 1 (select |v_#valid_23| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_9, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~mem3] 83#L19-3 [90] L19-3-->L19-6: Formula: (= 0 v_ULTIMATE.start_cstrpbrk_~sc~0_4) InVars {ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_4} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_6|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_4|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_#t~mem3] 84#L19-6 66.53/35.81 [2019-03-28 12:46:41,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:41,605 INFO L82 PathProgramCache]: Analyzing trace with hash 814427491, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:41,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:41,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:41,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.53/35.81 [2019-03-28 12:46:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.53/35.81 [2019-03-28 12:46:41,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:41,618 INFO L82 PathProgramCache]: Analyzing trace with hash -462880909, now seen corresponding path program 2 times 66.53/35.81 [2019-03-28 12:46:41,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:41,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:41,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.53/35.81 [2019-03-28 12:46:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.53/35.81 [2019-03-28 12:46:41,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:41,627 INFO L82 PathProgramCache]: Analyzing trace with hash -113173675, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:41,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:41,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:41,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.53/35.81 [2019-03-28 12:46:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.53/35.81 [2019-03-28 12:46:41,963 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 66.53/35.81 [2019-03-28 12:46:42,065 INFO L216 LassoAnalysis]: Preferences: 66.53/35.81 [2019-03-28 12:46:42,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 66.53/35.81 [2019-03-28 12:46:42,066 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 66.53/35.81 [2019-03-28 12:46:42,066 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 66.53/35.81 [2019-03-28 12:46:42,066 INFO L127 ssoRankerPreferences]: Use exernal solver: false 66.53/35.81 [2019-03-28 12:46:42,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 66.53/35.81 [2019-03-28 12:46:42,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 66.53/35.81 [2019-03-28 12:46:42,067 INFO L130 ssoRankerPreferences]: Path of dumped script: 66.53/35.81 [2019-03-28 12:46:42,067 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 66.53/35.81 [2019-03-28 12:46:42,067 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 66.53/35.81 [2019-03-28 12:46:42,067 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 66.53/35.81 [2019-03-28 12:46:42,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,350 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 66.53/35.81 [2019-03-28 12:46:42,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.53/35.81 [2019-03-28 12:46:42,853 INFO L300 LassoAnalysis]: Preprocessing complete. 66.53/35.81 [2019-03-28 12:46:42,859 INFO L497 LassoAnalysis]: Using template 'affine'. 66.53/35.81 [2019-03-28 12:46:42,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.53/35.81 Termination analysis: LINEAR_WITH_GUESSES 66.53/35.81 Number of strict supporting invariants: 0 66.53/35.81 Number of non-strict supporting invariants: 1 66.53/35.81 Consider only non-deceasing supporting invariants: true 66.53/35.81 Simplify termination arguments: true 66.53/35.81 Simplify supporting invariants: trueOverapproximate stem: false 66.53/35.81 [2019-03-28 12:46:42,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.53/35.81 [2019-03-28 12:46:42,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.53/35.81 [2019-03-28 12:46:42,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.53/35.81 [2019-03-28 12:46:42,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.53/35.81 [2019-03-28 12:46:42,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.53/35.81 [2019-03-28 12:46:42,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.53/35.81 [2019-03-28 12:46:42,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.53/35.81 [2019-03-28 12:46:42,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.53/35.81 [2019-03-28 12:46:42,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.53/35.81 Termination analysis: LINEAR_WITH_GUESSES 66.53/35.81 Number of strict supporting invariants: 0 66.53/35.81 Number of non-strict supporting invariants: 1 66.53/35.81 Consider only non-deceasing supporting invariants: true 66.53/35.81 Simplify termination arguments: true 66.53/35.81 Simplify supporting invariants: trueOverapproximate stem: false 66.53/35.81 [2019-03-28 12:46:42,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.53/35.81 [2019-03-28 12:46:42,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.53/35.81 [2019-03-28 12:46:42,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.53/35.81 [2019-03-28 12:46:42,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.53/35.81 [2019-03-28 12:46:42,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.53/35.81 [2019-03-28 12:46:42,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.53/35.81 [2019-03-28 12:46:42,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.53/35.81 [2019-03-28 12:46:42,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.53/35.81 [2019-03-28 12:46:42,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.53/35.81 Termination analysis: LINEAR_WITH_GUESSES 66.53/35.81 Number of strict supporting invariants: 0 66.53/35.81 Number of non-strict supporting invariants: 1 66.53/35.81 Consider only non-deceasing supporting invariants: true 66.53/35.81 Simplify termination arguments: true 66.53/35.81 Simplify supporting invariants: trueOverapproximate stem: false 66.53/35.81 [2019-03-28 12:46:42,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.53/35.81 [2019-03-28 12:46:42,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.53/35.81 [2019-03-28 12:46:42,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.53/35.81 [2019-03-28 12:46:42,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.53/35.81 [2019-03-28 12:46:42,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.53/35.81 [2019-03-28 12:46:42,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.53/35.81 [2019-03-28 12:46:42,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.53/35.81 [2019-03-28 12:46:42,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.53/35.81 [2019-03-28 12:46:42,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.53/35.81 Termination analysis: LINEAR_WITH_GUESSES 66.53/35.81 Number of strict supporting invariants: 0 66.53/35.81 Number of non-strict supporting invariants: 1 66.53/35.81 Consider only non-deceasing supporting invariants: true 66.53/35.81 Simplify termination arguments: true 66.53/35.81 Simplify supporting invariants: trueOverapproximate stem: false 66.53/35.81 [2019-03-28 12:46:42,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.53/35.81 [2019-03-28 12:46:42,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.53/35.81 [2019-03-28 12:46:42,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.53/35.81 [2019-03-28 12:46:42,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.53/35.81 [2019-03-28 12:46:42,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.53/35.81 [2019-03-28 12:46:42,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.53/35.81 [2019-03-28 12:46:42,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.53/35.81 [2019-03-28 12:46:42,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.53/35.81 Termination analysis: LINEAR_WITH_GUESSES 66.53/35.81 Number of strict supporting invariants: 0 66.53/35.81 Number of non-strict supporting invariants: 1 66.53/35.81 Consider only non-deceasing supporting invariants: true 66.53/35.81 Simplify termination arguments: true 66.53/35.81 Simplify supporting invariants: trueOverapproximate stem: false 66.53/35.81 [2019-03-28 12:46:42,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.53/35.81 [2019-03-28 12:46:42,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.53/35.81 [2019-03-28 12:46:42,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.53/35.81 [2019-03-28 12:46:42,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.53/35.81 [2019-03-28 12:46:42,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.53/35.81 [2019-03-28 12:46:42,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.53/35.81 [2019-03-28 12:46:42,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.53/35.81 [2019-03-28 12:46:42,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.53/35.81 [2019-03-28 12:46:42,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.53/35.81 Termination analysis: LINEAR_WITH_GUESSES 66.53/35.81 Number of strict supporting invariants: 0 66.53/35.81 Number of non-strict supporting invariants: 1 66.53/35.81 Consider only non-deceasing supporting invariants: true 66.53/35.81 Simplify termination arguments: true 66.53/35.81 Simplify supporting invariants: trueOverapproximate stem: false 66.53/35.81 [2019-03-28 12:46:42,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.53/35.81 [2019-03-28 12:46:42,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.53/35.81 [2019-03-28 12:46:42,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.53/35.81 [2019-03-28 12:46:42,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.53/35.81 [2019-03-28 12:46:42,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.53/35.81 [2019-03-28 12:46:42,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.53/35.81 [2019-03-28 12:46:42,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.53/35.81 [2019-03-28 12:46:42,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.53/35.81 [2019-03-28 12:46:42,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.53/35.81 Termination analysis: LINEAR_WITH_GUESSES 66.53/35.81 Number of strict supporting invariants: 0 66.53/35.81 Number of non-strict supporting invariants: 1 66.53/35.81 Consider only non-deceasing supporting invariants: true 66.53/35.81 Simplify termination arguments: true 66.53/35.81 Simplify supporting invariants: trueOverapproximate stem: false 66.53/35.81 [2019-03-28 12:46:42,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.53/35.81 [2019-03-28 12:46:42,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.53/35.81 [2019-03-28 12:46:42,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.53/35.81 [2019-03-28 12:46:42,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.53/35.81 [2019-03-28 12:46:42,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.53/35.81 [2019-03-28 12:46:42,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.53/35.81 [2019-03-28 12:46:42,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.53/35.81 [2019-03-28 12:46:42,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.53/35.81 [2019-03-28 12:46:42,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.53/35.81 Termination analysis: LINEAR_WITH_GUESSES 66.53/35.81 Number of strict supporting invariants: 0 66.53/35.81 Number of non-strict supporting invariants: 1 66.53/35.81 Consider only non-deceasing supporting invariants: true 66.53/35.81 Simplify termination arguments: true 66.53/35.81 Simplify supporting invariants: trueOverapproximate stem: false 66.53/35.81 [2019-03-28 12:46:42,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.53/35.81 [2019-03-28 12:46:42,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.53/35.81 [2019-03-28 12:46:42,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.53/35.81 [2019-03-28 12:46:42,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.53/35.81 [2019-03-28 12:46:42,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.53/35.81 [2019-03-28 12:46:42,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.53/35.81 [2019-03-28 12:46:42,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.53/35.81 [2019-03-28 12:46:42,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.53/35.81 [2019-03-28 12:46:42,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.53/35.81 Termination analysis: LINEAR_WITH_GUESSES 66.53/35.81 Number of strict supporting invariants: 0 66.53/35.81 Number of non-strict supporting invariants: 1 66.53/35.81 Consider only non-deceasing supporting invariants: true 66.53/35.81 Simplify termination arguments: true 66.53/35.81 Simplify supporting invariants: trueOverapproximate stem: false 66.53/35.81 [2019-03-28 12:46:42,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.53/35.81 [2019-03-28 12:46:42,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.53/35.81 [2019-03-28 12:46:42,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.53/35.81 [2019-03-28 12:46:42,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.53/35.81 [2019-03-28 12:46:42,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.53/35.81 [2019-03-28 12:46:42,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.53/35.81 [2019-03-28 12:46:42,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.53/35.81 [2019-03-28 12:46:42,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.53/35.81 Termination analysis: LINEAR_WITH_GUESSES 66.53/35.81 Number of strict supporting invariants: 0 66.53/35.81 Number of non-strict supporting invariants: 1 66.53/35.81 Consider only non-deceasing supporting invariants: true 66.53/35.81 Simplify termination arguments: true 66.53/35.81 Simplify supporting invariants: trueOverapproximate stem: false 66.53/35.81 [2019-03-28 12:46:42,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.53/35.81 [2019-03-28 12:46:42,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.53/35.81 [2019-03-28 12:46:42,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.53/35.81 [2019-03-28 12:46:42,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.53/35.81 [2019-03-28 12:46:42,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.53/35.81 [2019-03-28 12:46:42,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.53/35.81 [2019-03-28 12:46:42,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.53/35.81 [2019-03-28 12:46:42,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.53/35.81 [2019-03-28 12:46:42,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.53/35.81 Termination analysis: LINEAR_WITH_GUESSES 66.53/35.81 Number of strict supporting invariants: 0 66.53/35.81 Number of non-strict supporting invariants: 1 66.53/35.81 Consider only non-deceasing supporting invariants: true 66.53/35.81 Simplify termination arguments: true 66.53/35.81 Simplify supporting invariants: trueOverapproximate stem: false 66.53/35.81 [2019-03-28 12:46:42,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.53/35.81 [2019-03-28 12:46:42,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.53/35.81 [2019-03-28 12:46:42,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.53/35.81 [2019-03-28 12:46:42,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.53/35.81 [2019-03-28 12:46:42,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.53/35.81 [2019-03-28 12:46:42,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.53/35.81 [2019-03-28 12:46:42,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.53/35.81 [2019-03-28 12:46:42,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.53/35.81 Termination analysis: LINEAR_WITH_GUESSES 66.53/35.81 Number of strict supporting invariants: 0 66.53/35.81 Number of non-strict supporting invariants: 1 66.53/35.81 Consider only non-deceasing supporting invariants: true 66.53/35.81 Simplify termination arguments: true 66.53/35.81 Simplify supporting invariants: trueOverapproximate stem: false 66.53/35.81 [2019-03-28 12:46:42,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.53/35.81 [2019-03-28 12:46:42,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.53/35.81 [2019-03-28 12:46:42,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.53/35.81 [2019-03-28 12:46:42,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.53/35.81 [2019-03-28 12:46:42,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.53/35.81 [2019-03-28 12:46:42,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.53/35.81 [2019-03-28 12:46:42,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.53/35.81 [2019-03-28 12:46:42,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.53/35.81 Termination analysis: LINEAR_WITH_GUESSES 66.53/35.81 Number of strict supporting invariants: 0 66.53/35.81 Number of non-strict supporting invariants: 1 66.53/35.81 Consider only non-deceasing supporting invariants: true 66.53/35.81 Simplify termination arguments: true 66.53/35.81 Simplify supporting invariants: trueOverapproximate stem: false 66.53/35.81 [2019-03-28 12:46:42,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.53/35.81 [2019-03-28 12:46:42,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.53/35.81 [2019-03-28 12:46:42,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.53/35.81 [2019-03-28 12:46:42,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.53/35.81 [2019-03-28 12:46:42,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.53/35.81 [2019-03-28 12:46:42,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.53/35.81 [2019-03-28 12:46:42,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.53/35.81 [2019-03-28 12:46:42,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.53/35.81 Termination analysis: LINEAR_WITH_GUESSES 66.53/35.81 Number of strict supporting invariants: 0 66.53/35.81 Number of non-strict supporting invariants: 1 66.53/35.81 Consider only non-deceasing supporting invariants: true 66.53/35.81 Simplify termination arguments: true 66.53/35.81 Simplify supporting invariants: trueOverapproximate stem: false 66.53/35.81 [2019-03-28 12:46:42,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.53/35.81 [2019-03-28 12:46:42,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.53/35.81 [2019-03-28 12:46:42,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.53/35.81 [2019-03-28 12:46:42,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.53/35.81 [2019-03-28 12:46:42,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.53/35.81 [2019-03-28 12:46:42,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.53/35.81 [2019-03-28 12:46:42,971 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 66.53/35.81 [2019-03-28 12:46:43,001 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 66.53/35.81 [2019-03-28 12:46:43,001 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. 66.53/35.81 [2019-03-28 12:46:43,005 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 66.53/35.81 [2019-03-28 12:46:43,006 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 66.53/35.81 [2019-03-28 12:46:43,006 INFO L518 LassoAnalysis]: Proved termination. 66.53/35.81 [2019-03-28 12:46:43,007 INFO L520 LassoAnalysis]: Termination argument consisting of: 66.53/35.81 Ranking function f(ULTIMATE.start_cstrpbrk_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1) = -1*ULTIMATE.start_cstrpbrk_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1 66.53/35.81 Supporting invariants [] 66.53/35.81 [2019-03-28 12:46:43,050 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed 66.53/35.81 [2019-03-28 12:46:43,054 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.53/35.81 [2019-03-28 12:46:43,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:43,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core 66.53/35.81 [2019-03-28 12:46:43,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.53/35.81 [2019-03-28 12:46:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:43,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core 66.53/35.81 [2019-03-28 12:46:43,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.53/35.81 [2019-03-28 12:46:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:43,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core 66.53/35.81 [2019-03-28 12:46:43,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.53/35.81 [2019-03-28 12:46:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:43,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core 66.53/35.81 [2019-03-28 12:46:43,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.53/35.81 [2019-03-28 12:46:43,322 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization 66.53/35.81 [2019-03-28 12:46:43,329 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 8 loop predicates 66.53/35.81 [2019-03-28 12:46:43,330 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 21 transitions. cyclomatic complexity: 9 Second operand 5 states. 66.53/35.81 [2019-03-28 12:46:43,676 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 21 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 22 states and 34 transitions. Complement of second has 8 states. 66.53/35.81 [2019-03-28 12:46:43,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states 66.53/35.81 [2019-03-28 12:46:43,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 66.53/35.81 [2019-03-28 12:46:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. 66.53/35.81 [2019-03-28 12:46:43,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 6 letters. 66.53/35.81 [2019-03-28 12:46:43,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. 66.53/35.81 [2019-03-28 12:46:43,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 12 letters. Loop has 6 letters. 66.53/35.81 [2019-03-28 12:46:43,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. 66.53/35.81 [2019-03-28 12:46:43,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 12 letters. 66.53/35.81 [2019-03-28 12:46:43,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. 66.53/35.81 [2019-03-28 12:46:43,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 34 transitions. 66.53/35.81 [2019-03-28 12:46:43,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 66.53/35.81 [2019-03-28 12:46:43,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 31 transitions. 66.53/35.81 [2019-03-28 12:46:43,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 66.53/35.81 [2019-03-28 12:46:43,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 66.53/35.81 [2019-03-28 12:46:43,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 31 transitions. 66.53/35.81 [2019-03-28 12:46:43,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 66.53/35.81 [2019-03-28 12:46:43,690 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 31 transitions. 66.53/35.81 [2019-03-28 12:46:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 31 transitions. 66.53/35.81 [2019-03-28 12:46:43,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. 66.53/35.81 [2019-03-28 12:46:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 66.53/35.81 [2019-03-28 12:46:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. 66.53/35.81 [2019-03-28 12:46:43,692 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 30 transitions. 66.53/35.81 [2019-03-28 12:46:43,692 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 30 transitions. 66.53/35.81 [2019-03-28 12:46:43,692 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 66.53/35.81 [2019-03-28 12:46:43,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 30 transitions. 66.53/35.81 [2019-03-28 12:46:43,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 66.53/35.81 [2019-03-28 12:46:43,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 66.53/35.81 [2019-03-28 12:46:43,693 INFO L119 BuchiIsEmpty]: Starting construction of run 66.53/35.81 [2019-03-28 12:46:43,694 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:43,694 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 66.53/35.81 [2019-03-28 12:46:43,695 INFO L794 eck$LassoCheckResult]: Stem: 303#ULTIMATE.startENTRY [144] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start_main_~length2~0] 302#L29 [104] L29-->L29-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[] 297#L29-2 [105] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 298#L32-1 [121] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4|) 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4|)) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_4|) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4| 1)) (> |v_ULTIMATE.start_main_#t~malloc7.base_4| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_4|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_4|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 290#L37 [87] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |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))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| 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_9|, #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_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #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_4|} AuxVars[] AssignedVars[#memory_int] 291#L37-1 [145] L37-1-->L19-6: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_6 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_6) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_7|, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_8|, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_6, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_8|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, #length=|v_#length_12|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_6, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_8, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_6, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_6, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, #memory_int, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 304#L19-6 [98] L19-6-->L18-1: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_4) (= |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| v_ULTIMATE.start_cstrpbrk_~s1.offset_4) (= v_ULTIMATE.start_cstrpbrk_~s1.base_3 |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_4} OutVars{ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2|, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset, ULTIMATE.start_cstrpbrk_~s1.base] 299#L18-1 [146] L18-1-->L18-3: Formula: (and (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| v_ULTIMATE.start_cstrpbrk_~c~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_9, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem1] 287#L18-3 [135] L18-3-->L19-5: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (> 0 v_ULTIMATE.start_cstrpbrk_~c~0_5)) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_7|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 289#L19-5 66.53/35.81 [2019-03-28 12:46:43,695 INFO L796 eck$LassoCheckResult]: Loop: 289#L19-5 [99] L19-5-->L19-1: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4 |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4 (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5)) InVars {ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~scanp~0.offset] 300#L19-1 [149] L19-1-->L19-3: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| v_ULTIMATE.start_cstrpbrk_~sc~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|)) (= 1 (select |v_#valid_23| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_9, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~mem3] 292#L19-3 [140] L19-3-->L20: Formula: (< 0 v_ULTIMATE.start_cstrpbrk_~sc~0_5) InVars {ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_7|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_#t~mem3] 293#L20 [142] L20-->L19-5: Formula: (> v_ULTIMATE.start_cstrpbrk_~c~0_7 v_ULTIMATE.start_cstrpbrk_~sc~0_7) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_7} OutVars{ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_7} AuxVars[] AssignedVars[] 289#L19-5 66.53/35.81 [2019-03-28 12:46:43,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:43,695 INFO L82 PathProgramCache]: Analyzing trace with hash 339228116, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:43,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:43,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:43,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:43,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:43,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.53/35.81 [2019-03-28 12:46:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.53/35.81 [2019-03-28 12:46:43,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:43,717 INFO L82 PathProgramCache]: Analyzing trace with hash 4020501, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:43,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:43,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:43,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:43,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:43,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.53/35.81 [2019-03-28 12:46:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.53/35.81 [2019-03-28 12:46:43,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.53/35.81 [2019-03-28 12:46:43,723 INFO L82 PathProgramCache]: Analyzing trace with hash 787508584, now seen corresponding path program 1 times 66.53/35.81 [2019-03-28 12:46:43,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.53/35.81 [2019-03-28 12:46:43,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.53/35.81 [2019-03-28 12:46:43,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:43,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:43,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.53/35.81 [2019-03-28 12:46:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.53/35.81 [2019-03-28 12:46:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.53/35.81 [2019-03-28 12:46:43,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.53/35.81 [2019-03-28 12:46:43,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 66.53/35.81 [2019-03-28 12:46:43,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 66.53/35.81 [2019-03-28 12:46:43,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 66.53/35.81 [2019-03-28 12:46:43,804 INFO L87 Difference]: Start difference. First operand 18 states and 30 transitions. cyclomatic complexity: 14 Second operand 4 states. 66.53/35.81 [2019-03-28 12:46:43,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.53/35.81 [2019-03-28 12:46:43,853 INFO L93 Difference]: Finished difference Result 34 states and 51 transitions. 66.54/35.81 [2019-03-28 12:46:43,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 66.54/35.81 [2019-03-28 12:46:43,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 51 transitions. 66.54/35.81 [2019-03-28 12:46:43,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 66.54/35.81 [2019-03-28 12:46:43,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 51 transitions. 66.54/35.81 [2019-03-28 12:46:43,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 66.54/35.81 [2019-03-28 12:46:43,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 66.54/35.81 [2019-03-28 12:46:43,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 51 transitions. 66.54/35.81 [2019-03-28 12:46:43,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 66.54/35.81 [2019-03-28 12:46:43,859 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 51 transitions. 66.54/35.81 [2019-03-28 12:46:43,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 51 transitions. 66.54/35.81 [2019-03-28 12:46:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. 66.54/35.81 [2019-03-28 12:46:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 66.54/35.81 [2019-03-28 12:46:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. 66.54/35.81 [2019-03-28 12:46:43,861 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 45 transitions. 66.54/35.81 [2019-03-28 12:46:43,861 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 45 transitions. 66.54/35.81 [2019-03-28 12:46:43,861 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 66.54/35.81 [2019-03-28 12:46:43,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 45 transitions. 66.54/35.81 [2019-03-28 12:46:43,862 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 66.54/35.81 [2019-03-28 12:46:43,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 66.54/35.81 [2019-03-28 12:46:43,862 INFO L119 BuchiIsEmpty]: Starting construction of run 66.54/35.81 [2019-03-28 12:46:43,863 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 66.54/35.81 [2019-03-28 12:46:43,863 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 66.54/35.81 [2019-03-28 12:46:43,863 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY [144] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start_main_~length2~0] 370#L29 [104] L29-->L29-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[] 363#L29-2 [105] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 364#L32-1 [121] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4|) 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4|)) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_4|) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4| 1)) (> |v_ULTIMATE.start_main_#t~malloc7.base_4| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_4|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_4|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 355#L37 [87] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |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))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| 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_9|, #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_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #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_4|} AuxVars[] AssignedVars[#memory_int] 356#L37-1 [145] L37-1-->L19-6: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_6 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_6) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_7|, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_8|, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_6, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_8|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, #length=|v_#length_12|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_6, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_8, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_6, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_6, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, #memory_int, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 373#L19-6 [98] L19-6-->L18-1: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_4) (= |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| v_ULTIMATE.start_cstrpbrk_~s1.offset_4) (= v_ULTIMATE.start_cstrpbrk_~s1.base_3 |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_4} OutVars{ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2|, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset, ULTIMATE.start_cstrpbrk_~s1.base] 365#L18-1 [146] L18-1-->L18-3: Formula: (and (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| v_ULTIMATE.start_cstrpbrk_~c~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_9, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem1] 350#L18-3 [134] L18-3-->L19-5: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (< 0 v_ULTIMATE.start_cstrpbrk_~c~0_5)) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_7|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 352#L19-5 66.54/35.81 [2019-03-28 12:46:43,864 INFO L796 eck$LassoCheckResult]: Loop: 352#L19-5 [99] L19-5-->L19-1: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4 |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4 (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5)) InVars {ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~scanp~0.offset] 377#L19-1 [149] L19-1-->L19-3: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| v_ULTIMATE.start_cstrpbrk_~sc~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|)) (= 1 (select |v_#valid_23| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_9, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~mem3] 357#L19-3 [140] L19-3-->L20: Formula: (< 0 v_ULTIMATE.start_cstrpbrk_~sc~0_5) InVars {ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_7|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_#t~mem3] 358#L20 [142] L20-->L19-5: Formula: (> v_ULTIMATE.start_cstrpbrk_~c~0_7 v_ULTIMATE.start_cstrpbrk_~sc~0_7) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_7} OutVars{ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_7} AuxVars[] AssignedVars[] 352#L19-5 66.54/35.81 [2019-03-28 12:46:43,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.54/35.81 [2019-03-28 12:46:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash 339228115, now seen corresponding path program 1 times 66.54/35.81 [2019-03-28 12:46:43,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.54/35.81 [2019-03-28 12:46:43,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.54/35.81 [2019-03-28 12:46:43,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.54/35.81 [2019-03-28 12:46:43,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.54/35.81 [2019-03-28 12:46:43,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.54/35.81 [2019-03-28 12:46:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.54/35.81 [2019-03-28 12:46:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.54/35.81 [2019-03-28 12:46:43,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.54/35.81 [2019-03-28 12:46:43,885 INFO L82 PathProgramCache]: Analyzing trace with hash 4020501, now seen corresponding path program 2 times 66.54/35.81 [2019-03-28 12:46:43,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.54/35.81 [2019-03-28 12:46:43,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.54/35.81 [2019-03-28 12:46:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.54/35.81 [2019-03-28 12:46:43,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.54/35.81 [2019-03-28 12:46:43,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.54/35.81 [2019-03-28 12:46:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.54/35.81 [2019-03-28 12:46:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.54/35.81 [2019-03-28 12:46:43,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.54/35.81 [2019-03-28 12:46:43,891 INFO L82 PathProgramCache]: Analyzing trace with hash 786585063, now seen corresponding path program 1 times 66.54/35.81 [2019-03-28 12:46:43,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.54/35.81 [2019-03-28 12:46:43,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.54/35.81 [2019-03-28 12:46:43,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.54/35.81 [2019-03-28 12:46:43,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 66.54/35.81 [2019-03-28 12:46:43,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.54/35.81 [2019-03-28 12:46:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.54/35.81 [2019-03-28 12:46:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.54/35.81 [2019-03-28 12:46:44,313 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 66.54/35.81 [2019-03-28 12:46:44,437 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 84 66.54/35.81 [2019-03-28 12:46:44,439 INFO L216 LassoAnalysis]: Preferences: 66.54/35.81 [2019-03-28 12:46:44,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 66.54/35.81 [2019-03-28 12:46:44,439 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 66.54/35.81 [2019-03-28 12:46:44,439 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 66.54/35.81 [2019-03-28 12:46:44,440 INFO L127 ssoRankerPreferences]: Use exernal solver: false 66.54/35.81 [2019-03-28 12:46:44,440 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 66.54/35.81 [2019-03-28 12:46:44,440 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 66.54/35.81 [2019-03-28 12:46:44,440 INFO L130 ssoRankerPreferences]: Path of dumped script: 66.54/35.81 [2019-03-28 12:46:44,440 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 66.54/35.81 [2019-03-28 12:46:44,440 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 66.54/35.81 [2019-03-28 12:46:44,440 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 66.54/35.81 [2019-03-28 12:46:44,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:44,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:44,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:44,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:44,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:44,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:44,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:44,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:44,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:44,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:44,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:44,729 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 66.54/35.81 [2019-03-28 12:46:44,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:44,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:44,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:44,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:44,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.81 [2019-03-28 12:46:45,110 INFO L300 LassoAnalysis]: Preprocessing complete. 66.54/35.81 [2019-03-28 12:46:45,110 INFO L497 LassoAnalysis]: Using template 'affine'. 66.54/35.82 [2019-03-28 12:46:45,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.54/35.82 [2019-03-28 12:46:45,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.54/35.82 [2019-03-28 12:46:45,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.54/35.82 [2019-03-28 12:46:45,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.54/35.82 [2019-03-28 12:46:45,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.54/35.82 [2019-03-28 12:46:45,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.54/35.82 [2019-03-28 12:46:45,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.54/35.82 [2019-03-28 12:46:45,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.54/35.82 [2019-03-28 12:46:45,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:45,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:45,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:45,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:45,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:45,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:45,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:45,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:45,202 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 66.54/35.82 [2019-03-28 12:46:45,210 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 66.54/35.82 [2019-03-28 12:46:45,210 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. 66.54/35.82 [2019-03-28 12:46:45,211 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 66.54/35.82 [2019-03-28 12:46:45,212 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 66.54/35.82 [2019-03-28 12:46:45,212 INFO L518 LassoAnalysis]: Proved termination. 66.54/35.82 [2019-03-28 12:46:45,212 INFO L520 LassoAnalysis]: Termination argument consisting of: 66.54/35.82 Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_2, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_2 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset 66.54/35.82 Supporting invariants [] 66.54/35.82 [2019-03-28 12:46:45,249 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed 66.54/35.82 [2019-03-28 12:46:45,251 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:45,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.54/35.82 [2019-03-28 12:46:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.54/35.82 [2019-03-28 12:46:45,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core 66.54/35.82 [2019-03-28 12:46:45,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.54/35.82 [2019-03-28 12:46:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.54/35.82 [2019-03-28 12:46:45,343 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core 66.54/35.82 [2019-03-28 12:46:45,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.54/35.82 [2019-03-28 12:46:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.54/35.82 [2019-03-28 12:46:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.54/35.82 [2019-03-28 12:46:45,561 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core 66.54/35.82 [2019-03-28 12:46:45,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.54/35.82 [2019-03-28 12:46:45,563 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization 66.54/35.82 [2019-03-28 12:46:45,563 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates 66.54/35.82 [2019-03-28 12:46:45,564 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 28 states and 45 transitions. cyclomatic complexity: 20 Second operand 6 states. 66.54/35.82 [2019-03-28 12:46:45,830 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 28 states and 45 transitions. cyclomatic complexity: 20. Second operand 6 states. Result 43 states and 68 transitions. Complement of second has 9 states. 66.54/35.82 [2019-03-28 12:46:45,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states 66.54/35.82 [2019-03-28 12:46:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 66.54/35.82 [2019-03-28 12:46:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. 66.54/35.82 [2019-03-28 12:46:45,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 9 letters. Loop has 4 letters. 66.54/35.82 [2019-03-28 12:46:45,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. 66.54/35.82 [2019-03-28 12:46:45,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 13 letters. Loop has 4 letters. 66.54/35.82 [2019-03-28 12:46:45,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. 66.54/35.82 [2019-03-28 12:46:45,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 9 letters. Loop has 8 letters. 66.54/35.82 [2019-03-28 12:46:45,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. 66.54/35.82 [2019-03-28 12:46:45,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 68 transitions. 66.54/35.82 [2019-03-28 12:46:45,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 66.54/35.82 [2019-03-28 12:46:45,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 28 states and 44 transitions. 66.54/35.82 [2019-03-28 12:46:45,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 66.54/35.82 [2019-03-28 12:46:45,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 66.54/35.82 [2019-03-28 12:46:45,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 44 transitions. 66.54/35.82 [2019-03-28 12:46:45,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 66.54/35.82 [2019-03-28 12:46:45,839 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 44 transitions. 66.54/35.82 [2019-03-28 12:46:45,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 44 transitions. 66.54/35.82 [2019-03-28 12:46:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. 66.54/35.82 [2019-03-28 12:46:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 66.54/35.82 [2019-03-28 12:46:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. 66.54/35.82 [2019-03-28 12:46:45,841 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 38 transitions. 66.54/35.82 [2019-03-28 12:46:45,841 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 38 transitions. 66.54/35.82 [2019-03-28 12:46:45,841 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 66.54/35.82 [2019-03-28 12:46:45,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 38 transitions. 66.54/35.82 [2019-03-28 12:46:45,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 66.54/35.82 [2019-03-28 12:46:45,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 66.54/35.82 [2019-03-28 12:46:45,842 INFO L119 BuchiIsEmpty]: Starting construction of run 66.54/35.82 [2019-03-28 12:46:45,843 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 66.54/35.82 [2019-03-28 12:46:45,843 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 66.54/35.82 [2019-03-28 12:46:45,843 INFO L794 eck$LassoCheckResult]: Stem: 593#ULTIMATE.startENTRY [144] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start_main_~length2~0] 591#L29 [104] L29-->L29-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[] 585#L29-2 [105] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 586#L32-1 [121] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4|) 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4|)) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_4|) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4| 1)) (> |v_ULTIMATE.start_main_#t~malloc7.base_4| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_4|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_4|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 577#L37 [87] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |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))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| 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_9|, #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_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #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_4|} AuxVars[] AssignedVars[#memory_int] 578#L37-1 [145] L37-1-->L19-6: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_6 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_6) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_7|, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_8|, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_6, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_8|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, #length=|v_#length_12|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_6, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_8, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_6, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_6, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, #memory_int, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 594#L19-6 [98] L19-6-->L18-1: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_4) (= |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| v_ULTIMATE.start_cstrpbrk_~s1.offset_4) (= v_ULTIMATE.start_cstrpbrk_~s1.base_3 |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_4} OutVars{ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2|, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset, ULTIMATE.start_cstrpbrk_~s1.base] 587#L18-1 [146] L18-1-->L18-3: Formula: (and (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| v_ULTIMATE.start_cstrpbrk_~c~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_9, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem1] 573#L18-3 [135] L18-3-->L19-5: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (> 0 v_ULTIMATE.start_cstrpbrk_~c~0_5)) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_7|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 576#L19-5 66.54/35.82 [2019-03-28 12:46:45,844 INFO L796 eck$LassoCheckResult]: Loop: 576#L19-5 [99] L19-5-->L19-1: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4 |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4 (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5)) InVars {ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~scanp~0.offset] 588#L19-1 [149] L19-1-->L19-3: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| v_ULTIMATE.start_cstrpbrk_~sc~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|)) (= 1 (select |v_#valid_23| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_9, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~mem3] 579#L19-3 [140] L19-3-->L20: Formula: (< 0 v_ULTIMATE.start_cstrpbrk_~sc~0_5) InVars {ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_7|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_#t~mem3] 580#L20 [143] L20-->L19-5: Formula: (< v_ULTIMATE.start_cstrpbrk_~c~0_7 v_ULTIMATE.start_cstrpbrk_~sc~0_7) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_7} OutVars{ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_7} AuxVars[] AssignedVars[] 576#L19-5 66.54/35.82 [2019-03-28 12:46:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.54/35.82 [2019-03-28 12:46:45,844 INFO L82 PathProgramCache]: Analyzing trace with hash 339228116, now seen corresponding path program 2 times 66.54/35.82 [2019-03-28 12:46:45,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.54/35.82 [2019-03-28 12:46:45,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.54/35.82 [2019-03-28 12:46:45,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.54/35.82 [2019-03-28 12:46:45,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.54/35.82 [2019-03-28 12:46:45,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.54/35.82 [2019-03-28 12:46:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.54/35.82 [2019-03-28 12:46:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.54/35.82 [2019-03-28 12:46:45,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.54/35.82 [2019-03-28 12:46:45,863 INFO L82 PathProgramCache]: Analyzing trace with hash 4020502, now seen corresponding path program 1 times 66.54/35.82 [2019-03-28 12:46:45,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.54/35.82 [2019-03-28 12:46:45,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.54/35.82 [2019-03-28 12:46:45,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.54/35.82 [2019-03-28 12:46:45,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 66.54/35.82 [2019-03-28 12:46:45,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.54/35.82 [2019-03-28 12:46:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.54/35.82 [2019-03-28 12:46:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.54/35.82 [2019-03-28 12:46:45,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.54/35.82 [2019-03-28 12:46:45,869 INFO L82 PathProgramCache]: Analyzing trace with hash 787508585, now seen corresponding path program 1 times 66.54/35.82 [2019-03-28 12:46:45,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.54/35.82 [2019-03-28 12:46:45,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.54/35.82 [2019-03-28 12:46:45,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.54/35.82 [2019-03-28 12:46:45,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.54/35.82 [2019-03-28 12:46:45,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.54/35.82 [2019-03-28 12:46:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.54/35.82 [2019-03-28 12:46:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.54/35.82 [2019-03-28 12:46:46,376 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 66.54/35.82 [2019-03-28 12:46:46,492 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 66.54/35.82 [2019-03-28 12:46:46,494 INFO L216 LassoAnalysis]: Preferences: 66.54/35.82 [2019-03-28 12:46:46,494 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 66.54/35.82 [2019-03-28 12:46:46,494 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 66.54/35.82 [2019-03-28 12:46:46,494 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 66.54/35.82 [2019-03-28 12:46:46,494 INFO L127 ssoRankerPreferences]: Use exernal solver: false 66.54/35.82 [2019-03-28 12:46:46,494 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 66.54/35.82 [2019-03-28 12:46:46,494 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 66.54/35.82 [2019-03-28 12:46:46,494 INFO L130 ssoRankerPreferences]: Path of dumped script: 66.54/35.82 [2019-03-28 12:46:46,495 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 66.54/35.82 [2019-03-28 12:46:46,495 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 66.54/35.82 [2019-03-28 12:46:46,495 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 66.54/35.82 [2019-03-28 12:46:46,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:46,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:46,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:46,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:46,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:46,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:46,751 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 66.54/35.82 [2019-03-28 12:46:46,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:46,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:46,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:46,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:46,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:46,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:46,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:46,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:46,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:46,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.54/35.82 [2019-03-28 12:46:47,153 INFO L300 LassoAnalysis]: Preprocessing complete. 66.54/35.82 [2019-03-28 12:46:47,153 INFO L497 LassoAnalysis]: Using template 'affine'. 66.54/35.82 [2019-03-28 12:46:47,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:47,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:47,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.54/35.82 [2019-03-28 12:46:47,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:47,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:47,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:47,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:47,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:47,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:47,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:47,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:47,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:47,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:47,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:47,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:47,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:47,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:47,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:47,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:47,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.54/35.82 [2019-03-28 12:46:47,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:47,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:47,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:47,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:47,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:47,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:47,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:47,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:47,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.54/35.82 [2019-03-28 12:46:47,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:47,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:47,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:47,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:47,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:47,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:47,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:47,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:47,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:47,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:47,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:47,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:47,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:47,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:47,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:47,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:47,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:47,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:47,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:47,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:47,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:47,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:47,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:47,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:47,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:47,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:47,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:47,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:47,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:47,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:47,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:47,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:47,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:47,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:47,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:47,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:47,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:47,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:47,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:47,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:47,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:47,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:47,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:47,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:47,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:47,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:47,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:47,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:47,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:47,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:47,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:47,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:47,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:47,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:47,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:47,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:47,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:47,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:47,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:47,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:47,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:47,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:47,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:47,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:47,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:47,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:47,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:47,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:47,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:47,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.54/35.82 [2019-03-28 12:46:47,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.54/35.82 Termination analysis: LINEAR_WITH_GUESSES 66.54/35.82 Number of strict supporting invariants: 0 66.54/35.82 Number of non-strict supporting invariants: 1 66.54/35.82 Consider only non-deceasing supporting invariants: true 66.54/35.82 Simplify termination arguments: true 66.54/35.82 Simplify supporting invariants: trueOverapproximate stem: false 66.54/35.82 [2019-03-28 12:46:47,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.54/35.82 [2019-03-28 12:46:47,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.54/35.82 [2019-03-28 12:46:47,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.54/35.82 [2019-03-28 12:46:47,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.54/35.82 [2019-03-28 12:46:47,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.54/35.82 [2019-03-28 12:46:47,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.54/35.82 [2019-03-28 12:46:47,214 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 66.54/35.82 [2019-03-28 12:46:47,226 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 66.54/35.82 [2019-03-28 12:46:47,226 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. 66.54/35.82 [2019-03-28 12:46:47,227 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 66.54/35.82 [2019-03-28 12:46:47,227 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 66.54/35.82 [2019-03-28 12:46:47,228 INFO L518 LassoAnalysis]: Proved termination. 66.54/35.82 [2019-03-28 12:46:47,228 INFO L520 LassoAnalysis]: Termination argument consisting of: 66.54/35.82 Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_3 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset 66.54/35.82 Supporting invariants [] 66.54/35.82 [2019-03-28 12:46:47,263 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed 66.54/35.82 [2019-03-28 12:46:47,265 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.54/35.82 [2019-03-28 12:46:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.54/35.82 [2019-03-28 12:46:47,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core 66.54/35.82 [2019-03-28 12:46:47,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.54/35.82 [2019-03-28 12:46:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.54/35.82 [2019-03-28 12:46:47,344 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core 66.54/35.82 [2019-03-28 12:46:47,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.54/35.82 [2019-03-28 12:46:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.54/35.82 [2019-03-28 12:46:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.54/35.82 [2019-03-28 12:46:47,499 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core 66.54/35.82 [2019-03-28 12:46:47,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.54/35.82 [2019-03-28 12:46:47,501 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization 66.54/35.82 [2019-03-28 12:46:47,502 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates 66.54/35.82 [2019-03-28 12:46:47,502 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 38 transitions. cyclomatic complexity: 16 Second operand 6 states. 66.54/35.82 [2019-03-28 12:46:47,743 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 38 transitions. cyclomatic complexity: 16. Second operand 6 states. Result 41 states and 62 transitions. Complement of second has 9 states. 66.54/35.82 [2019-03-28 12:46:47,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states 66.54/35.82 [2019-03-28 12:46:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 66.54/35.82 [2019-03-28 12:46:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. 66.54/35.82 [2019-03-28 12:46:47,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 9 letters. Loop has 4 letters. 66.54/35.82 [2019-03-28 12:46:47,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. 66.54/35.82 [2019-03-28 12:46:47,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 13 letters. Loop has 4 letters. 66.54/35.82 [2019-03-28 12:46:47,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. 66.54/35.82 [2019-03-28 12:46:47,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 9 letters. Loop has 8 letters. 66.54/35.82 [2019-03-28 12:46:47,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. 66.54/35.82 [2019-03-28 12:46:47,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 62 transitions. 66.54/35.82 [2019-03-28 12:46:47,749 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 66.54/35.82 [2019-03-28 12:46:47,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. 66.54/35.82 [2019-03-28 12:46:47,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 66.54/35.82 [2019-03-28 12:46:47,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 66.54/35.82 [2019-03-28 12:46:47,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 66.54/35.82 [2019-03-28 12:46:47,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 66.54/35.82 [2019-03-28 12:46:47,750 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 66.54/35.82 [2019-03-28 12:46:47,750 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 66.54/35.82 [2019-03-28 12:46:47,750 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 66.54/35.82 [2019-03-28 12:46:47,750 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 66.54/35.82 [2019-03-28 12:46:47,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 66.54/35.82 [2019-03-28 12:46:47,750 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 66.54/35.82 [2019-03-28 12:46:47,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 66.54/35.82 [2019-03-28 12:46:47,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:47 BasicIcfg 66.54/35.82 [2019-03-28 12:46:47,757 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 66.54/35.82 [2019-03-28 12:46:47,757 INFO L168 Benchmark]: Toolchain (without parser) took 31423.99 ms. Allocated memory was 649.6 MB in the beginning and 974.7 MB in the end (delta: 325.1 MB). Free memory was 558.5 MB in the beginning and 539.2 MB in the end (delta: 19.4 MB). Peak memory consumption was 344.4 MB. Max. memory is 50.3 GB. 66.54/35.82 [2019-03-28 12:46:47,758 INFO L168 Benchmark]: CDTParser took 0.17 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. 66.54/35.82 [2019-03-28 12:46:47,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.16 ms. Allocated memory is still 649.6 MB. Free memory was 558.5 MB in the beginning and 615.7 MB in the end (delta: -57.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 66.54/35.82 [2019-03-28 12:46:47,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.00 ms. Allocated memory is still 649.6 MB. Free memory was 615.7 MB in the beginning and 612.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 66.54/35.82 [2019-03-28 12:46:47,759 INFO L168 Benchmark]: Boogie Preprocessor took 26.98 ms. Allocated memory is still 649.6 MB. Free memory was 612.6 MB in the beginning and 609.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 66.54/35.82 [2019-03-28 12:46:47,759 INFO L168 Benchmark]: RCFGBuilder took 299.17 ms. Allocated memory is still 649.6 MB. Free memory was 609.9 MB in the beginning and 587.8 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. 66.54/35.82 [2019-03-28 12:46:47,760 INFO L168 Benchmark]: BlockEncodingV2 took 132.00 ms. Allocated memory is still 649.6 MB. Free memory was 587.8 MB in the beginning and 578.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 66.54/35.82 [2019-03-28 12:46:47,760 INFO L168 Benchmark]: TraceAbstraction took 23792.95 ms. Allocated memory was 649.6 MB in the beginning and 928.0 MB in the end (delta: 278.4 MB). Free memory was 578.3 MB in the beginning and 722.6 MB in the end (delta: -144.2 MB). Peak memory consumption was 504.8 MB. Max. memory is 50.3 GB. 66.54/35.82 [2019-03-28 12:46:47,761 INFO L168 Benchmark]: BuchiAutomizer took 6795.35 ms. Allocated memory was 928.0 MB in the beginning and 974.7 MB in the end (delta: 46.7 MB). Free memory was 722.6 MB in the beginning and 539.2 MB in the end (delta: 183.4 MB). Peak memory consumption was 230.1 MB. Max. memory is 50.3 GB. 66.54/35.82 [2019-03-28 12:46:47,764 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 66.54/35.82 --- Results --- 66.54/35.82 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 66.54/35.82 - StatisticsResult: Initial Icfg 66.54/35.82 30 locations, 36 edges 66.54/35.82 - StatisticsResult: Encoded RCFG 66.54/35.82 21 locations, 38 edges 66.54/35.82 * Results from de.uni_freiburg.informatik.ultimate.core: 66.54/35.82 - StatisticsResult: Toolchain Benchmarks 66.54/35.82 Benchmark results are: 66.54/35.82 * CDTParser took 0.17 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. 66.54/35.82 * CACSL2BoogieTranslator took 329.16 ms. Allocated memory is still 649.6 MB. Free memory was 558.5 MB in the beginning and 615.7 MB in the end (delta: -57.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 66.54/35.82 * Boogie Procedure Inliner took 43.00 ms. Allocated memory is still 649.6 MB. Free memory was 615.7 MB in the beginning and 612.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 66.54/35.82 * Boogie Preprocessor took 26.98 ms. Allocated memory is still 649.6 MB. Free memory was 612.6 MB in the beginning and 609.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 66.54/35.82 * RCFGBuilder took 299.17 ms. Allocated memory is still 649.6 MB. Free memory was 609.9 MB in the beginning and 587.8 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. 66.54/35.82 * BlockEncodingV2 took 132.00 ms. Allocated memory is still 649.6 MB. Free memory was 587.8 MB in the beginning and 578.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 66.54/35.82 * TraceAbstraction took 23792.95 ms. Allocated memory was 649.6 MB in the beginning and 928.0 MB in the end (delta: 278.4 MB). Free memory was 578.3 MB in the beginning and 722.6 MB in the end (delta: -144.2 MB). Peak memory consumption was 504.8 MB. Max. memory is 50.3 GB. 66.54/35.82 * BuchiAutomizer took 6795.35 ms. Allocated memory was 928.0 MB in the beginning and 974.7 MB in the end (delta: 46.7 MB). Free memory was 722.6 MB in the beginning and 539.2 MB in the end (delta: 183.4 MB). Peak memory consumption was 230.1 MB. Max. memory is 50.3 GB. 66.54/35.82 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #memory_int 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 - GenericResult: Unfinished Backtranslation 66.54/35.82 unknown boogie variable #length 66.54/35.82 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 66.54/35.82 - PositiveResult [Line: 38]: pointer dereference always succeeds 66.54/35.82 For all program executions holds that pointer dereference always succeeds at this location 66.54/35.82 - PositiveResult [Line: 18]: pointer dereference always succeeds 66.54/35.82 For all program executions holds that pointer dereference always succeeds at this location 66.54/35.82 - PositiveResult [Line: 18]: pointer dereference always succeeds 66.54/35.82 For all program executions holds that pointer dereference always succeeds at this location 66.54/35.82 - PositiveResult [Line: 19]: pointer dereference always succeeds 66.54/35.82 For all program executions holds that pointer dereference always succeeds at this location 66.54/35.82 - PositiveResult [Line: 37]: pointer dereference always succeeds 66.54/35.82 For all program executions holds that pointer dereference always succeeds at this location 66.54/35.82 - PositiveResult [Line: 37]: pointer dereference always succeeds 66.54/35.82 For all program executions holds that pointer dereference always succeeds at this location 66.54/35.82 - PositiveResult [Line: 38]: pointer dereference always succeeds 66.54/35.82 For all program executions holds that pointer dereference always succeeds at this location 66.54/35.82 - PositiveResult [Line: 19]: pointer dereference always succeeds 66.54/35.82 For all program executions holds that pointer dereference always succeeds at this location 66.54/35.82 - AllSpecificationsHoldResult: All specifications hold 66.54/35.82 8 specifications checked. All of them hold 66.54/35.82 - InvariantResult [Line: 18]: Loop Invariant 66.54/35.82 [2019-03-28 12:46:47,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,779 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,779 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,779 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,779 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 Derived loop invariant: ((((0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1] && (((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0) && (0 == sc && 1 <= scanp) && ((((((((((((1 <= s1 && s2 == 0) && length1 == unknown-#length-unknown[nondetString1]) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 == \valid[scanp]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 == \valid[s2]) && 1 == \valid[s1]) && 1 == \valid[nondetString2]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[scanp][unknown-#length-unknown[scanp] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && scanp <= unknown-#length-unknown[scanp]) && !(nondetString1 == nondetString2)) && s1 + 1 <= unknown-#length-unknown[s1]) && unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1] == 0) || ((((((0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1] && nondetString1 == 0) && !(nondetString1 == nondetString2)) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && ((((((((((s2 == 0 && length1 == unknown-#length-unknown[nondetString1]) && 0 == s1) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && 1 == \valid[s1]) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 == \valid[nondetString2]) && unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1] == 0) 66.54/35.82 - InvariantResult [Line: 19]: Loop Invariant 66.54/35.82 [2019-03-28 12:46:47,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,815 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,815 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 66.54/35.82 [2019-03-28 12:46:47,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,825 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,825 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,825 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,825 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,826 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,826 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,826 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 [2019-03-28 12:46:47,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.54/35.82 [2019-03-28 12:46:47,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.54/35.82 Derived loop invariant: ((((0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1] && ((((((scanp + 1 <= unknown-#length-unknown[scanp] && 1 <= scanp) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[scanp][unknown-#length-unknown[scanp] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && (((((((((((((1 <= s1 && s2 == 0) && length1 == unknown-#length-unknown[nondetString1]) && (2 <= nondetString1 + unknown-#length-unknown[nondetString1] || (!(nondetString1 == nondetString2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]))) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 == \valid[scanp]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 == \valid[s2]) && 1 == \valid[s1]) && 1 == \valid[nondetString2]) && !(0 == sc)) || ((((((((s2 == 0 && (((((((((1 <= s1 && length1 == unknown-#length-unknown[nondetString1]) && 1 <= length2) && 1 == \valid[scanp]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && 1 == \valid[s2]) && 1 == \valid[s1]) && 1 == \valid[nondetString2]) && 0 == sc) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[scanp][unknown-#length-unknown[scanp] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && unknown-#length-unknown[nondetString2] == length2) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((0 == unknown-#memory_int-unknown[scanp][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[scanp]) && scanp <= ULTIMATE.start_main_~nondetString2~0.offset) && 1 <= ULTIMATE.start_main_~length2~0)) && scanp == 0))) && !(nondetString1 == nondetString2)) && s1 + 1 <= unknown-#length-unknown[s1]) && unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1] == 0) || (((((0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1] && !(nondetString1 == nondetString2)) && s1 + 1 <= unknown-#length-unknown[s1]) && s1 <= 1) && (((((((((((((((((1 <= s1 && s2 == 0) && length1 == unknown-#length-unknown[nondetString1]) && (2 <= nondetString1 + unknown-#length-unknown[nondetString1] || (!(nondetString1 == nondetString2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]))) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 == \valid[scanp]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 == \valid[s2]) && 1 == \valid[s1]) && 1 == \valid[nondetString2]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[scanp][unknown-#length-unknown[scanp] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((0 == unknown-#memory_int-unknown[scanp][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[scanp]) && scanp <= ULTIMATE.start_main_~nondetString2~0.offset) && 1 <= ULTIMATE.start_main_~length2~0)) && scanp == 0) && unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1] == 0) 66.54/35.82 - StatisticsResult: Ultimate Automizer benchmark data 66.54/35.82 CFG has 1 procedures, 21 locations, 8 error locations. SAFE Result, 23.6s OverallTime, 20 OverallIterations, 4 TraceHistogramMax, 15.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 124 SDtfs, 1324 SDslu, 881 SDs, 0 SdLazy, 1986 SolverSat, 405 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=17, 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.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 64 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 40 NumberOfFragments, 811 HoareAnnotationTreeSize, 2 FomulaSimplifications, 4765 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 2 FomulaSimplificationsInter, 23782 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 324 ConstructedInterpolants, 42 QuantifiedInterpolants, 62211 SizeOfPredicates, 78 NumberOfNonLiveVariables, 880 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 27 InterpolantComputations, 13 PerfectInterpolantSequences, 25/102 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 66.54/35.82 - StatisticsResult: Constructed decomposition of program 66.54/35.82 Your program was decomposed into 5 terminating modules (2 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[alloca(length1 * sizeof(char))] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length2 * sizeof(char))] + -1 * scanp and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length2 * sizeof(char))] + -1 * scanp and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. 66.54/35.82 - StatisticsResult: Timing statistics 66.54/35.82 BüchiAutomizer plugin needed 6.7s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 4.6s. Construction of modules took 0.4s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 56 SDtfs, 220 SDslu, 334 SDs, 0 SdLazy, 623 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax100 hnf100 lsp97 ukn81 mio100 lsp34 div100 bol100 ite100 ukn100 eq190 hnf88 smp100 dnf100 smp100 tf100 neg100 sie106 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 66.54/35.82 - TerminationAnalysisResult: Termination proven 66.54/35.82 Buchi Automizer proved that your program is terminating 66.54/35.82 RESULT: Ultimate proved your program to be correct! 66.54/35.82 !SESSION 2019-03-28 12:46:13.051 ----------------------------------------------- 66.54/35.82 eclipse.buildId=unknown 66.54/35.82 java.version=1.8.0_181 66.54/35.82 java.vendor=Oracle Corporation 66.54/35.82 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 66.54/35.82 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 66.54/35.82 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 66.54/35.82 66.54/35.82 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:46:48.063 66.54/35.82 !MESSAGE The workspace will exit with unsaved changes in this session. 66.54/35.82 Received shutdown request... 66.54/35.82 Ultimate: 66.54/35.82 GTK+ Version Check 66.54/35.82 EOF