YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 08:49:11,268 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 08:49:11,270 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 08:49:11,281 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 08:49:11,281 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 08:49:11,282 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 08:49:11,283 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 08:49:11,285 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 08:49:11,286 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 08:49:11,287 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 08:49:11,288 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 08:49:11,288 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 08:49:11,289 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 08:49:11,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 08:49:11,291 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 08:49:11,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 08:49:11,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 08:49:11,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 08:49:11,296 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 08:49:11,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 08:49:11,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 08:49:11,299 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 08:49:11,301 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 08:49:11,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 08:49:11,301 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 08:49:11,302 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 08:49:11,303 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 08:49:11,303 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 08:49:11,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 08:49:11,304 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 08:49:11,305 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 08:49:11,306 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 08:49:11,307 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 08:49:11,307 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 08:49:11,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 08:49:11,308 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 08:49:11,308 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 08:49:11,309 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 08:49:11,310 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 08:49:11,310 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 08:49:11,324 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 08:49:11,324 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 08:49:11,325 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 08:49:11,325 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 08:49:11,326 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 08:49:11,326 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:49:11,326 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 08:49:11,326 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 08:49:11,326 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 08:49:11,327 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 08:49:11,327 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 08:49:11,327 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 08:49:11,327 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 08:49:11,327 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 08:49:11,327 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:11,328 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 08:49:11,328 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 08:49:11,328 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 08:49:11,328 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 08:49:11,328 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 08:49:11,329 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 08:49:11,329 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 08:49:11,329 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 08:49:11,329 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 08:49:11,329 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:49:11,329 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 08:49:11,330 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 08:49:11,330 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 08:49:11,330 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 08:49:11,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 08:49:11,368 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 08:49:11,371 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 08:49:11,372 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 08:49:11,373 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 08:49:11,373 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 08:49:11,436 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/1f0c73fd492f4d85887caaa98f72f98e/FLAGb25044866 [2020-06-22 08:49:11,774 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 08:49:11,775 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 08:49:11,775 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 08:49:11,781 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/1f0c73fd492f4d85887caaa98f72f98e/FLAGb25044866 [2020-06-22 08:49:12,183 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/1f0c73fd492f4d85887caaa98f72f98e [2020-06-22 08:49:12,194 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 08:49:12,196 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 08:49:12,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 08:49:12,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 08:49:12,201 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 08:49:12,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:49:12" (1/1) ... [2020-06-22 08:49:12,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c2c7152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:12, skipping insertion in model container [2020-06-22 08:49:12,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:49:12" (1/1) ... [2020-06-22 08:49:12,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 08:49:12,232 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 08:49:12,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:49:12,462 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 08:49:12,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:49:12,500 INFO L195 MainTranslator]: Completed translation [2020-06-22 08:49:12,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:12 WrapperNode [2020-06-22 08:49:12,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 08:49:12,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 08:49:12,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 08:49:12,501 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 08:49:12,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:12" (1/1) ... [2020-06-22 08:49:12,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:12" (1/1) ... [2020-06-22 08:49:12,546 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 08:49:12,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 08:49:12,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 08:49:12,547 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 08:49:12,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:12" (1/1) ... [2020-06-22 08:49:12,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:12" (1/1) ... [2020-06-22 08:49:12,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:12" (1/1) ... [2020-06-22 08:49:12,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:12" (1/1) ... [2020-06-22 08:49:12,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:12" (1/1) ... [2020-06-22 08:49:12,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:12" (1/1) ... [2020-06-22 08:49:12,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:12" (1/1) ... [2020-06-22 08:49:12,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 08:49:12,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 08:49:12,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 08:49:12,575 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 08:49:12,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:12" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:49:12,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 08:49:12,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 08:49:12,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 08:49:12,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 08:49:12,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 08:49:12,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 08:49:12,978 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 08:49:12,979 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 08:49:12,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:49:12 BoogieIcfgContainer [2020-06-22 08:49:12,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 08:49:12,981 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 08:49:12,981 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 08:49:12,983 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 08:49:12,984 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:49:12" (1/1) ... [2020-06-22 08:49:13,000 INFO L313 BlockEncoder]: Initial Icfg 27 locations, 34 edges [2020-06-22 08:49:13,002 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 08:49:13,002 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 08:49:13,003 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 08:49:13,003 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:49:13,005 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 08:49:13,006 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 08:49:13,006 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 08:49:13,028 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 08:49:13,063 INFO L200 BlockEncoder]: SBE split 12 edges [2020-06-22 08:49:13,068 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 08:49:13,070 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:49:13,089 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-06-22 08:49:13,091 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 08:49:13,093 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 08:49:13,093 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:49:13,093 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 08:49:13,094 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 08:49:13,094 INFO L313 BlockEncoder]: Encoded RCFG 21 locations, 45 edges [2020-06-22 08:49:13,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:49:13 BasicIcfg [2020-06-22 08:49:13,095 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 08:49:13,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 08:49:13,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 08:49:13,099 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 08:49:13,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 08:49:12" (1/4) ... [2020-06-22 08:49:13,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc3f958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:49:13, skipping insertion in model container [2020-06-22 08:49:13,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:12" (2/4) ... [2020-06-22 08:49:13,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc3f958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:49:13, skipping insertion in model container [2020-06-22 08:49:13,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:49:12" (3/4) ... [2020-06-22 08:49:13,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc3f958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:49:13, skipping insertion in model container [2020-06-22 08:49:13,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:49:13" (4/4) ... [2020-06-22 08:49:13,103 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:49:13,113 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 08:49:13,121 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-06-22 08:49:13,137 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-06-22 08:49:13,166 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:49:13,166 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 08:49:13,166 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 08:49:13,167 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:49:13,167 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:49:13,167 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:49:13,167 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 08:49:13,167 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:49:13,167 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 08:49:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-06-22 08:49:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 08:49:13,188 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:13,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:13,189 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:13,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:13,194 INFO L82 PathProgramCache]: Analyzing trace with hash 476970010, now seen corresponding path program 1 times [2020-06-22 08:49:13,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:13,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:13,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:13,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:13,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:13,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:13,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:49:13,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:49:13,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:13,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:13,418 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2020-06-22 08:49:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:13,542 INFO L93 Difference]: Finished difference Result 21 states and 45 transitions. [2020-06-22 08:49:13,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:13,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-06-22 08:49:13,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:13,557 INFO L225 Difference]: With dead ends: 21 [2020-06-22 08:49:13,557 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 08:49:13,560 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 [2020-06-22 08:49:13,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 08:49:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 08:49:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 08:49:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 41 transitions. [2020-06-22 08:49:13,598 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 41 transitions. Word has length 7 [2020-06-22 08:49:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:13,600 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 41 transitions. [2020-06-22 08:49:13,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:49:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 41 transitions. [2020-06-22 08:49:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 08:49:13,601 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:13,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:13,601 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:13,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:13,601 INFO L82 PathProgramCache]: Analyzing trace with hash 476970012, now seen corresponding path program 1 times [2020-06-22 08:49:13,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:13,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:13,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:13,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:13,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:13,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:13,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:49:13,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:49:13,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:13,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:13,664 INFO L87 Difference]: Start difference. First operand 19 states and 41 transitions. Second operand 3 states. [2020-06-22 08:49:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:13,777 INFO L93 Difference]: Finished difference Result 36 states and 69 transitions. [2020-06-22 08:49:13,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:13,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-06-22 08:49:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:13,778 INFO L225 Difference]: With dead ends: 36 [2020-06-22 08:49:13,778 INFO L226 Difference]: Without dead ends: 34 [2020-06-22 08:49:13,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-06-22 08:49:13,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2020-06-22 08:49:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 08:49:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 61 transitions. [2020-06-22 08:49:13,786 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 61 transitions. Word has length 7 [2020-06-22 08:49:13,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:13,786 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 61 transitions. [2020-06-22 08:49:13,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:49:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 61 transitions. [2020-06-22 08:49:13,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 08:49:13,787 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:13,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:13,788 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:13,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:13,788 INFO L82 PathProgramCache]: Analyzing trace with hash 476970013, now seen corresponding path program 1 times [2020-06-22 08:49:13,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:13,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:13,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:13,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:13,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:13,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:13,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:49:13,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:49:13,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:49:13,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:49:13,853 INFO L87 Difference]: Start difference. First operand 26 states and 61 transitions. Second operand 4 states. [2020-06-22 08:49:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:13,988 INFO L93 Difference]: Finished difference Result 28 states and 61 transitions. [2020-06-22 08:49:13,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:49:13,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 08:49:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:13,990 INFO L225 Difference]: With dead ends: 28 [2020-06-22 08:49:13,990 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 08:49:13,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:49:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 08:49:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 08:49:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 08:49:13,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 57 transitions. [2020-06-22 08:49:13,996 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 57 transitions. Word has length 7 [2020-06-22 08:49:13,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:13,996 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 57 transitions. [2020-06-22 08:49:13,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:49:13,996 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 57 transitions. [2020-06-22 08:49:13,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 08:49:13,997 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:13,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:13,997 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:13,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:13,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1901167105, now seen corresponding path program 1 times [2020-06-22 08:49:13,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:13,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:13,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:13,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:13,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:14,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:14,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:14,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:49:14,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:49:14,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:14,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:14,042 INFO L87 Difference]: Start difference. First operand 26 states and 57 transitions. Second operand 3 states. [2020-06-22 08:49:14,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:14,106 INFO L93 Difference]: Finished difference Result 26 states and 57 transitions. [2020-06-22 08:49:14,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:14,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-06-22 08:49:14,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:14,107 INFO L225 Difference]: With dead ends: 26 [2020-06-22 08:49:14,107 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 08:49:14,108 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 [2020-06-22 08:49:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 08:49:14,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 08:49:14,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 08:49:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 53 transitions. [2020-06-22 08:49:14,113 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 53 transitions. Word has length 8 [2020-06-22 08:49:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:14,122 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 53 transitions. [2020-06-22 08:49:14,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:49:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 53 transitions. [2020-06-22 08:49:14,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 08:49:14,122 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:14,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:14,123 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:14,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:14,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1901167107, now seen corresponding path program 1 times [2020-06-22 08:49:14,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:14,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:14,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:14,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:14,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:14,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:14,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 08:49:14,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 08:49:14,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:49:14,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:49:14,198 INFO L87 Difference]: Start difference. First operand 25 states and 53 transitions. Second operand 5 states. [2020-06-22 08:49:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:14,344 INFO L93 Difference]: Finished difference Result 45 states and 92 transitions. [2020-06-22 08:49:14,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:49:14,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-06-22 08:49:14,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:14,367 INFO L225 Difference]: With dead ends: 45 [2020-06-22 08:49:14,367 INFO L226 Difference]: Without dead ends: 44 [2020-06-22 08:49:14,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:49:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-06-22 08:49:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2020-06-22 08:49:14,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 08:49:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 72 transitions. [2020-06-22 08:49:14,375 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 72 transitions. Word has length 8 [2020-06-22 08:49:14,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:14,375 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 72 transitions. [2020-06-22 08:49:14,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 08:49:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 72 transitions. [2020-06-22 08:49:14,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 08:49:14,376 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:14,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:14,376 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:14,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:14,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1192505773, now seen corresponding path program 1 times [2020-06-22 08:49:14,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:14,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:14,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:14,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:14,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:14,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:14,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:49:14,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:49:14,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:14,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:14,415 INFO L87 Difference]: Start difference. First operand 33 states and 72 transitions. Second operand 3 states. [2020-06-22 08:49:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:14,491 INFO L93 Difference]: Finished difference Result 33 states and 72 transitions. [2020-06-22 08:49:14,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:14,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-06-22 08:49:14,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:14,493 INFO L225 Difference]: With dead ends: 33 [2020-06-22 08:49:14,493 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 08:49:14,494 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 [2020-06-22 08:49:14,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 08:49:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-06-22 08:49:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 08:49:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 70 transitions. [2020-06-22 08:49:14,500 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 70 transitions. Word has length 9 [2020-06-22 08:49:14,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:14,500 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 70 transitions. [2020-06-22 08:49:14,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:49:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 70 transitions. [2020-06-22 08:49:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 08:49:14,501 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:14,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:14,502 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:14,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:14,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1192505771, now seen corresponding path program 1 times [2020-06-22 08:49:14,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:14,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:14,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:14,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:14,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:14,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:14,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 08:49:14,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 08:49:14,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:49:14,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:49:14,544 INFO L87 Difference]: Start difference. First operand 32 states and 70 transitions. Second operand 5 states. [2020-06-22 08:49:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:14,652 INFO L93 Difference]: Finished difference Result 61 states and 120 transitions. [2020-06-22 08:49:14,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:49:14,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-06-22 08:49:14,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:14,654 INFO L225 Difference]: With dead ends: 61 [2020-06-22 08:49:14,654 INFO L226 Difference]: Without dead ends: 42 [2020-06-22 08:49:14,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:49:14,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-06-22 08:49:14,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2020-06-22 08:49:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 08:49:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 68 transitions. [2020-06-22 08:49:14,660 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 68 transitions. Word has length 9 [2020-06-22 08:49:14,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:14,660 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 68 transitions. [2020-06-22 08:49:14,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 08:49:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 68 transitions. [2020-06-22 08:49:14,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 08:49:14,661 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:14,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:14,661 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:14,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:14,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1192475980, now seen corresponding path program 1 times [2020-06-22 08:49:14,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:14,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:14,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:14,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:14,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:14,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:14,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:49:14,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:49:14,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:14,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:14,689 INFO L87 Difference]: Start difference. First operand 32 states and 68 transitions. Second operand 3 states. [2020-06-22 08:49:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:14,757 INFO L93 Difference]: Finished difference Result 59 states and 125 transitions. [2020-06-22 08:49:14,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:14,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-06-22 08:49:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:14,759 INFO L225 Difference]: With dead ends: 59 [2020-06-22 08:49:14,759 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 08:49:14,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 08:49:14,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2020-06-22 08:49:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-06-22 08:49:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 76 transitions. [2020-06-22 08:49:14,767 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 76 transitions. Word has length 9 [2020-06-22 08:49:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:14,767 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 76 transitions. [2020-06-22 08:49:14,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:49:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 76 transitions. [2020-06-22 08:49:14,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 08:49:14,768 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:14,768 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:14,768 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:14,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:14,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2048783441, now seen corresponding path program 1 times [2020-06-22 08:49:14,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:14,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:14,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:14,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:14,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:14,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:49:14,833 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:49:14,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:14,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 08:49:14,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:14,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 08:49:14,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2020-06-22 08:49:14,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 08:49:14,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 08:49:14,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-06-22 08:49:14,967 INFO L87 Difference]: Start difference. First operand 38 states and 76 transitions. Second operand 9 states. [2020-06-22 08:49:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:15,211 INFO L93 Difference]: Finished difference Result 99 states and 185 transitions. [2020-06-22 08:49:15,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 08:49:15,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2020-06-22 08:49:15,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:15,213 INFO L225 Difference]: With dead ends: 99 [2020-06-22 08:49:15,213 INFO L226 Difference]: Without dead ends: 71 [2020-06-22 08:49:15,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-06-22 08:49:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-06-22 08:49:15,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-06-22 08:49:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-06-22 08:49:15,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 122 transitions. [2020-06-22 08:49:15,225 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 122 transitions. Word has length 12 [2020-06-22 08:49:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:15,226 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 122 transitions. [2020-06-22 08:49:15,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 08:49:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 122 transitions. [2020-06-22 08:49:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 08:49:15,227 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:15,227 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:15,227 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:15,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:15,228 INFO L82 PathProgramCache]: Analyzing trace with hash 56205486, now seen corresponding path program 1 times [2020-06-22 08:49:15,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:15,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:15,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:15,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:15,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:49:15,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:49:15,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:49:15,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:15,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjunts are in the unsatisfiable core [2020-06-22 08:49:15,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:15,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:49:15,403 INFO L340 Elim1Store]: treesize reduction 3, result has 92.9 percent of original size [2020-06-22 08:49:15,403 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 1 case distinctions, treesize of input 18 treesize of output 53 [2020-06-22 08:49:15,404 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:49:15,441 INFO L497 ElimStorePlain]: treesize reduction 27, result has 58.5 percent of original size [2020-06-22 08:49:15,446 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 08:49:15,447 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:38 [2020-06-22 08:49:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:49:15,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:49:15,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2020-06-22 08:49:15,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 08:49:15,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 08:49:15,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:49:15,902 INFO L87 Difference]: Start difference. First operand 61 states and 122 transitions. Second operand 6 states. [2020-06-22 08:49:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:16,249 INFO L93 Difference]: Finished difference Result 142 states and 255 transitions. [2020-06-22 08:49:16,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 08:49:16,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-06-22 08:49:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:16,251 INFO L225 Difference]: With dead ends: 142 [2020-06-22 08:49:16,252 INFO L226 Difference]: Without dead ends: 141 [2020-06-22 08:49:16,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-06-22 08:49:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-06-22 08:49:16,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 61. [2020-06-22 08:49:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-06-22 08:49:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 120 transitions. [2020-06-22 08:49:16,268 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 120 transitions. Word has length 12 [2020-06-22 08:49:16,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:16,268 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 120 transitions. [2020-06-22 08:49:16,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 08:49:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 120 transitions. [2020-06-22 08:49:16,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 08:49:16,269 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:16,269 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:16,269 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:16,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:16,270 INFO L82 PathProgramCache]: Analyzing trace with hash 56205487, now seen corresponding path program 1 times [2020-06-22 08:49:16,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:16,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:16,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:16,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:16,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:16,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:16,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:49:16,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:49:16,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:49:16,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:49:16,306 INFO L87 Difference]: Start difference. First operand 61 states and 120 transitions. Second operand 4 states. [2020-06-22 08:49:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:16,403 INFO L93 Difference]: Finished difference Result 85 states and 152 transitions. [2020-06-22 08:49:16,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:49:16,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-06-22 08:49:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:16,404 INFO L225 Difference]: With dead ends: 85 [2020-06-22 08:49:16,405 INFO L226 Difference]: Without dead ends: 84 [2020-06-22 08:49:16,405 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 [2020-06-22 08:49:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-06-22 08:49:16,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 60. [2020-06-22 08:49:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-06-22 08:49:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 118 transitions. [2020-06-22 08:49:16,418 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 118 transitions. Word has length 12 [2020-06-22 08:49:16,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:16,418 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 118 transitions. [2020-06-22 08:49:16,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:49:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 118 transitions. [2020-06-22 08:49:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-06-22 08:49:16,419 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:16,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:16,419 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:16,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:16,420 INFO L82 PathProgramCache]: Analyzing trace with hash 850309188, now seen corresponding path program 1 times [2020-06-22 08:49:16,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:16,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:16,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:16,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:16,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:16,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:16,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:49:16,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:49:16,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:16,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:16,443 INFO L87 Difference]: Start difference. First operand 60 states and 118 transitions. Second operand 3 states. [2020-06-22 08:49:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:16,515 INFO L93 Difference]: Finished difference Result 115 states and 215 transitions. [2020-06-22 08:49:16,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:16,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-06-22 08:49:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:16,516 INFO L225 Difference]: With dead ends: 115 [2020-06-22 08:49:16,517 INFO L226 Difference]: Without dead ends: 64 [2020-06-22 08:49:16,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-06-22 08:49:16,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2020-06-22 08:49:16,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-06-22 08:49:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 92 transitions. [2020-06-22 08:49:16,528 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 92 transitions. Word has length 13 [2020-06-22 08:49:16,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:16,528 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 92 transitions. [2020-06-22 08:49:16,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:49:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 92 transitions. [2020-06-22 08:49:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-06-22 08:49:16,529 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:16,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:16,529 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:16,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:16,530 INFO L82 PathProgramCache]: Analyzing trace with hash 913078825, now seen corresponding path program 1 times [2020-06-22 08:49:16,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:16,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:16,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:16,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:16,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:49:16,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:16,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:49:16,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:49:16,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:49:16,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:49:16,578 INFO L87 Difference]: Start difference. First operand 55 states and 92 transitions. Second operand 4 states. [2020-06-22 08:49:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:16,674 INFO L93 Difference]: Finished difference Result 86 states and 137 transitions. [2020-06-22 08:49:16,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:49:16,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-06-22 08:49:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:16,675 INFO L225 Difference]: With dead ends: 86 [2020-06-22 08:49:16,675 INFO L226 Difference]: Without dead ends: 85 [2020-06-22 08:49:16,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:49:16,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-06-22 08:49:16,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2020-06-22 08:49:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-06-22 08:49:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2020-06-22 08:49:16,691 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 133 transitions. Word has length 13 [2020-06-22 08:49:16,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:16,691 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 133 transitions. [2020-06-22 08:49:16,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:49:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 133 transitions. [2020-06-22 08:49:16,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 08:49:16,692 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:16,692 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:16,692 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:16,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:16,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1093284000, now seen corresponding path program 1 times [2020-06-22 08:49:16,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:16,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:16,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:16,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:16,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:16,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:16,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:49:16,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:49:16,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:49:16,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:49:16,731 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. Second operand 4 states. [2020-06-22 08:49:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:16,822 INFO L93 Difference]: Finished difference Result 94 states and 145 transitions. [2020-06-22 08:49:16,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:49:16,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-06-22 08:49:16,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:16,824 INFO L225 Difference]: With dead ends: 94 [2020-06-22 08:49:16,824 INFO L226 Difference]: Without dead ends: 92 [2020-06-22 08:49:16,824 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 [2020-06-22 08:49:16,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-06-22 08:49:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2020-06-22 08:49:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-06-22 08:49:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 97 transitions. [2020-06-22 08:49:16,836 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 97 transitions. Word has length 15 [2020-06-22 08:49:16,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:16,837 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 97 transitions. [2020-06-22 08:49:16,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:49:16,837 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 97 transitions. [2020-06-22 08:49:16,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-06-22 08:49:16,838 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:16,838 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:16,838 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:16,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:16,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1053080210, now seen corresponding path program 1 times [2020-06-22 08:49:16,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:16,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:16,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:16,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:16,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:49:16,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:49:16,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:49:16,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:17,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2020-06-22 08:49:17,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:17,051 INFO L340 Elim1Store]: treesize reduction 30, result has 53.8 percent of original size [2020-06-22 08:49:17,052 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 2 case distinctions, treesize of input 18 treesize of output 42 [2020-06-22 08:49:17,052 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:49:17,091 INFO L497 ElimStorePlain]: treesize reduction 12, result has 77.8 percent of original size [2020-06-22 08:49:17,094 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 08:49:17,094 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:40 [2020-06-22 08:49:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 08:49:17,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:49:17,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2020-06-22 08:49:17,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-06-22 08:49:17,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-06-22 08:49:17,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-06-22 08:49:17,263 INFO L87 Difference]: Start difference. First operand 62 states and 97 transitions. Second operand 12 states. [2020-06-22 08:49:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:17,952 INFO L93 Difference]: Finished difference Result 130 states and 183 transitions. [2020-06-22 08:49:17,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-06-22 08:49:17,953 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-06-22 08:49:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:17,954 INFO L225 Difference]: With dead ends: 130 [2020-06-22 08:49:17,954 INFO L226 Difference]: Without dead ends: 129 [2020-06-22 08:49:17,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2020-06-22 08:49:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-06-22 08:49:17,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 62. [2020-06-22 08:49:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-06-22 08:49:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2020-06-22 08:49:17,968 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 23 [2020-06-22 08:49:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:17,968 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2020-06-22 08:49:17,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-06-22 08:49:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2020-06-22 08:49:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-06-22 08:49:17,969 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:17,969 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:17,969 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:49:17,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1053080211, now seen corresponding path program 1 times [2020-06-22 08:49:17,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:17,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:17,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:17,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:17,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 08:49:18,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:18,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:49:18,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:49:18,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:18,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:18,001 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand 3 states. [2020-06-22 08:49:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:18,062 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2020-06-22 08:49:18,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:18,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-06-22 08:49:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:18,063 INFO L225 Difference]: With dead ends: 62 [2020-06-22 08:49:18,063 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 08:49:18,064 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 [2020-06-22 08:49:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 08:49:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 08:49:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 08:49:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 08:49:18,065 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-06-22 08:49:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:18,065 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:49:18,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:49:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:49:18,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 08:49:18,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 08:49:18,231 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 162 [2020-06-22 08:49:18,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 08:49:18,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 08:49:18,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 08:49:18,484 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 208 [2020-06-22 08:49:19,218 WARN L188 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 72 [2020-06-22 08:49:24,228 WARN L188 SmtUtils]: Spent 5.01 s on a formula simplification. DAG size of input: 205 DAG size of output: 94 [2020-06-22 08:49:24,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 08:49:24,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 08:49:24,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 08:49:24,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 08:49:24,232 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 26) no Hoare annotation was computed. [2020-06-22 08:49:24,232 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2020-06-22 08:49:24,232 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-06-22 08:49:24,232 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 17 21) no Hoare annotation was computed. [2020-06-22 08:49:24,233 INFO L444 ceAbstractionStarter]: At program point L17-4(lines 16 22) the Hoare annotation is: (let ((.cse34 (select |#length| ULTIMATE.start_diff_~B.base)) (.cse30 (* 4 ULTIMATE.start_diff_~l1~0)) (.cse35 (select |#length| ULTIMATE.start_diff_~A.base)) (.cse31 (* 4 ULTIMATE.start_diff_~i~0))) (let ((.cse27 (* 4 ULTIMATE.start_diff_~k~0)) (.cse21 (= 0 ULTIMATE.start_diff_~j~0)) (.cse7 (= 0 ULTIMATE.start_diff_~A.offset)) (.cse29 (+ .cse31 ULTIMATE.start_diff_~A.offset)) (.cse28 (select |#length| ULTIMATE.start_diff_~D.base)) (.cse17 (= 0 ULTIMATE.start_diff_~found~0)) (.cse16 (<= .cse30 .cse35)) (.cse19 (<= (+ .cse31 4) .cse35)) (.cse20 (= (select |#valid| ULTIMATE.start_diff_~A.base) 1)) (.cse22 (<= (* 4 ULTIMATE.start_diff_~l2~0) .cse34)) (.cse18 (<= 1 ULTIMATE.start_main_~Blen~0)) (.cse23 (= 1 (select |#valid| ULTIMATE.start_diff_~D.base))) (.cse24 (= 0 ULTIMATE.start_diff_~B.offset)) (.cse33 (* 4 ULTIMATE.start_diff_~j~0)) (.cse25 (= 1 (select |#valid| ULTIMATE.start_diff_~B.base))) (.cse26 (<= 1 ULTIMATE.start_diff_~l2~0))) (let ((.cse2 (and .cse16 .cse19 .cse20 .cse22 .cse18 .cse23 .cse24 (<= (+ .cse33 4) .cse34) .cse25 .cse26)) (.cse14 (and .cse16 .cse19 .cse20 .cse17 .cse22 .cse18 .cse23 .cse24 .cse25 .cse26)) (.cse5 (<= 4 (+ .cse33 ULTIMATE.start_diff_~B.offset))) (.cse0 (<= 4 .cse28)) (.cse4 (<= 0 .cse29)) (.cse8 (= 0 ULTIMATE.start_diff_~k~0)) (.cse9 (exists ((v_prenex_1 Int) (|ULTIMATE.start_main_#t~malloc8.base| Int)) (let ((.cse32 (* 4 v_prenex_1))) (and (<= ULTIMATE.start_diff_~l1~0 v_prenex_1) (= .cse32 (select |#length| |ULTIMATE.start_main_#t~malloc8.base|)) (= .cse32 (select |#length| ULTIMATE.start_diff_~D.base)))))) (.cse15 (and .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse7 .cse26)) (.cse1 (= 1 ULTIMATE.start_diff_~found~0)) (.cse10 (<= (+ .cse27 .cse30) (+ .cse31 ULTIMATE.start_diff_~A.offset .cse28))) (.cse11 (<= 4 .cse29)) (.cse3 (<= 1 ULTIMATE.start_main_~Alen~0)) (.cse6 (= 0 ULTIMATE.start_diff_~D.offset)) (.cse12 (<= (+ .cse27 4) (+ ULTIMATE.start_diff_~A.offset .cse28))) (.cse13 (<= 4 (+ .cse27 ULTIMATE.start_diff_~D.offset)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9) (and (and .cse1 .cse10 .cse2 .cse11 .cse3 .cse6 .cse12 .cse7 .cse5) .cse13) (and (and .cse10 .cse11 .cse14 .cse3 .cse6 .cse12 .cse7 .cse5) .cse13) (and .cse6 .cse7 (and .cse0 .cse14 .cse3 .cse4 .cse5) .cse8 .cse9) (and (and .cse15 .cse0 .cse1 .cse3 .cse4 .cse6 .cse8) .cse9) (and .cse6 .cse7 (and .cse0 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) .cse3 .cse4) .cse8 .cse9) (and (and .cse15 .cse1 .cse10 .cse11 .cse3 .cse6 .cse12) .cse13) (and (and .cse10 .cse11 .cse3 .cse6 (and .cse16 .cse19 .cse20 .cse21 .cse17 .cse22 .cse18 .cse23 .cse24 .cse25 .cse26) .cse12 .cse7) .cse13))))) [2020-06-22 08:49:24,233 INFO L444 ceAbstractionStarter]: At program point L13-2(lines 13 28) the Hoare annotation is: (let ((.cse1 (* 4 ULTIMATE.start_diff_~l1~0))) (let ((.cse11 (<= (* 4 ULTIMATE.start_diff_~l2~0) (select |#length| ULTIMATE.start_diff_~B.base))) (.cse9 (<= .cse1 (select |#length| ULTIMATE.start_diff_~A.base))) (.cse10 (= (select |#valid| ULTIMATE.start_diff_~A.base) 1)) (.cse12 (<= 1 ULTIMATE.start_main_~Blen~0)) (.cse13 (= 1 (select |#valid| ULTIMATE.start_diff_~D.base))) (.cse14 (= 0 ULTIMATE.start_diff_~B.offset)) (.cse15 (= 1 (select |#valid| ULTIMATE.start_diff_~B.base))) (.cse16 (<= 1 ULTIMATE.start_diff_~l2~0)) (.cse2 (* 4 ULTIMATE.start_diff_~i~0))) (let ((.cse7 (= 0 ULTIMATE.start_diff_~D.offset)) (.cse8 (= 0 ULTIMATE.start_diff_~A.offset)) (.cse4 (<= 4 (+ .cse2 ULTIMATE.start_diff_~A.offset))) (.cse5 (<= 1 ULTIMATE.start_main_~Alen~0)) (.cse6 (and (and .cse11 (and .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16)) (<= 0 (+ (* 4 ULTIMATE.start_diff_~j~0) ULTIMATE.start_diff_~B.offset)))) (.cse3 (select |#length| ULTIMATE.start_diff_~D.base))) (or (let ((.cse0 (* 4 ULTIMATE.start_diff_~k~0))) (and (and (<= (+ .cse0 .cse1) (+ .cse2 ULTIMATE.start_diff_~A.offset .cse3)) .cse4 .cse5 .cse6 .cse7 .cse8) (<= 4 (+ .cse0 ULTIMATE.start_diff_~D.offset)))) (and .cse7 .cse8 (let ((.cse17 (<= 4 .cse3))) (or (and (and .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ULTIMATE.start_diff_~i~0) .cse14 .cse15 .cse16) .cse17 .cse5) (and .cse17 .cse4 .cse5 .cse6))) (= 0 ULTIMATE.start_diff_~k~0) (exists ((v_prenex_1 Int) (|ULTIMATE.start_main_#t~malloc8.base| Int)) (let ((.cse18 (* 4 v_prenex_1))) (and (<= ULTIMATE.start_diff_~l1~0 v_prenex_1) (= .cse18 (select |#length| |ULTIMATE.start_main_#t~malloc8.base|)) (= .cse18 (select |#length| ULTIMATE.start_diff_~D.base)))))))))) [2020-06-22 08:49:24,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 08:49:24,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 08:49:24,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 08:49:24,233 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2020-06-22 08:49:24,234 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 08:49:24,234 INFO L448 ceAbstractionStarter]: For program point L34-2(lines 31 45) no Hoare annotation was computed. [2020-06-22 08:49:24,234 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 08:49:24,234 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2020-06-22 08:49:24,234 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2020-06-22 08:49:24,234 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 13 28) no Hoare annotation was computed. [2020-06-22 08:49:24,234 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 37 39) no Hoare annotation was computed. [2020-06-22 08:49:24,235 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 08:49:24,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:24,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,255 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,255 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,255 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,256 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,256 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,256 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:24,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,269 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,269 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:24,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:24,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:24,276 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,276 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,276 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,276 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:24,277 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,289 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,289 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,289 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,289 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,290 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,290 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,290 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,290 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,290 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,293 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,293 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:24,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:24,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:24,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:24,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:24,300 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,300 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,300 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:49:24 BasicIcfg [2020-06-22 08:49:24,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 08:49:24,314 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 08:49:24,314 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 08:49:24,317 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 08:49:24,318 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:49:24,318 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 08:49:12" (1/5) ... [2020-06-22 08:49:24,319 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18d21341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:49:24, skipping insertion in model container [2020-06-22 08:49:24,319 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:49:24,319 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:12" (2/5) ... [2020-06-22 08:49:24,320 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18d21341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:49:24, skipping insertion in model container [2020-06-22 08:49:24,320 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:49:24,320 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:49:12" (3/5) ... [2020-06-22 08:49:24,320 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18d21341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:49:24, skipping insertion in model container [2020-06-22 08:49:24,320 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:49:24,320 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:49:13" (4/5) ... [2020-06-22 08:49:24,320 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18d21341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:49:24, skipping insertion in model container [2020-06-22 08:49:24,321 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:49:24,321 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:49:24" (5/5) ... [2020-06-22 08:49:24,322 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:49:24,343 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:49:24,343 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 08:49:24,343 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 08:49:24,343 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:49:24,344 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:49:24,344 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:49:24,344 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 08:49:24,344 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:49:24,344 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 08:49:24,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-06-22 08:49:24,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 08:49:24,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:24,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:24,357 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:49:24,357 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 08:49:24,357 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 08:49:24,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-06-22 08:49:24,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 08:49:24,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:24,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:24,359 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:49:24,359 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 08:49:24,364 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 18#L34true [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 14#L34-2true [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 23#L37-1true [126] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 15#L13-2true [2020-06-22 08:49:24,364 INFO L796 eck$LassoCheckResult]: Loop: 15#L13-2true [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 19#L17-4true [128] L17-4-->L16-2: Formula: (>= v_ULTIMATE.start_diff_~j~0_3 v_ULTIMATE.start_diff_~l2~0_3) InVars {ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_3} OutVars{ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_3} AuxVars[] AssignedVars[] 21#L16-2true [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 16#L23-1true [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 15#L13-2true [2020-06-22 08:49:24,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:24,365 INFO L82 PathProgramCache]: Analyzing trace with hash 5467627, now seen corresponding path program 1 times [2020-06-22 08:49:24,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:24,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:24,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:24,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:24,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:24,397 INFO L82 PathProgramCache]: Analyzing trace with hash 3761614, now seen corresponding path program 1 times [2020-06-22 08:49:24,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:24,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:24,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:24,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:24,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:24,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:49:24,406 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 08:49:24,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:24,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:24,408 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2020-06-22 08:49:24,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:24,477 INFO L93 Difference]: Finished difference Result 25 states and 52 transitions. [2020-06-22 08:49:24,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:24,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 52 transitions. [2020-06-22 08:49:24,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-06-22 08:49:24,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 36 transitions. [2020-06-22 08:49:24,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 08:49:24,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 08:49:24,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 36 transitions. [2020-06-22 08:49:24,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:49:24,484 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 36 transitions. [2020-06-22 08:49:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 36 transitions. [2020-06-22 08:49:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2020-06-22 08:49:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 08:49:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 34 transitions. [2020-06-22 08:49:24,487 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 34 transitions. [2020-06-22 08:49:24,487 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 34 transitions. [2020-06-22 08:49:24,487 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 08:49:24,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 34 transitions. [2020-06-22 08:49:24,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 08:49:24,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:24,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:24,488 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:49:24,488 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 08:49:24,489 INFO L794 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 63#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 60#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 61#L37-1 [126] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 64#L13-2 [2020-06-22 08:49:24,489 INFO L796 eck$LassoCheckResult]: Loop: 64#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 57#L17-4 [128] L17-4-->L16-2: Formula: (>= v_ULTIMATE.start_diff_~j~0_3 v_ULTIMATE.start_diff_~l2~0_3) InVars {ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_3} OutVars{ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_3} AuxVars[] AssignedVars[] 67#L16-2 [131] L16-2-->L23-1: Formula: (> 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 65#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 64#L13-2 [2020-06-22 08:49:24,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:24,489 INFO L82 PathProgramCache]: Analyzing trace with hash 5467627, now seen corresponding path program 2 times [2020-06-22 08:49:24,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:24,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:24,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:24,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:24,503 INFO L82 PathProgramCache]: Analyzing trace with hash 3761645, now seen corresponding path program 1 times [2020-06-22 08:49:24,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:24,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:24,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:24,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:24,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:24,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:49:24,511 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 08:49:24,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:24,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:24,512 INFO L87 Difference]: Start difference. First operand 15 states and 34 transitions. cyclomatic complexity: 20 Second operand 3 states. [2020-06-22 08:49:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:24,556 INFO L93 Difference]: Finished difference Result 16 states and 31 transitions. [2020-06-22 08:49:24,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:24,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 31 transitions. [2020-06-22 08:49:24,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 08:49:24,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 31 transitions. [2020-06-22 08:49:24,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-06-22 08:49:24,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-06-22 08:49:24,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 31 transitions. [2020-06-22 08:49:24,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:49:24,559 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 31 transitions. [2020-06-22 08:49:24,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 31 transitions. [2020-06-22 08:49:24,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-06-22 08:49:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 08:49:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 30 transitions. [2020-06-22 08:49:24,560 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 30 transitions. [2020-06-22 08:49:24,560 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 30 transitions. [2020-06-22 08:49:24,560 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 08:49:24,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 30 transitions. [2020-06-22 08:49:24,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 08:49:24,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:24,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:24,562 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:49:24,562 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:49:24,562 INFO L794 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 98#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 99#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 100#L37-1 [126] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 101#L13-2 [2020-06-22 08:49:24,563 INFO L796 eck$LassoCheckResult]: Loop: 101#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 94#L17-4 [128] L17-4-->L16-2: Formula: (>= v_ULTIMATE.start_diff_~j~0_3 v_ULTIMATE.start_diff_~l2~0_3) InVars {ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_3} OutVars{ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_3} AuxVars[] AssignedVars[] 104#L16-2 [78] L16-2-->L24: Formula: (= 0 v_ULTIMATE.start_diff_~found~0_7) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_7} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_7} AuxVars[] AssignedVars[] 105#L24 [100] L24-->L24-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_7))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_5))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_5 4) (select |v_#length_9| v_ULTIMATE.start_diff_~A.base_6)) (= (select |v_#valid_15| v_ULTIMATE.start_diff_~A.base_6) 1) (<= 0 .cse1) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_diff_~A.base_6) .cse1) |v_ULTIMATE.start_diff_#t~mem3_2|)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_7, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_6, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_3|, #length=|v_#length_9|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_5} OutVars{ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_7, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_6, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_3|, #length=|v_#length_9|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_5, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem3] 103#L24-1 [154] L24-1-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~k~0_8))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_diff_~D.offset_5))) (and (= (store |v_#memory_int_7| v_ULTIMATE.start_diff_~D.base_6 (store (select |v_#memory_int_7| v_ULTIMATE.start_diff_~D.base_6) .cse0 |v_ULTIMATE.start_diff_#t~mem3_6|)) |v_#memory_int_6|) (= (select |v_#valid_27| v_ULTIMATE.start_diff_~D.base_6) 1) (<= (+ .cse1 v_ULTIMATE.start_diff_~D.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_diff_~D.base_6)) (<= 0 .cse0) (= v_ULTIMATE.start_diff_~k~0_7 (+ v_ULTIMATE.start_diff_~k~0_8 1))))) InVars {ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_5, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_6, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_8, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_6|} OutVars{ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_5, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_6, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_7, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~k~0, #memory_int, ULTIMATE.start_diff_#t~mem3] 102#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 101#L13-2 [2020-06-22 08:49:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:24,563 INFO L82 PathProgramCache]: Analyzing trace with hash 5467627, now seen corresponding path program 3 times [2020-06-22 08:49:24,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:24,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:24,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:24,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:24,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:24,577 INFO L82 PathProgramCache]: Analyzing trace with hash -681575540, now seen corresponding path program 1 times [2020-06-22 08:49:24,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:24,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:24,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:24,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:24,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:24,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1864356342, now seen corresponding path program 1 times [2020-06-22 08:49:24,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:24,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:24,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:24,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:24,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:24,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 08:49:24,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:49:24,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:49:24,695 INFO L87 Difference]: Start difference. First operand 15 states and 30 transitions. cyclomatic complexity: 16 Second operand 5 states. [2020-06-22 08:49:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:24,766 INFO L93 Difference]: Finished difference Result 25 states and 44 transitions. [2020-06-22 08:49:24,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:49:24,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 44 transitions. [2020-06-22 08:49:24,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-06-22 08:49:24,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 44 transitions. [2020-06-22 08:49:24,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-06-22 08:49:24,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-06-22 08:49:24,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 44 transitions. [2020-06-22 08:49:24,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:49:24,769 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 44 transitions. [2020-06-22 08:49:24,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 44 transitions. [2020-06-22 08:49:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2020-06-22 08:49:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 08:49:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 38 transitions. [2020-06-22 08:49:24,770 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 38 transitions. [2020-06-22 08:49:24,770 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 38 transitions. [2020-06-22 08:49:24,770 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 08:49:24,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 38 transitions. [2020-06-22 08:49:24,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 08:49:24,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:24,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:24,771 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:49:24,772 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:24,772 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 152#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 153#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 154#L37-1 [126] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 155#L13-2 [2020-06-22 08:49:24,773 INFO L796 eck$LassoCheckResult]: Loop: 155#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 156#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 159#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 165#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 164#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 163#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 162#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 157#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 155#L13-2 [2020-06-22 08:49:24,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:24,773 INFO L82 PathProgramCache]: Analyzing trace with hash 5467627, now seen corresponding path program 4 times [2020-06-22 08:49:24,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:24,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:24,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:24,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 1 times [2020-06-22 08:49:24,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:24,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:24,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:24,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:24,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:24,794 INFO L82 PathProgramCache]: Analyzing trace with hash 858910439, now seen corresponding path program 1 times [2020-06-22 08:49:24,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:24,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:24,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:24,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:25,348 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 [2020-06-22 08:49:25,558 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-06-22 08:49:25,572 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:25,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:25,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:25,573 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:25,573 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:49:25,574 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:49:25,574 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:25,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:25,574 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 08:49:25,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:25,574 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:25,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:25,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:25,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:25,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:25,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:25,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:25,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:25,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:25,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:25,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:25,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:25,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:25,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:25,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:25,982 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2020-06-22 08:49:26,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:26,525 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:26,531 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:49:26,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:26,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:26,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:26,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:26,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:26,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:26,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:26,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:26,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:26,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:26,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:26,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:26,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:26,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:26,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:26,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:26,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:26,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:26,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:26,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:26,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:26,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:26,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:26,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:26,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:26,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:26,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:26,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:26,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:26,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:26,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:26,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:26,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:26,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:26,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:26,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:26,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:26,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:26,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:26,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:26,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:26,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:26,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:26,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:26,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:26,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:26,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:26,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:26,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:26,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:26,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:26,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:26,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:26,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:26,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:26,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:26,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:26,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:26,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:26,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:26,683 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:49:26,696 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 08:49:26,696 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 08:49:26,699 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:49:26,700 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:49:26,700 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:49:26,700 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 Supporting invariants [] [2020-06-22 08:49:26,744 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2020-06-22 08:49:26,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:26,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:49:26,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:26,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:26,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:26,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:49:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:26,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:26,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:26,898 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 08:49:26,902 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 08:49:26,903 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 38 transitions. cyclomatic complexity: 19 Second operand 3 states. [2020-06-22 08:49:26,982 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 38 transitions. cyclomatic complexity: 19. Second operand 3 states. Result 52 states and 89 transitions. Complement of second has 4 states. [2020-06-22 08:49:26,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 08:49:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 08:49:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-06-22 08:49:26,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 08:49:26,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:26,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 8 letters. [2020-06-22 08:49:26,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:26,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 16 letters. [2020-06-22 08:49:26,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:27,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 89 transitions. [2020-06-22 08:49:27,015 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2020-06-22 08:49:27,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 47 states and 80 transitions. [2020-06-22 08:49:27,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-06-22 08:49:27,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-06-22 08:49:27,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 80 transitions. [2020-06-22 08:49:27,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:49:27,016 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-06-22 08:49:27,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 80 transitions. [2020-06-22 08:49:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2020-06-22 08:49:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 08:49:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. [2020-06-22 08:49:27,018 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-06-22 08:49:27,018 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-06-22 08:49:27,018 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 08:49:27,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 72 transitions. [2020-06-22 08:49:27,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 08:49:27,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:27,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:27,021 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:49:27,021 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:27,022 INFO L794 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 368#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 369#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 370#L37-1 [125] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 375#L13-2 [2020-06-22 08:49:27,023 INFO L796 eck$LassoCheckResult]: Loop: 375#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 395#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 389#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 393#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 391#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 388#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 384#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 374#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 375#L13-2 [2020-06-22 08:49:27,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:27,023 INFO L82 PathProgramCache]: Analyzing trace with hash 5467626, now seen corresponding path program 1 times [2020-06-22 08:49:27,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:27,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:27,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:27,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:27,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:27,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:27,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 2 times [2020-06-22 08:49:27,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:27,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:27,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:27,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:27,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:27,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1628602394, now seen corresponding path program 1 times [2020-06-22 08:49:27,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:27,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:27,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:27,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:27,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:27,649 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 [2020-06-22 08:49:27,893 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-06-22 08:49:27,896 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:27,896 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:27,896 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:27,896 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:27,896 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:49:27,896 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:49:27,896 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:27,897 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:27,897 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 08:49:27,897 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:27,897 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:27,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:27,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:27,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:27,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:28,341 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2020-06-22 08:49:28,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:28,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:28,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:28,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:28,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:28,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:28,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:28,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:28,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:28,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:28,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:29,072 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:29,072 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:49:29,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:29,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:29,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:29,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:29,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:29,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:29,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:29,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:29,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:29,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:29,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:29,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:29,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:29,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:29,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:29,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:29,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:29,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:29,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:29,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:29,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:29,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:29,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:29,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:29,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:29,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:29,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:29,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:29,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:29,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:29,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:29,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:29,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:29,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:29,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:29,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:29,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:29,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:29,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:29,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:29,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:29,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:29,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:29,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:29,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:29,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:29,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:29,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:29,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:29,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:29,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:29,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:29,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:29,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:29,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:29,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:29,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:29,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:29,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:29,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:29,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:29,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:29,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:29,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:29,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:29,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:29,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:29,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:29,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:29,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:29,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:29,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:29,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:29,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:29,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:29,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:29,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:29,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:29,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:29,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:29,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:29,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:29,143 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:49:29,167 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 08:49:29,167 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2020-06-22 08:49:29,167 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:49:29,168 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:49:29,168 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:49:29,169 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 Supporting invariants [] [2020-06-22 08:49:29,211 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2020-06-22 08:49:29,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:29,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:49:29,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:29,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:29,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:49:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:29,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:29,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:29,364 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 08:49:29,365 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 08:49:29,365 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34 Second operand 3 states. [2020-06-22 08:49:29,436 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34. Second operand 3 states. Result 73 states and 123 transitions. Complement of second has 4 states. [2020-06-22 08:49:29,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 08:49:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 08:49:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-06-22 08:49:29,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 08:49:29,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:29,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 8 letters. [2020-06-22 08:49:29,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:29,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 16 letters. [2020-06-22 08:49:29,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:29,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 123 transitions. [2020-06-22 08:49:29,446 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2020-06-22 08:49:29,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 114 transitions. [2020-06-22 08:49:29,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-06-22 08:49:29,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-06-22 08:49:29,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 114 transitions. [2020-06-22 08:49:29,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:49:29,447 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 114 transitions. [2020-06-22 08:49:29,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 114 transitions. [2020-06-22 08:49:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. [2020-06-22 08:49:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 08:49:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. [2020-06-22 08:49:29,449 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-06-22 08:49:29,449 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-06-22 08:49:29,450 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 08:49:29,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 72 transitions. [2020-06-22 08:49:29,450 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 08:49:29,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:29,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:29,451 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:49:29,451 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:29,452 INFO L794 eck$LassoCheckResult]: Stem: 621#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 622#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 623#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 624#L37-1 [124] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 629#L13-2 [2020-06-22 08:49:29,452 INFO L796 eck$LassoCheckResult]: Loop: 629#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 647#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 641#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 646#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 644#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 640#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 637#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 628#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 629#L13-2 [2020-06-22 08:49:29,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:29,452 INFO L82 PathProgramCache]: Analyzing trace with hash 5467625, now seen corresponding path program 1 times [2020-06-22 08:49:29,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:29,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:29,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:29,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:29,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:29,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:29,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 3 times [2020-06-22 08:49:29,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:29,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:29,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:29,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:29,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:29,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:29,472 INFO L82 PathProgramCache]: Analyzing trace with hash 178852069, now seen corresponding path program 1 times [2020-06-22 08:49:29,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:29,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:29,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:29,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:29,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:29,794 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-06-22 08:49:29,989 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-06-22 08:49:29,992 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:29,992 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:29,992 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:29,992 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:29,992 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:49:29,992 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:49:29,992 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:29,993 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:29,993 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-06-22 08:49:29,993 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:29,993 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:29,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:29,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:30,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:30,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:30,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:30,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:30,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:30,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:30,368 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2020-06-22 08:49:30,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:30,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:30,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:30,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:30,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:30,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:30,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:30,884 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:30,884 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:49:30,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:30,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:30,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:30,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:30,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:30,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:30,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:30,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:30,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:30,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:30,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:30,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:30,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:30,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:30,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:30,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:30,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:30,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:30,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:30,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:30,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:30,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:30,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:30,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:30,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:30,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:30,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:30,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:30,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:30,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:30,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:30,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:30,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:30,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:30,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:30,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:30,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:30,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:30,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:30,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:30,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:30,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:30,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:30,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:30,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:30,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:30,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:30,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:30,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:30,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:30,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:30,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:30,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:30,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:30,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:30,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:30,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:30,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:30,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:30,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:30,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:30,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:30,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:30,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:30,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:30,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:30,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:30,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:30,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:30,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:30,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:30,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:30,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:30,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:30,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:30,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:30,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:30,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:30,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:30,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:30,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:30,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:30,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:30,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:30,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:30,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:30,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:30,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:30,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:30,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:30,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:30,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:30,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:30,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:30,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:30,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:30,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:30,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:30,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:30,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:30,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:30,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:30,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:30,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:30,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:30,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:30,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:30,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:30,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:30,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:30,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:30,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:30,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:30,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:30,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:30,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:30,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:30,967 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:49:30,986 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 08:49:30,986 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. [2020-06-22 08:49:30,987 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:49:30,988 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:49:30,988 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:49:30,988 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_~i~0) = 1*ULTIMATE.start_diff_~l1~0 - 1*ULTIMATE.start_diff_~i~0 Supporting invariants [] [2020-06-22 08:49:31,029 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2020-06-22 08:49:31,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:31,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:49:31,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:31,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:31,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:49:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:31,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:31,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:31,143 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 08:49:31,143 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 08:49:31,143 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34 Second operand 3 states. [2020-06-22 08:49:31,207 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34. Second operand 3 states. Result 73 states and 123 transitions. Complement of second has 4 states. [2020-06-22 08:49:31,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 08:49:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 08:49:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-06-22 08:49:31,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 08:49:31,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:31,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 8 letters. [2020-06-22 08:49:31,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:31,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 16 letters. [2020-06-22 08:49:31,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:31,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 123 transitions. [2020-06-22 08:49:31,216 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2020-06-22 08:49:31,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 114 transitions. [2020-06-22 08:49:31,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-06-22 08:49:31,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-06-22 08:49:31,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 114 transitions. [2020-06-22 08:49:31,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:49:31,217 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 114 transitions. [2020-06-22 08:49:31,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 114 transitions. [2020-06-22 08:49:31,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. [2020-06-22 08:49:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 08:49:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. [2020-06-22 08:49:31,219 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-06-22 08:49:31,219 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-06-22 08:49:31,220 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 08:49:31,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 72 transitions. [2020-06-22 08:49:31,220 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 08:49:31,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:31,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:31,221 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:49:31,221 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:31,221 INFO L794 eck$LassoCheckResult]: Stem: 875#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 876#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 877#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 878#L37-1 [123] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 883#L13-2 [2020-06-22 08:49:31,222 INFO L796 eck$LassoCheckResult]: Loop: 883#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 901#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 895#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 900#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 898#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 894#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 891#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 882#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 883#L13-2 [2020-06-22 08:49:31,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:31,222 INFO L82 PathProgramCache]: Analyzing trace with hash 5467624, now seen corresponding path program 1 times [2020-06-22 08:49:31,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:31,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:31,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:31,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:31,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:31,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 4 times [2020-06-22 08:49:31,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:31,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:31,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:31,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1986306532, now seen corresponding path program 1 times [2020-06-22 08:49:31,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:31,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:31,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:31,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:31,753 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2020-06-22 08:49:31,911 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-06-22 08:49:31,913 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:31,913 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:31,913 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:31,913 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:31,913 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:49:31,913 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:49:31,913 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:31,914 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:31,914 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso [2020-06-22 08:49:31,914 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:31,914 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:31,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:31,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:31,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:31,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:31,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:31,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:31,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:31,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:31,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:31,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:31,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:31,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:31,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:32,236 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2020-06-22 08:49:32,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:32,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:32,695 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:32,695 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:49:32,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:32,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:32,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:32,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:32,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:32,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:32,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:32,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:32,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:32,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:32,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:32,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:32,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:32,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:32,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:32,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:32,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:32,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:32,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:32,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:32,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:32,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:32,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:32,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:32,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:32,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:32,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:32,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:32,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:32,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:32,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:32,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:32,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:32,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:32,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:32,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:32,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:32,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:32,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:32,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:32,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:32,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:32,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:32,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:32,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:32,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:32,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:32,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:32,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:32,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:32,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:32,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:32,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:32,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:32,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:32,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:32,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:32,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:32,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:32,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:32,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:32,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:32,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:32,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:32,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:32,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:32,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:32,751 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:49:32,762 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 08:49:32,763 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2020-06-22 08:49:32,763 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:49:32,764 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:49:32,764 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:49:32,764 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_~i~0) = 1*ULTIMATE.start_diff_~l1~0 - 1*ULTIMATE.start_diff_~i~0 Supporting invariants [] [2020-06-22 08:49:32,804 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2020-06-22 08:49:32,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:32,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:49:32,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:32,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:32,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:49:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:32,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:32,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:32,928 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 08:49:32,928 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 08:49:32,928 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34 Second operand 3 states. [2020-06-22 08:49:32,986 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34. Second operand 3 states. Result 73 states and 123 transitions. Complement of second has 4 states. [2020-06-22 08:49:32,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 08:49:32,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 08:49:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-06-22 08:49:32,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 08:49:32,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:32,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 8 letters. [2020-06-22 08:49:32,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:32,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 16 letters. [2020-06-22 08:49:32,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:32,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 123 transitions. [2020-06-22 08:49:32,997 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2020-06-22 08:49:32,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 114 transitions. [2020-06-22 08:49:32,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-06-22 08:49:32,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-06-22 08:49:32,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 114 transitions. [2020-06-22 08:49:32,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:49:32,998 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 114 transitions. [2020-06-22 08:49:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 114 transitions. [2020-06-22 08:49:32,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. [2020-06-22 08:49:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 08:49:33,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. [2020-06-22 08:49:33,000 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-06-22 08:49:33,000 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-06-22 08:49:33,000 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 08:49:33,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 72 transitions. [2020-06-22 08:49:33,001 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 08:49:33,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:33,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:33,001 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:49:33,001 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:33,002 INFO L794 eck$LassoCheckResult]: Stem: 1129#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 1130#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 1131#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 1132#L37-1 [122] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 1137#L13-2 [2020-06-22 08:49:33,002 INFO L796 eck$LassoCheckResult]: Loop: 1137#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 1155#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 1149#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 1154#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 1152#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 1148#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 1145#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 1136#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 1137#L13-2 [2020-06-22 08:49:33,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:33,003 INFO L82 PathProgramCache]: Analyzing trace with hash 5467623, now seen corresponding path program 1 times [2020-06-22 08:49:33,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:33,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:33,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:33,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:33,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:33,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:33,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 5 times [2020-06-22 08:49:33,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:33,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:33,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:33,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:33,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:33,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:33,020 INFO L82 PathProgramCache]: Analyzing trace with hash -501206301, now seen corresponding path program 1 times [2020-06-22 08:49:33,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:33,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:33,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:33,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:33,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:33,612 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 [2020-06-22 08:49:33,779 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-06-22 08:49:33,781 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:33,781 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:33,781 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:33,781 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:33,782 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:49:33,782 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:49:33,782 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:33,782 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:33,782 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso [2020-06-22 08:49:33,782 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:33,782 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:33,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:33,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:33,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:33,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:33,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:33,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:33,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:33,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:33,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:33,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:33,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:34,123 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2020-06-22 08:49:34,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:34,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:34,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:34,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:34,602 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:34,602 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:49:34,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:34,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:34,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:34,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:34,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:34,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:34,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:34,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:34,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:34,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:34,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:34,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:34,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:34,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:34,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:34,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:34,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:34,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:34,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:34,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:34,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:34,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:34,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:34,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:34,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:34,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:34,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:34,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:34,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:34,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:34,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:34,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:34,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:34,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:34,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:34,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:34,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:34,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:34,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:34,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:34,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:34,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:34,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:34,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:34,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:34,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:34,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:34,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:34,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:34,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:34,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:34,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:34,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:34,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:34,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:34,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:34,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:34,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:34,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:34,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:34,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:34,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:34,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:34,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:34,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:34,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:34,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:34,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:34,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:34,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:34,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:34,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:34,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:34,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:34,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:34,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:34,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:34,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:34,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:34,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:34,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:34,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:34,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:34,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:34,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:34,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:34,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:34,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:34,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:34,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:34,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:34,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:34,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:34,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:34,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:34,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:34,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:34,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:34,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:34,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:34,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:34,655 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:49:34,663 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 08:49:34,663 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 08:49:34,664 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:49:34,665 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:49:34,665 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:49:34,665 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 Supporting invariants [] [2020-06-22 08:49:34,707 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2020-06-22 08:49:34,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:34,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:49:34,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:34,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:34,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:49:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:34,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:34,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:34,840 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 08:49:34,840 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 08:49:34,840 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34 Second operand 3 states. [2020-06-22 08:49:34,890 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34. Second operand 3 states. Result 73 states and 123 transitions. Complement of second has 4 states. [2020-06-22 08:49:34,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 08:49:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 08:49:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-06-22 08:49:34,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 08:49:34,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:34,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 8 letters. [2020-06-22 08:49:34,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:34,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 16 letters. [2020-06-22 08:49:34,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:34,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 123 transitions. [2020-06-22 08:49:34,897 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2020-06-22 08:49:34,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 114 transitions. [2020-06-22 08:49:34,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-06-22 08:49:34,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-06-22 08:49:34,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 114 transitions. [2020-06-22 08:49:34,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:49:34,898 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 114 transitions. [2020-06-22 08:49:34,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 114 transitions. [2020-06-22 08:49:34,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. [2020-06-22 08:49:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 08:49:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. [2020-06-22 08:49:34,900 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-06-22 08:49:34,900 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-06-22 08:49:34,901 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 08:49:34,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 72 transitions. [2020-06-22 08:49:34,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 08:49:34,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:34,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:34,902 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:49:34,902 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:34,902 INFO L794 eck$LassoCheckResult]: Stem: 1383#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 1384#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 1385#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 1386#L37-1 [121] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 1391#L13-2 [2020-06-22 08:49:34,903 INFO L796 eck$LassoCheckResult]: Loop: 1391#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 1409#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 1403#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 1408#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 1406#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 1402#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 1399#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 1390#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 1391#L13-2 [2020-06-22 08:49:34,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:34,903 INFO L82 PathProgramCache]: Analyzing trace with hash 5467622, now seen corresponding path program 1 times [2020-06-22 08:49:34,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:34,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:34,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:34,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:34,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 6 times [2020-06-22 08:49:34,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:34,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:34,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:34,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:34,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:34,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:34,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1306248162, now seen corresponding path program 1 times [2020-06-22 08:49:34,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:34,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:34,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:34,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:34,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:35,335 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2020-06-22 08:49:35,508 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-06-22 08:49:35,510 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:35,510 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:35,510 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:35,510 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:35,510 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:49:35,510 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:49:35,510 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:35,510 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:35,511 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Lasso [2020-06-22 08:49:35,511 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:35,511 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:35,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:35,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:35,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:35,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:35,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:35,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:35,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:35,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:35,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:35,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:35,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:35,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:35,817 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2020-06-22 08:49:35,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:35,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:35,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:36,276 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:36,276 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:49:36,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:36,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:36,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:36,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:36,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:36,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:36,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:36,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:36,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:36,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:36,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:36,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:36,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:36,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:36,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:36,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:36,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:36,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:36,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:36,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:36,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:36,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:36,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:36,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:36,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:36,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:36,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:36,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:36,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:36,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:36,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:36,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:36,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:36,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:36,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:36,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:36,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:36,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:36,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:36,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:36,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:36,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:36,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:36,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:36,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:36,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:36,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:36,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:36,332 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:49:36,363 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-06-22 08:49:36,363 INFO L444 ModelExtractionUtils]: 28 out of 40 variables were initially zero. Simplification set additionally 9 variables to zero. [2020-06-22 08:49:36,363 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:49:36,364 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:49:36,364 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:49:36,364 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 Supporting invariants [] [2020-06-22 08:49:36,415 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2020-06-22 08:49:36,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:36,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:49:36,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:36,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:36,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:49:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:36,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:36,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:36,537 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 08:49:36,537 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 08:49:36,537 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34 Second operand 3 states. [2020-06-22 08:49:36,609 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34. Second operand 3 states. Result 73 states and 123 transitions. Complement of second has 4 states. [2020-06-22 08:49:36,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 08:49:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 08:49:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-06-22 08:49:36,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 08:49:36,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:36,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 8 letters. [2020-06-22 08:49:36,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:36,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 16 letters. [2020-06-22 08:49:36,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:36,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 123 transitions. [2020-06-22 08:49:36,617 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2020-06-22 08:49:36,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 114 transitions. [2020-06-22 08:49:36,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-06-22 08:49:36,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-06-22 08:49:36,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 114 transitions. [2020-06-22 08:49:36,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:49:36,618 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 114 transitions. [2020-06-22 08:49:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 114 transitions. [2020-06-22 08:49:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. [2020-06-22 08:49:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 08:49:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. [2020-06-22 08:49:36,620 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-06-22 08:49:36,620 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-06-22 08:49:36,620 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-22 08:49:36,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 72 transitions. [2020-06-22 08:49:36,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 08:49:36,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:36,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:36,622 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:49:36,622 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:36,622 INFO L794 eck$LassoCheckResult]: Stem: 1637#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 1638#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 1639#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 1640#L37-1 [120] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 1645#L13-2 [2020-06-22 08:49:36,622 INFO L796 eck$LassoCheckResult]: Loop: 1645#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 1663#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 1657#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 1662#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 1660#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 1656#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 1653#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 1644#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 1645#L13-2 [2020-06-22 08:49:36,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:36,623 INFO L82 PathProgramCache]: Analyzing trace with hash 5467621, now seen corresponding path program 1 times [2020-06-22 08:49:36,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:36,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:36,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:36,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:36,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:36,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:36,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 7 times [2020-06-22 08:49:36,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:36,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:36,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:36,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:36,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:36,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:36,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1181264671, now seen corresponding path program 1 times [2020-06-22 08:49:36,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:36,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:36,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:36,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:36,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:36,917 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-06-22 08:49:37,078 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-06-22 08:49:37,080 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:37,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:37,080 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:37,081 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:37,081 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:49:37,081 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:49:37,081 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:37,081 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:37,081 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Lasso [2020-06-22 08:49:37,081 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:37,081 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:37,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:37,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:37,382 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2020-06-22 08:49:37,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:37,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:37,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:37,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:37,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:37,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:37,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:37,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:37,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:37,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:37,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:37,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:37,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:37,895 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:37,896 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:49:37,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:37,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:37,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:37,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:37,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:37,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:37,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:37,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:37,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:37,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:37,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:37,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:37,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:37,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:37,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:37,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:37,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:37,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:37,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:37,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:37,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:37,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:37,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:37,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:37,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:37,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:37,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:37,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:37,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:37,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:37,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:37,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:37,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:37,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:37,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:37,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:37,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:37,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:37,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:37,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:37,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:37,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:37,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:37,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:37,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:37,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:37,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:37,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:37,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:37,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:37,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:37,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:37,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:37,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:37,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:37,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:37,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:37,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:37,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:37,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:37,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:37,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:37,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:37,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:37,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:37,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:37,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:37,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:37,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:37,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:37,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:37,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:37,944 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:49:37,951 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 08:49:37,951 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 08:49:37,951 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:49:37,952 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:49:37,952 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:49:37,952 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~A.offset, v_rep(select #length ULTIMATE.start_diff_~A.base)_7) = -4*ULTIMATE.start_diff_~i~0 - 1*ULTIMATE.start_diff_~A.offset + 1*v_rep(select #length ULTIMATE.start_diff_~A.base)_7 Supporting invariants [] [2020-06-22 08:49:38,000 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2020-06-22 08:49:38,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:38,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:38,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:49:38,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:38,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:38,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:38,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:38,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:38,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:38,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:38,206 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 08:49:38,206 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 08:49:38,207 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34 Second operand 4 states. [2020-06-22 08:49:38,285 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34. Second operand 4 states. Result 75 states and 125 transitions. Complement of second has 6 states. [2020-06-22 08:49:38,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 08:49:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 08:49:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2020-06-22 08:49:38,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 08:49:38,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:38,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 12 letters. Loop has 8 letters. [2020-06-22 08:49:38,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:38,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 16 letters. [2020-06-22 08:49:38,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:38,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 125 transitions. [2020-06-22 08:49:38,292 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2020-06-22 08:49:38,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 116 transitions. [2020-06-22 08:49:38,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-06-22 08:49:38,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-06-22 08:49:38,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 116 transitions. [2020-06-22 08:49:38,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:49:38,293 INFO L706 BuchiCegarLoop]: Abstraction has 70 states and 116 transitions. [2020-06-22 08:49:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 116 transitions. [2020-06-22 08:49:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 41. [2020-06-22 08:49:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 08:49:38,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. [2020-06-22 08:49:38,295 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-06-22 08:49:38,296 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-06-22 08:49:38,296 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2020-06-22 08:49:38,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 72 transitions. [2020-06-22 08:49:38,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 08:49:38,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:38,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:38,297 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:49:38,297 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:38,297 INFO L794 eck$LassoCheckResult]: Stem: 1917#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 1918#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 1919#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 1920#L37-1 [119] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 1925#L13-2 [2020-06-22 08:49:38,298 INFO L796 eck$LassoCheckResult]: Loop: 1925#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 1943#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 1937#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 1942#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 1940#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 1936#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 1933#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 1924#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 1925#L13-2 [2020-06-22 08:49:38,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:38,298 INFO L82 PathProgramCache]: Analyzing trace with hash 5467620, now seen corresponding path program 1 times [2020-06-22 08:49:38,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:38,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:38,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:38,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:38,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:38,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:38,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 8 times [2020-06-22 08:49:38,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:38,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:38,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:38,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:38,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:38,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:38,312 INFO L82 PathProgramCache]: Analyzing trace with hash 626189792, now seen corresponding path program 1 times [2020-06-22 08:49:38,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:38,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:38,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:38,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:38,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:38,756 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2020-06-22 08:49:38,905 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-06-22 08:49:38,908 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:38,908 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:38,908 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:38,908 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:38,909 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:49:38,909 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:49:38,909 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:38,909 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:38,909 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Lasso [2020-06-22 08:49:38,909 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:38,909 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:38,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:39,208 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2020-06-22 08:49:39,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:39,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:39,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:39,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:39,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:39,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:39,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:39,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:39,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:39,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:39,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:39,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:39,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:39,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:39,745 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:39,746 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:49:39,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:39,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:39,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:39,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:39,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:39,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:39,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:39,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:39,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:39,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:39,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:39,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:39,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:39,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:39,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:39,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:39,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:39,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:39,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:39,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:39,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:39,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:39,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:39,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:39,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:39,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:39,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:39,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:39,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:39,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:39,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:39,772 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:49:39,777 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 08:49:39,777 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 08:49:39,777 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:49:39,778 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:49:39,778 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:49:39,778 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_~i~0) = 1*ULTIMATE.start_diff_~l1~0 - 1*ULTIMATE.start_diff_~i~0 Supporting invariants [] [2020-06-22 08:49:39,818 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2020-06-22 08:49:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:39,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:49:39,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:39,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:39,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:49:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:39,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:39,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:39,941 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 08:49:39,942 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 08:49:39,942 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34 Second operand 3 states. [2020-06-22 08:49:39,998 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34. Second operand 3 states. Result 57 states and 98 transitions. Complement of second has 4 states. [2020-06-22 08:49:39,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 08:49:39,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 08:49:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-06-22 08:49:39,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 08:49:39,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:39,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 8 letters. [2020-06-22 08:49:39,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:39,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 16 letters. [2020-06-22 08:49:39,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:40,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 98 transitions. [2020-06-22 08:49:40,004 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-06-22 08:49:40,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 52 states and 89 transitions. [2020-06-22 08:49:40,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 08:49:40,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 08:49:40,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 89 transitions. [2020-06-22 08:49:40,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:49:40,005 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 89 transitions. [2020-06-22 08:49:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 89 transitions. [2020-06-22 08:49:40,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 25. [2020-06-22 08:49:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 08:49:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 47 transitions. [2020-06-22 08:49:40,007 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 47 transitions. [2020-06-22 08:49:40,007 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 47 transitions. [2020-06-22 08:49:40,007 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2020-06-22 08:49:40,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 47 transitions. [2020-06-22 08:49:40,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 08:49:40,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:40,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:40,008 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 08:49:40,008 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 08:49:40,008 INFO L794 eck$LassoCheckResult]: Stem: 2155#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 2156#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 2157#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 2158#L37-1 [126] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 2159#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 2147#L17-4 [2020-06-22 08:49:40,026 INFO L796 eck$LassoCheckResult]: Loop: 2147#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 2153#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 2151#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 2146#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 2147#L17-4 [2020-06-22 08:49:40,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:40,027 INFO L82 PathProgramCache]: Analyzing trace with hash 169496528, now seen corresponding path program 1 times [2020-06-22 08:49:40,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:40,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:40,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:40,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:40,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:40,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash 3957137, now seen corresponding path program 1 times [2020-06-22 08:49:40,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:40,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:40,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:40,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:40,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:40,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:40,044 INFO L82 PathProgramCache]: Analyzing trace with hash -772001312, now seen corresponding path program 1 times [2020-06-22 08:49:40,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:40,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:40,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:40,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:40,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:40,663 WARN L188 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2020-06-22 08:49:40,868 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-06-22 08:49:40,870 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:40,871 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:40,871 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:40,871 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:40,871 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:49:40,871 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:49:40,871 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:40,871 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:40,871 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Lasso [2020-06-22 08:49:40,871 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:40,871 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:40,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:40,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:40,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:40,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:40,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:40,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:40,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:40,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:40,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:40,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:40,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:40,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:41,226 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2020-06-22 08:49:41,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:41,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:41,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:41,513 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-06-22 08:49:41,752 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-06-22 08:49:41,773 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:41,774 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:49:41,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:41,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:41,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:41,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:41,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:41,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:41,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:41,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:41,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:41,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:41,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:41,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:41,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:41,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:41,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:41,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:41,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:41,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:41,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:41,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:41,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:41,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:41,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:41,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:41,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:41,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:41,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:41,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:41,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:41,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:41,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:41,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:41,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:41,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:41,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:41,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:41,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:41,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:41,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:41,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:41,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:41,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:41,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:41,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:41,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:41,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:41,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:41,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:41,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:41,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:41,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:41,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:41,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:41,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:41,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:41,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:41,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:41,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:41,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:41,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:41,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:41,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:41,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:41,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:41,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:41,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:41,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:41,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:41,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:41,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:41,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:41,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:41,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:41,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:41,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:41,794 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:49:41,797 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 08:49:41,797 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 08:49:41,797 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:49:41,798 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:49:41,798 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:49:41,798 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~found~0) = -2*ULTIMATE.start_diff_~found~0 + 1 Supporting invariants [] [2020-06-22 08:49:41,840 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 08:49:41,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:41,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:49:41,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:41,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:41,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:41,887 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 08:49:41,887 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 08:49:41,887 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 25 states and 47 transitions. cyclomatic complexity: 24 Second operand 3 states. [2020-06-22 08:49:41,949 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 25 states and 47 transitions. cyclomatic complexity: 24. Second operand 3 states. Result 53 states and 89 transitions. Complement of second has 8 states. [2020-06-22 08:49:41,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 08:49:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 08:49:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2020-06-22 08:49:41,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 5 letters. Loop has 4 letters. [2020-06-22 08:49:41,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:41,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 9 letters. Loop has 4 letters. [2020-06-22 08:49:41,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:41,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 5 letters. Loop has 8 letters. [2020-06-22 08:49:41,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:41,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 89 transitions. [2020-06-22 08:49:41,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 08:49:41,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 51 states and 87 transitions. [2020-06-22 08:49:41,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-06-22 08:49:41,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 08:49:41,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 87 transitions. [2020-06-22 08:49:41,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:49:41,956 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 87 transitions. [2020-06-22 08:49:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 87 transitions. [2020-06-22 08:49:41,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-06-22 08:49:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-06-22 08:49:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 80 transitions. [2020-06-22 08:49:41,958 INFO L729 BuchiCegarLoop]: Abstraction has 45 states and 80 transitions. [2020-06-22 08:49:41,958 INFO L609 BuchiCegarLoop]: Abstraction has 45 states and 80 transitions. [2020-06-22 08:49:41,958 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2020-06-22 08:49:41,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 80 transitions. [2020-06-22 08:49:41,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 08:49:41,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:41,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:41,959 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:49:41,960 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 08:49:41,960 INFO L794 eck$LassoCheckResult]: Stem: 2349#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 2350#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 2351#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 2352#L37-1 [126] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 2353#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 2355#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 2347#L17 [2020-06-22 08:49:41,960 INFO L796 eck$LassoCheckResult]: Loop: 2347#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 2345#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 2341#L17-2 [148] L17-2-->L17-4: Formula: (and (= v_ULTIMATE.start_diff_~j~0_7 (+ v_ULTIMATE.start_diff_~j~0_8 1)) (< |v_ULTIMATE.start_diff_#t~mem1_6| |v_ULTIMATE.start_diff_#t~mem0_6|)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_6|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_6|, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_8} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_5|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_5|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_2|, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~j~0, ULTIMATE.start_diff_#t~post2] 2342#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 2347#L17 [2020-06-22 08:49:41,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash 959425171, now seen corresponding path program 1 times [2020-06-22 08:49:41,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:41,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:41,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:41,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:41,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:41,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:41,971 INFO L82 PathProgramCache]: Analyzing trace with hash 3539245, now seen corresponding path program 1 times [2020-06-22 08:49:41,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:41,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:41,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:41,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:41,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:41,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:41,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1837765311, now seen corresponding path program 1 times [2020-06-22 08:49:41,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:41,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:41,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:41,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:41,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:42,421 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 108 [2020-06-22 08:49:42,578 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-06-22 08:49:42,580 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:42,580 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:42,580 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:42,581 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:42,581 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:49:42,581 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:49:42,581 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:42,581 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:42,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration13_Lasso [2020-06-22 08:49:42,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:42,581 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:42,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:42,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:42,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:42,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:42,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:42,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:42,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:42,903 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2020-06-22 08:49:42,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:42,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:42,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:42,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:42,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:42,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:42,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:42,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:43,136 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-06-22 08:49:43,384 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-06-22 08:49:43,466 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:43,466 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:49:43,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:43,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:43,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:43,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:43,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:43,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:43,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:43,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:43,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:43,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:43,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:43,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:43,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:43,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:43,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:43,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:43,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:43,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:43,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:43,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:43,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:43,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:43,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:43,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:43,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:43,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:43,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:43,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:43,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:43,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:43,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:43,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:43,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:43,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:43,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:43,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:43,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:43,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:43,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:43,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:43,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:43,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:43,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:43,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:43,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:43,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:43,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:43,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:43,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:43,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:43,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:43,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:43,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:43,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:43,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:43,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:43,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:43,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:43,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:43,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:43,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:43,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:43,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:43,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:43,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:43,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:43,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:43,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:43,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:43,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:43,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:43,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:43,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:43,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:43,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:43,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:43,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:43,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:43,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:43,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:43,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:43,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:43,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:43,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:43,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:43,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:43,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:43,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:43,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:43,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:43,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:43,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:43,509 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:49:43,526 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 08:49:43,527 INFO L444 ModelExtractionUtils]: 65 out of 73 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 08:49:43,527 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:49:43,528 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:49:43,528 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:49:43,528 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~B.offset, v_rep(select #length ULTIMATE.start_diff_~B.base)_10, ULTIMATE.start_diff_~j~0) = -1*ULTIMATE.start_diff_~B.offset + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_10 - 4*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2020-06-22 08:49:43,566 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2020-06-22 08:49:43,567 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:43,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:49:43,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:43,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:43,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:43,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:43,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:43,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:43,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:43,690 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 08:49:43,690 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-06-22 08:49:43,690 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 45 states and 80 transitions. cyclomatic complexity: 39 Second operand 5 states. [2020-06-22 08:49:43,766 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 45 states and 80 transitions. cyclomatic complexity: 39. Second operand 5 states. Result 128 states and 178 transitions. Complement of second has 14 states. [2020-06-22 08:49:43,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 08:49:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 08:49:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2020-06-22 08:49:43,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 6 letters. Loop has 4 letters. [2020-06-22 08:49:43,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:43,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 10 letters. Loop has 4 letters. [2020-06-22 08:49:43,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:43,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 6 letters. Loop has 8 letters. [2020-06-22 08:49:43,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:43,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 178 transitions. [2020-06-22 08:49:43,773 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:49:43,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 0 states and 0 transitions. [2020-06-22 08:49:43,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 08:49:43,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 08:49:43,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 08:49:43,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:49:43,774 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:49:43,774 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:49:43,774 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:49:43,774 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2020-06-22 08:49:43,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:49:43,775 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:49:43,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 08:49:43,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:49:43 BasicIcfg [2020-06-22 08:49:43,781 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 08:49:43,782 INFO L168 Benchmark]: Toolchain (without parser) took 31586.52 ms. Allocated memory was 514.9 MB in the beginning and 907.0 MB in the end (delta: 392.2 MB). Free memory was 439.5 MB in the beginning and 449.0 MB in the end (delta: -9.5 MB). Peak memory consumption was 382.6 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:43,782 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 514.9 MB. Free memory is still 459.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:49:43,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.59 ms. Allocated memory was 514.9 MB in the beginning and 556.3 MB in the end (delta: 41.4 MB). Free memory was 439.0 MB in the beginning and 524.3 MB in the end (delta: -85.3 MB). Peak memory consumption was 29.6 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:43,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.97 ms. Allocated memory is still 556.3 MB. Free memory was 524.3 MB in the beginning and 522.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:43,784 INFO L168 Benchmark]: Boogie Preprocessor took 28.25 ms. Allocated memory is still 556.3 MB. Free memory was 522.1 MB in the beginning and 520.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:43,784 INFO L168 Benchmark]: RCFGBuilder took 405.49 ms. Allocated memory is still 556.3 MB. Free memory was 520.5 MB in the beginning and 500.4 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:43,785 INFO L168 Benchmark]: BlockEncodingV2 took 114.21 ms. Allocated memory is still 556.3 MB. Free memory was 500.4 MB in the beginning and 490.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:43,785 INFO L168 Benchmark]: TraceAbstraction took 11217.60 ms. Allocated memory was 556.3 MB in the beginning and 690.5 MB in the end (delta: 134.2 MB). Free memory was 490.6 MB in the beginning and 635.4 MB in the end (delta: -144.8 MB). Peak memory consumption was 213.2 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:43,786 INFO L168 Benchmark]: BuchiAutomizer took 19467.16 ms. Allocated memory was 690.5 MB in the beginning and 907.0 MB in the end (delta: 216.5 MB). Free memory was 635.4 MB in the beginning and 449.0 MB in the end (delta: 186.4 MB). Peak memory consumption was 402.9 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:43,789 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 27 locations, 34 edges - StatisticsResult: Encoded RCFG 21 locations, 45 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 514.9 MB. Free memory is still 459.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 303.59 ms. Allocated memory was 514.9 MB in the beginning and 556.3 MB in the end (delta: 41.4 MB). Free memory was 439.0 MB in the beginning and 524.3 MB in the end (delta: -85.3 MB). Peak memory consumption was 29.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 44.97 ms. Allocated memory is still 556.3 MB. Free memory was 524.3 MB in the beginning and 522.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 28.25 ms. Allocated memory is still 556.3 MB. Free memory was 522.1 MB in the beginning and 520.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 405.49 ms. Allocated memory is still 556.3 MB. Free memory was 520.5 MB in the beginning and 500.4 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 114.21 ms. Allocated memory is still 556.3 MB. Free memory was 500.4 MB in the beginning and 490.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 11217.60 ms. Allocated memory was 556.3 MB in the beginning and 690.5 MB in the end (delta: 134.2 MB). Free memory was 490.6 MB in the beginning and 635.4 MB in the end (delta: -144.8 MB). Peak memory consumption was 213.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 19467.16 ms. Allocated memory was 690.5 MB in the beginning and 907.0 MB in the end (delta: 216.5 MB). Free memory was 635.4 MB in the beginning and 449.0 MB in the end (delta: 186.4 MB). Peak memory consumption was 402.9 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2020-06-22 08:49:43,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:43,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:43,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((4 * k + 4 * l1 <= 4 * i + A + unknown-#length-unknown[D] && 4 <= 4 * i + A) && 1 <= Alen) && (4 * l2 <= unknown-#length-unknown[B] && (((((4 * l1 <= unknown-#length-unknown[A] && \valid[A] == 1) && 1 <= Blen) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 1 <= l2) && 0 <= 4 * j + B) && 0 == D) && 0 == A) && 4 <= 4 * k + D) || ((((0 == D && 0 == A) && (((((((((((4 * l1 <= unknown-#length-unknown[A] && \valid[A] == 1) && 4 * l2 <= unknown-#length-unknown[B]) && 1 <= Blen) && 1 == \valid[D]) && 0 == i) && 0 == B) && 1 == \valid[B]) && 1 <= l2) && 4 <= unknown-#length-unknown[D]) && 1 <= Alen) || (((4 <= unknown-#length-unknown[D] && 4 <= 4 * i + A) && 1 <= Alen) && (4 * l2 <= unknown-#length-unknown[B] && (((((4 * l1 <= unknown-#length-unknown[A] && \valid[A] == 1) && 1 <= Blen) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 1 <= l2) && 0 <= 4 * j + B))) && 0 == k) && (\exists v_prenex_1 : int, ULTIMATE.start_main_#t~malloc8.base : int :: (l1 <= v_prenex_1 && 4 * v_prenex_1 == unknown-#length-unknown[ULTIMATE.start_main_#t~malloc8.base]) && 4 * v_prenex_1 == unknown-#length-unknown[D])) - InvariantResult [Line: 16]: Loop Invariant [2020-06-22 08:49:43,808 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,808 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:43,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:43,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:43,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:43,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,821 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,821 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,821 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,821 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,821 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,822 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,822 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,822 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,822 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:43,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:43,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:43,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] [2020-06-22 08:49:43,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-06-22 08:49:43,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,837 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,837 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:43,837 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((4 <= unknown-#length-unknown[D] && 1 == found) && ((((((((4 * l1 <= unknown-#length-unknown[A] && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 4 * l2 <= unknown-#length-unknown[B]) && 1 <= Blen) && 1 == \valid[D]) && 0 == B) && 4 * j + 4 <= unknown-#length-unknown[B]) && 1 == \valid[B]) && 1 <= l2) && 1 <= Alen) && 0 <= 4 * i + A) && 4 <= 4 * j + B) && 0 == D) && 0 == A) && 0 == k) && (\exists v_prenex_1 : int, ULTIMATE.start_main_#t~malloc8.base : int :: (l1 <= v_prenex_1 && 4 * v_prenex_1 == unknown-#length-unknown[ULTIMATE.start_main_#t~malloc8.base]) && 4 * v_prenex_1 == unknown-#length-unknown[D])) || (((((((((1 == found && 4 * k + 4 * l1 <= 4 * i + A + unknown-#length-unknown[D]) && ((((((((4 * l1 <= unknown-#length-unknown[A] && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 4 * l2 <= unknown-#length-unknown[B]) && 1 <= Blen) && 1 == \valid[D]) && 0 == B) && 4 * j + 4 <= unknown-#length-unknown[B]) && 1 == \valid[B]) && 1 <= l2) && 4 <= 4 * i + A) && 1 <= Alen) && 0 == D) && 4 * k + 4 <= A + unknown-#length-unknown[D]) && 0 == A) && 4 <= 4 * j + B) && 4 <= 4 * k + D)) || ((((((((4 * k + 4 * l1 <= 4 * i + A + unknown-#length-unknown[D] && 4 <= 4 * i + A) && ((((((((4 * l1 <= unknown-#length-unknown[A] && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 0 == found) && 4 * l2 <= unknown-#length-unknown[B]) && 1 <= Blen) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 1 <= l2) && 1 <= Alen) && 0 == D) && 4 * k + 4 <= A + unknown-#length-unknown[D]) && 0 == A) && 4 <= 4 * j + B) && 4 <= 4 * k + D)) || ((((0 == D && 0 == A) && (((4 <= unknown-#length-unknown[D] && ((((((((4 * l1 <= unknown-#length-unknown[A] && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 0 == found) && 4 * l2 <= unknown-#length-unknown[B]) && 1 <= Blen) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 1 <= l2) && 1 <= Alen) && 0 <= 4 * i + A) && 4 <= 4 * j + B) && 0 == k) && (\exists v_prenex_1 : int, ULTIMATE.start_main_#t~malloc8.base : int :: (l1 <= v_prenex_1 && 4 * v_prenex_1 == unknown-#length-unknown[ULTIMATE.start_main_#t~malloc8.base]) && 4 * v_prenex_1 == unknown-#length-unknown[D]))) || (((((((((((((((((4 * l1 <= unknown-#length-unknown[A] && 1 <= Blen) && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 0 == j) && 4 * l2 <= unknown-#length-unknown[B]) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 0 == A) && 1 <= l2) && 4 <= unknown-#length-unknown[D]) && 1 == found) && 1 <= Alen) && 0 <= 4 * i + A) && 0 == D) && 0 == k) && (\exists v_prenex_1 : int, ULTIMATE.start_main_#t~malloc8.base : int :: (l1 <= v_prenex_1 && 4 * v_prenex_1 == unknown-#length-unknown[ULTIMATE.start_main_#t~malloc8.base]) && 4 * v_prenex_1 == unknown-#length-unknown[D]))) || ((((0 == D && 0 == A) && ((4 <= unknown-#length-unknown[D] && (((((((((4 * l1 <= unknown-#length-unknown[A] && 0 == found) && 1 <= Blen) && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 0 == j) && 4 * l2 <= unknown-#length-unknown[B]) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 1 <= l2) && 1 <= Alen) && 0 <= 4 * i + A) && 0 == k) && (\exists v_prenex_1 : int, ULTIMATE.start_main_#t~malloc8.base : int :: (l1 <= v_prenex_1 && 4 * v_prenex_1 == unknown-#length-unknown[ULTIMATE.start_main_#t~malloc8.base]) && 4 * v_prenex_1 == unknown-#length-unknown[D]))) || (((((((((((((((((4 * l1 <= unknown-#length-unknown[A] && 1 <= Blen) && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 0 == j) && 4 * l2 <= unknown-#length-unknown[B]) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 0 == A) && 1 <= l2) && 1 == found) && 4 * k + 4 * l1 <= 4 * i + A + unknown-#length-unknown[D]) && 4 <= 4 * i + A) && 1 <= Alen) && 0 == D) && 4 * k + 4 <= A + unknown-#length-unknown[D]) && 4 <= 4 * k + D)) || (((((((4 * k + 4 * l1 <= 4 * i + A + unknown-#length-unknown[D] && 4 <= 4 * i + A) && 1 <= Alen) && 0 == D) && (((((((((4 * l1 <= unknown-#length-unknown[A] && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 0 == j) && 0 == found) && 4 * l2 <= unknown-#length-unknown[B]) && 1 <= Blen) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 1 <= l2) && 4 * k + 4 <= A + unknown-#length-unknown[D]) && 0 == A) && 4 <= 4 * k + D) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 8 error locations. SAFE Result, 11.0s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 6.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 178 SDtfs, 843 SDslu, 411 SDs, 0 SdLazy, 1009 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 49 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=13, 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, 16 MinimizatonAttempts, 253 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 20 NumberOfFragments, 1090 HoareAnnotationTreeSize, 2 FomulaSimplifications, 89706 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 2 FomulaSimplificationsInter, 41876 FormulaSimplificationTreeSizeReductionInter, 5.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 215 ConstructedInterpolants, 27 QuantifiedInterpolants, 31653 SizeOfPredicates, 32 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 33/61 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (3 trivial, 0 deterministic, 10 nondeterministic). One nondeterministic module has affine ranking function -1 * i + l1 and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + l1 and consists of 3 locations. One nondeterministic module has affine ranking function l1 + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function l1 + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + l1 and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + l1 and consists of 3 locations. One nondeterministic module has affine ranking function -4 * i + -1 * A + unknown-#length-unknown[A] and consists of 4 locations. One nondeterministic module has affine ranking function l1 + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * found + 1 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * B + unknown-#length-unknown[B] + -4 * j and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.4s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 17.0s. Construction of modules took 0.6s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 211 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 12. Nontrivial modules had stage [10, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 8/8 HoareTripleCheckerStatistics: 205 SDtfs, 621 SDslu, 210 SDs, 0 SdLazy, 558 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital261 mio100 ax100 hnf100 lsp90 ukn87 mio100 lsp38 div100 bol100 ite100 ukn100 eq191 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 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 - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 08:49:08.916 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 08:49:44.068 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check