./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array13_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array13_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:57:55,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:57:55,672 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-13 12:57:55,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:57:55,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:57:55,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:57:55,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:57:55,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:57:55,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:57:55,723 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:57:55,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:57:55,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:57:55,724 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:57:55,724 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 12:57:55,724 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 12:57:55,724 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 12:57:55,724 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 12:57:55,725 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 12:57:55,726 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 12:57:55,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:57:55,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 12:57:55,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:57:55,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:57:55,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 12:57:55,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 12:57:55,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 12:57:55,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:57:55,727 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:57:55,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:57:55,727 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 12:57:55,728 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:57:55,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:57:55,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:57:55,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:57:55,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:57:55,729 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 12:57:55,729 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff [2024-11-13 12:57:56,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:57:56,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:57:56,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:57:56,200 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:57:56,201 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:57:56,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/termination-15/array13_alloca.i Unable to find full path for "g++" [2024-11-13 12:57:58,825 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:57:59,146 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:57:59,147 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/sv-benchmarks/c/termination-15/array13_alloca.i [2024-11-13 12:57:59,159 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/data/c66fec85f/abc2e56ee3a44dfbb555c208258cb7b0/FLAG2dd9cb339 [2024-11-13 12:57:59,395 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/data/c66fec85f/abc2e56ee3a44dfbb555c208258cb7b0 [2024-11-13 12:57:59,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:57:59,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:57:59,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:57:59,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:57:59,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:57:59,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:57:59" (1/1) ... [2024-11-13 12:57:59,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d01fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:59, skipping insertion in model container [2024-11-13 12:57:59,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:57:59" (1/1) ... [2024-11-13 12:57:59,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:57:59,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:57:59,842 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:57:59,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:57:59,970 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:57:59,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:59 WrapperNode [2024-11-13 12:57:59,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:57:59,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:57:59,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:57:59,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:57:59,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:59" (1/1) ... [2024-11-13 12:58:00,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:59" (1/1) ... [2024-11-13 12:58:00,030 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2024-11-13 12:58:00,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:58:00,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:58:00,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:58:00,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:58:00,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:59" (1/1) ... [2024-11-13 12:58:00,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:59" (1/1) ... [2024-11-13 12:58:00,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:59" (1/1) ... [2024-11-13 12:58:00,077 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-13 12:58:00,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:59" (1/1) ... [2024-11-13 12:58:00,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:59" (1/1) ... [2024-11-13 12:58:00,082 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:59" (1/1) ... [2024-11-13 12:58:00,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:59" (1/1) ... [2024-11-13 12:58:00,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:59" (1/1) ... [2024-11-13 12:58:00,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:59" (1/1) ... [2024-11-13 12:58:00,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:58:00,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:58:00,104 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:58:00,104 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:58:00,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:59" (1/1) ... [2024-11-13 12:58:00,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:00,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:00,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:00,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-13 12:58:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 12:58:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 12:58:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 12:58:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 12:58:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:58:00,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:58:00,294 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:58:00,296 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:58:00,526 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 12:58:00,526 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:58:00,544 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:58:00,545 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 12:58:00,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:58:00 BoogieIcfgContainer [2024-11-13 12:58:00,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:58:00,548 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 12:58:00,548 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 12:58:00,554 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 12:58:00,555 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 12:58:00,555 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 12:57:59" (1/3) ... [2024-11-13 12:58:00,557 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@147e619b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 12:58:00, skipping insertion in model container [2024-11-13 12:58:00,557 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 12:58:00,558 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:57:59" (2/3) ... [2024-11-13 12:58:00,558 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@147e619b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 12:58:00, skipping insertion in model container [2024-11-13 12:58:00,558 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 12:58:00,558 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:58:00" (3/3) ... [2024-11-13 12:58:00,560 INFO L333 chiAutomizerObserver]: Analyzing ICFG array13_alloca.i [2024-11-13 12:58:00,640 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 12:58:00,640 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 12:58:00,640 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 12:58:00,640 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 12:58:00,641 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 12:58:00,641 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 12:58:00,641 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 12:58:00,641 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 12:58:00,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:00,679 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-13 12:58:00,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:58:00,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:58:00,686 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-13 12:58:00,686 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 12:58:00,686 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 12:58:00,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:00,688 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-13 12:58:00,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:58:00,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:58:00,688 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-13 12:58:00,688 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 12:58:00,698 INFO L745 eck$LassoCheckResult]: Stem: 9#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 10#L367true assume !(main_~length~0#1 < 1); 6#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 14#L370-2true [2024-11-13 12:58:00,698 INFO L747 eck$LassoCheckResult]: Loop: 14#L370-2true assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11#L372true assume main_#t~mem208#1 > 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15#L372-2true main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 14#L370-2true [2024-11-13 12:58:00,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:00,705 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2024-11-13 12:58:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:00,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791997627] [2024-11-13 12:58:00,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:00,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:00,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:00,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:00,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:00,927 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2024-11-13 12:58:00,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:00,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738131522] [2024-11-13 12:58:00,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:00,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:00,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:00,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:00,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:00,959 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2024-11-13 12:58:00,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:00,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491570843] [2024-11-13 12:58:00,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:00,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:00,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:01,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:01,605 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 12:58:01,607 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 12:58:01,607 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 12:58:01,609 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 12:58:01,609 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-13 12:58:01,609 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:01,609 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 12:58:01,609 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 12:58:01,610 INFO L132 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration1_Lasso [2024-11-13 12:58:01,610 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 12:58:01,610 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 12:58:01,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:01,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:01,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:01,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:01,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:01,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:01,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:01,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:01,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:01,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:01,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:02,376 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 12:58:02,381 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-13 12:58:02,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:02,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:02,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:02,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-13 12:58:02,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:02,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:02,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:58:02,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:02,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:02,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:02,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:58:02,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:58:02,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:02,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-13 12:58:02,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:02,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:02,459 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:02,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-13 12:58:02,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:02,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:02,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:58:02,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:02,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:02,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:02,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:58:02,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:58:02,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:02,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-13 12:58:02,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:02,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:02,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:02,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-13 12:58:02,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:02,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:02,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:02,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:02,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:02,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 12:58:02,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 12:58:02,572 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:02,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-13 12:58:02,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:02,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:02,592 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:02,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-13 12:58:02,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:02,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:02,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:02,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:02,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:02,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 12:58:02,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 12:58:02,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:02,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-13 12:58:02,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:02,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:02,654 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:02,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-13 12:58:02,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:02,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:02,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:02,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:02,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:02,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 12:58:02,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 12:58:02,730 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-13 12:58:02,790 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-13 12:58:02,796 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-13 12:58:02,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:02,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:02,806 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:02,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-13 12:58:02,809 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-13 12:58:02,830 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-13 12:58:02,831 INFO L474 LassoAnalysis]: Proved termination. [2024-11-13 12:58:02,831 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 2*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-13 12:58:02,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-13 12:58:02,884 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-13 12:58:02,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 12:58:02,900 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 12:58:02,905 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2024-11-13 12:58:02,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:02,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 12:58:02,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:58:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:02,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 12:58:02,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:58:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:03,102 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-13 12:58:03,103 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:03,185 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 40 transitions. Complement of second has 6 states. [2024-11-13 12:58:03,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-13 12:58:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-13 12:58:03,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-13 12:58:03,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 12:58:03,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 3 letters. [2024-11-13 12:58:03,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 12:58:03,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 5 letters. Loop has 6 letters. [2024-11-13 12:58:03,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 12:58:03,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2024-11-13 12:58:03,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:03,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 12 states and 17 transitions. [2024-11-13 12:58:03,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-13 12:58:03,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-13 12:58:03,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2024-11-13 12:58:03,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:58:03,218 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-11-13 12:58:03,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2024-11-13 12:58:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-13 12:58:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2024-11-13 12:58:03,243 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-11-13 12:58:03,243 INFO L424 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-11-13 12:58:03,243 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 12:58:03,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2024-11-13 12:58:03,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:03,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:58:03,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:58:03,244 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:03,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-13 12:58:03,245 INFO L745 eck$LassoCheckResult]: Stem: 108#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 109#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 110#L367 assume !(main_~length~0#1 < 1); 103#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 104#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 105#L370-2 assume !(main_~i~0#1 < main_~length~0#1); 111#L370-3 main_~j~0#1 := 0; 107#L378-2 [2024-11-13 12:58:03,245 INFO L747 eck$LassoCheckResult]: Loop: 107#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 106#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 107#L378-2 [2024-11-13 12:58:03,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:03,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2024-11-13 12:58:03,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:03,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981485874] [2024-11-13 12:58:03,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:03,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:03,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-13 12:58:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:03,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:03,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981485874] [2024-11-13 12:58:03,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981485874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:03,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:03,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:58:03,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536189649] [2024-11-13 12:58:03,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:03,443 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 12:58:03,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:03,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2276, now seen corresponding path program 1 times [2024-11-13 12:58:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:03,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457033511] [2024-11-13 12:58:03,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:03,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:03,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:03,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:03,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:03,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:58:03,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:58:03,543 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:03,586 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-11-13 12:58:03,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2024-11-13 12:58:03,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:03,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2024-11-13 12:58:03,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-13 12:58:03,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-13 12:58:03,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2024-11-13 12:58:03,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:58:03,588 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-11-13 12:58:03,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2024-11-13 12:58:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2024-11-13 12:58:03,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2024-11-13 12:58:03,590 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-11-13 12:58:03,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:58:03,592 INFO L424 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-11-13 12:58:03,592 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 12:58:03,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2024-11-13 12:58:03,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:03,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:58:03,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:58:03,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:03,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-13 12:58:03,593 INFO L745 eck$LassoCheckResult]: Stem: 141#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 142#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 143#L367 assume !(main_~length~0#1 < 1); 136#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 137#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 138#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 145#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 146#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 147#L370-2 assume !(main_~i~0#1 < main_~length~0#1); 144#L370-3 main_~j~0#1 := 0; 140#L378-2 [2024-11-13 12:58:03,594 INFO L747 eck$LassoCheckResult]: Loop: 140#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 139#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 140#L378-2 [2024-11-13 12:58:03,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:03,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2024-11-13 12:58:03,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:03,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322671728] [2024-11-13 12:58:03,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:03,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:03,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:03,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:03,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:03,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2276, now seen corresponding path program 2 times [2024-11-13 12:58:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619978289] [2024-11-13 12:58:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:03,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:03,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:03,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:03,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996799, now seen corresponding path program 1 times [2024-11-13 12:58:03,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:03,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376791573] [2024-11-13 12:58:03,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:03,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:04,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:04,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376791573] [2024-11-13 12:58:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376791573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:58:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908494171] [2024-11-13 12:58:04,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:04,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:58:04,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:04,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:58:04,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 12:58:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:04,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 12:58:04,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:58:04,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 12:58:04,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 12:58:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:04,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:58:04,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-13 12:58:04,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-13 12:58:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:04,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908494171] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:58:04,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:58:04,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2024-11-13 12:58:04,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797496709] [2024-11-13 12:58:04,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:58:04,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:04,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 12:58:04,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-13 12:58:04,647 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:04,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:04,831 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2024-11-13 12:58:04,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2024-11-13 12:58:04,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-13 12:58:04,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2024-11-13 12:58:04,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-13 12:58:04,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-13 12:58:04,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2024-11-13 12:58:04,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:58:04,834 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-13 12:58:04,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2024-11-13 12:58:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-13 12:58:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2024-11-13 12:58:04,836 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-11-13 12:58:04,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:58:04,837 INFO L424 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-11-13 12:58:04,837 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 12:58:04,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2024-11-13 12:58:04,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:04,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:58:04,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:58:04,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:04,842 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-13 12:58:04,842 INFO L745 eck$LassoCheckResult]: Stem: 266#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 267#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 268#L367 assume !(main_~length~0#1 < 1); 261#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 262#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 263#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 273#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 279#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 274#L370-2 assume !(main_~i~0#1 < main_~length~0#1); 275#L370-3 main_~j~0#1 := 0; 272#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 264#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 265#L378-2 [2024-11-13 12:58:04,842 INFO L747 eck$LassoCheckResult]: Loop: 265#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 278#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 265#L378-2 [2024-11-13 12:58:04,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:04,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996801, now seen corresponding path program 1 times [2024-11-13 12:58:04,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:04,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826190709] [2024-11-13 12:58:04,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:04,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:04,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:04,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:04,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:04,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2276, now seen corresponding path program 3 times [2024-11-13 12:58:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:04,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020530080] [2024-11-13 12:58:04,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:04,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:04,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:04,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:04,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:04,907 INFO L85 PathProgramCache]: Analyzing trace with hash -645481884, now seen corresponding path program 1 times [2024-11-13 12:58:04,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:04,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981893229] [2024-11-13 12:58:04,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:04,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:05,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:05,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981893229] [2024-11-13 12:58:05,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981893229] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:58:05,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090589814] [2024-11-13 12:58:05,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:05,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:58:05,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:05,058 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:58:05,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 12:58:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:05,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 12:58:05,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:58:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:05,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:58:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:05,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090589814] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:58:05,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:58:05,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-13 12:58:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521251466] [2024-11-13 12:58:05,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:58:05,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:05,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:58:05,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:58:05,423 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:05,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:05,584 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-11-13 12:58:05,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2024-11-13 12:58:05,590 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-13 12:58:05,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 51 transitions. [2024-11-13 12:58:05,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-13 12:58:05,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-13 12:58:05,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2024-11-13 12:58:05,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:58:05,592 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-13 12:58:05,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2024-11-13 12:58:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2024-11-13 12:58:05,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-11-13 12:58:05,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-13 12:58:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:58:05,601 INFO L424 stractBuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-13 12:58:05,602 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 12:58:05,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2024-11-13 12:58:05,603 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-13 12:58:05,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:58:05,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:58:05,604 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:05,604 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-13 12:58:05,604 INFO L745 eck$LassoCheckResult]: Stem: 428#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 429#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 430#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 431#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 456#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 437#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 434#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 435#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 440#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 453#L372 assume main_#t~mem208#1 > 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 443#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 441#L370-2 assume !(main_~i~0#1 < main_~length~0#1); 432#L370-3 main_~j~0#1 := 0; 433#L378-2 [2024-11-13 12:58:05,604 INFO L747 eck$LassoCheckResult]: Loop: 433#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 444#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 433#L378-2 [2024-11-13 12:58:05,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:05,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2024-11-13 12:58:05,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:05,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722518387] [2024-11-13 12:58:05,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:05,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:05,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:05,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722518387] [2024-11-13 12:58:05,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722518387] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:58:05,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753884211] [2024-11-13 12:58:05,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:05,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:58:05,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:05,727 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:58:05,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 12:58:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:05,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:58:05,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:58:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:05,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:58:05,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753884211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:05,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:58:05,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-13 12:58:05,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418771713] [2024-11-13 12:58:05,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:05,870 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 12:58:05,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:05,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2276, now seen corresponding path program 4 times [2024-11-13 12:58:05,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:05,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46689636] [2024-11-13 12:58:05,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:05,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:05,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:05,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:05,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:05,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:58:05,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:58:05,977 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:06,010 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2024-11-13 12:58:06,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2024-11-13 12:58:06,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:06,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2024-11-13 12:58:06,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-13 12:58:06,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-13 12:58:06,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2024-11-13 12:58:06,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:58:06,013 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-13 12:58:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2024-11-13 12:58:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-13 12:58:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:06,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-11-13 12:58:06,016 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-13 12:58:06,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:58:06,019 INFO L424 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-13 12:58:06,021 INFO L331 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-13 12:58:06,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2024-11-13 12:58:06,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:06,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:58:06,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:58:06,023 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:06,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-13 12:58:06,023 INFO L745 eck$LassoCheckResult]: Stem: 535#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 536#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 537#L367 assume !(main_~length~0#1 < 1); 530#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 531#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 532#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 539#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 540#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 542#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 543#L372 assume main_#t~mem208#1 > 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 549#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 546#L370-2 assume !(main_~i~0#1 < main_~length~0#1); 538#L370-3 main_~j~0#1 := 0; 534#L378-2 [2024-11-13 12:58:06,023 INFO L747 eck$LassoCheckResult]: Loop: 534#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 541#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 534#L378-2 [2024-11-13 12:58:06,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:06,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2024-11-13 12:58:06,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:06,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653310336] [2024-11-13 12:58:06,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:06,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:06,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:06,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:06,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:06,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2276, now seen corresponding path program 5 times [2024-11-13 12:58:06,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:06,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925229112] [2024-11-13 12:58:06,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:06,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:06,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:06,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:06,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:06,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959621, now seen corresponding path program 1 times [2024-11-13 12:58:06,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:06,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831075761] [2024-11-13 12:58:06,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:06,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:06,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:06,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831075761] [2024-11-13 12:58:06,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831075761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:58:06,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749932230] [2024-11-13 12:58:06,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:06,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:58:06,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:06,679 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:58:06,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 12:58:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:06,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 12:58:06,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:58:06,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 12:58:06,891 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 12:58:06,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-13 12:58:06,927 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-13 12:58:06,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 12:58:07,125 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 12:58:07,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-13 12:58:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:07,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:58:07,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-13 12:58:07,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-13 12:58:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:58:07,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749932230] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:58:07,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:58:07,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 21 [2024-11-13 12:58:07,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532000733] [2024-11-13 12:58:07,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:58:07,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:07,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 12:58:07,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-11-13 12:58:07,488 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 22 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:08,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:08,302 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2024-11-13 12:58:08,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2024-11-13 12:58:08,303 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-13 12:58:08,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2024-11-13 12:58:08,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-13 12:58:08,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-13 12:58:08,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2024-11-13 12:58:08,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:58:08,304 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-13 12:58:08,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2024-11-13 12:58:08,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 17. [2024-11-13 12:58:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-13 12:58:08,308 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-13 12:58:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:58:08,309 INFO L424 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-13 12:58:08,309 INFO L331 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-13 12:58:08,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-11-13 12:58:08,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:08,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:58:08,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:58:08,310 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:08,310 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-13 12:58:08,310 INFO L745 eck$LassoCheckResult]: Stem: 709#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 710#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 711#L367 assume !(main_~length~0#1 < 1); 704#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 705#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 706#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 716#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 719#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 717#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 714#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 715#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 718#L370-2 assume !(main_~i~0#1 < main_~length~0#1); 712#L370-3 main_~j~0#1 := 0; 713#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 707#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 708#L378-2 [2024-11-13 12:58:08,311 INFO L747 eck$LassoCheckResult]: Loop: 708#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 720#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 708#L378-2 [2024-11-13 12:58:08,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:08,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701317, now seen corresponding path program 2 times [2024-11-13 12:58:08,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:08,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453533018] [2024-11-13 12:58:08,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:08,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:08,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:08,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:08,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:08,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2276, now seen corresponding path program 6 times [2024-11-13 12:58:08,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:08,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607035992] [2024-11-13 12:58:08,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:08,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:08,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:08,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:08,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash -686023330, now seen corresponding path program 2 times [2024-11-13 12:58:08,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:08,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501644336] [2024-11-13 12:58:08,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:08,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:08,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501644336] [2024-11-13 12:58:08,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501644336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:58:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086104254] [2024-11-13 12:58:08,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:58:08,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:58:08,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:08,675 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:58:08,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 12:58:08,761 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:58:08,762 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:58:08,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 12:58:08,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:58:08,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 12:58:09,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 12:58:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:09,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:58:09,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-11-13 12:58:09,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-13 12:58:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:09,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086104254] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:58:09,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:58:09,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2024-11-13 12:58:09,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922896400] [2024-11-13 12:58:09,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:58:09,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:09,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 12:58:09,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:58:09,269 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:09,567 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-11-13 12:58:09,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2024-11-13 12:58:09,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-13 12:58:09,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2024-11-13 12:58:09,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-13 12:58:09,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-13 12:58:09,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2024-11-13 12:58:09,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:58:09,573 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-13 12:58:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2024-11-13 12:58:09,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2024-11-13 12:58:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-13 12:58:09,575 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-13 12:58:09,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:58:09,580 INFO L424 stractBuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-13 12:58:09,580 INFO L331 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-13 12:58:09,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2024-11-13 12:58:09,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:09,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:58:09,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:58:09,581 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:09,581 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-13 12:58:09,582 INFO L745 eck$LassoCheckResult]: Stem: 883#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 884#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 885#L367 assume !(main_~length~0#1 < 1); 878#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 879#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 880#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 890#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 895#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 891#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 887#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 888#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 892#L370-2 assume !(main_~i~0#1 < main_~length~0#1); 893#L370-3 main_~j~0#1 := 0; 898#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 881#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 882#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 889#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 897#L378-2 [2024-11-13 12:58:09,582 INFO L747 eck$LassoCheckResult]: Loop: 897#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 896#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 897#L378-2 [2024-11-13 12:58:09,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:09,582 INFO L85 PathProgramCache]: Analyzing trace with hash -686023328, now seen corresponding path program 3 times [2024-11-13 12:58:09,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:09,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749845168] [2024-11-13 12:58:09,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:09,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:09,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:09,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:09,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:09,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2276, now seen corresponding path program 7 times [2024-11-13 12:58:09,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:09,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288407443] [2024-11-13 12:58:09,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:09,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:09,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:09,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:09,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:09,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2138420605, now seen corresponding path program 3 times [2024-11-13 12:58:09,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:09,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942820419] [2024-11-13 12:58:09,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:09,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:09,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:09,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942820419] [2024-11-13 12:58:09,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942820419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:58:09,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140235711] [2024-11-13 12:58:09,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 12:58:09,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:58:09,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:09,847 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:58:09,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 12:58:09,942 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 12:58:09,943 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:58:09,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 12:58:09,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:58:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:10,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:58:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:10,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140235711] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:58:10,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:58:10,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-11-13 12:58:10,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401522373] [2024-11-13 12:58:10,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:58:10,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:10,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 12:58:10,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:58:10,245 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 10 Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:10,378 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-13 12:58:10,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2024-11-13 12:58:10,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:10,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 37 transitions. [2024-11-13 12:58:10,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-13 12:58:10,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-13 12:58:10,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2024-11-13 12:58:10,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:58:10,384 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-13 12:58:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2024-11-13 12:58:10,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-13 12:58:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-13 12:58:10,389 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-13 12:58:10,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:58:10,390 INFO L424 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-13 12:58:10,393 INFO L331 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-13 12:58:10,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2024-11-13 12:58:10,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:10,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:58:10,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:58:10,395 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:10,395 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-13 12:58:10,395 INFO L745 eck$LassoCheckResult]: Stem: 1069#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1070#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1071#L367 assume !(main_~length~0#1 < 1); 1064#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1065#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1066#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1077#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1079#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1080#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1082#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1083#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1078#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1074#L372 assume main_#t~mem208#1 > 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1075#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1088#L370-2 assume !(main_~i~0#1 < main_~length~0#1); 1087#L370-3 main_~j~0#1 := 0; 1068#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1086#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1085#L378-2 [2024-11-13 12:58:10,395 INFO L747 eck$LassoCheckResult]: Loop: 1085#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1084#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1085#L378-2 [2024-11-13 12:58:10,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:10,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1742222851, now seen corresponding path program 1 times [2024-11-13 12:58:10,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:10,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619186402] [2024-11-13 12:58:10,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:10,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:10,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:10,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:10,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:10,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2276, now seen corresponding path program 8 times [2024-11-13 12:58:10,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:10,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95806570] [2024-11-13 12:58:10,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:10,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:10,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:10,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:10,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash -761084314, now seen corresponding path program 1 times [2024-11-13 12:58:10,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:10,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296526150] [2024-11-13 12:58:10,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:10,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:11,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:11,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296526150] [2024-11-13 12:58:11,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296526150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:58:11,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349573575] [2024-11-13 12:58:11,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:11,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:58:11,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:11,055 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:58:11,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 12:58:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:11,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 12:58:11,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:58:11,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 12:58:11,281 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-13 12:58:11,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-13 12:58:11,309 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2024-11-13 12:58:11,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-13 12:58:11,871 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 12:58:11,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2024-11-13 12:58:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:11,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:58:12,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-11-13 12:58:12,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-13 12:58:12,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:58:12,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349573575] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:58:12,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:58:12,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 18 [2024-11-13 12:58:12,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156873613] [2024-11-13 12:58:12,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:58:12,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:12,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 12:58:12,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:58:12,178 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:12,841 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-13 12:58:12,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2024-11-13 12:58:12,842 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-13 12:58:12,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2024-11-13 12:58:12,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-13 12:58:12,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-13 12:58:12,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2024-11-13 12:58:12,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:58:12,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-11-13 12:58:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2024-11-13 12:58:12,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 22. [2024-11-13 12:58:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-13 12:58:12,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-13 12:58:12,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 12:58:12,848 INFO L424 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-13 12:58:12,848 INFO L331 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-13 12:58:12,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2024-11-13 12:58:12,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:12,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:58:12,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:58:12,849 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:12,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-13 12:58:12,850 INFO L745 eck$LassoCheckResult]: Stem: 1280#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1281#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1282#L367 assume !(main_~length~0#1 < 1); 1275#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1276#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1277#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1288#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1290#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1291#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1293#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1294#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1289#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1285#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1286#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1292#L370-2 assume !(main_~i~0#1 < main_~length~0#1); 1283#L370-3 main_~j~0#1 := 0; 1284#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1278#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1279#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1287#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1296#L378-2 [2024-11-13 12:58:12,850 INFO L747 eck$LassoCheckResult]: Loop: 1296#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1295#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1296#L378-2 [2024-11-13 12:58:12,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:12,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1570430938, now seen corresponding path program 4 times [2024-11-13 12:58:12,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:12,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535833300] [2024-11-13 12:58:12,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:12,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:12,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:12,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:12,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2276, now seen corresponding path program 9 times [2024-11-13 12:58:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:12,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484847266] [2024-11-13 12:58:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:12,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:12,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:12,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:12,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1650609207, now seen corresponding path program 4 times [2024-11-13 12:58:12,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:12,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582182879] [2024-11-13 12:58:12,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:12,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:13,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:13,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582182879] [2024-11-13 12:58:13,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582182879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:58:13,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236695180] [2024-11-13 12:58:13,249 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 12:58:13,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:58:13,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:13,252 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:58:13,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 12:58:13,345 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 12:58:13,345 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:58:13,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 12:58:13,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:58:13,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 12:58:13,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-13 12:58:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:13,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:58:13,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-11-13 12:58:13,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-13 12:58:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:13,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236695180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:58:13,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:58:13,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2024-11-13 12:58:13,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186962141] [2024-11-13 12:58:13,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:58:13,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:13,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 12:58:13,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-13 12:58:13,732 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:13,950 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-13 12:58:13,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2024-11-13 12:58:13,951 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-13 12:58:13,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 45 transitions. [2024-11-13 12:58:13,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-13 12:58:13,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-13 12:58:13,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2024-11-13 12:58:13,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:58:13,952 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-13 12:58:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2024-11-13 12:58:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2024-11-13 12:58:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-13 12:58:13,960 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-13 12:58:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:58:13,963 INFO L424 stractBuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-13 12:58:13,963 INFO L331 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-13 12:58:13,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2024-11-13 12:58:13,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:13,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:58:13,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:58:13,964 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:13,964 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-13 12:58:13,965 INFO L745 eck$LassoCheckResult]: Stem: 1488#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1489#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1490#L367 assume !(main_~length~0#1 < 1); 1483#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1484#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1485#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1495#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1500#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1501#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1502#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1503#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1496#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1493#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1494#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1497#L370-2 assume !(main_~i~0#1 < main_~length~0#1); 1498#L370-3 main_~j~0#1 := 0; 1508#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1486#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1487#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1492#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1507#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1506#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1505#L378-2 [2024-11-13 12:58:13,965 INFO L747 eck$LassoCheckResult]: Loop: 1505#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1504#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1505#L378-2 [2024-11-13 12:58:13,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:13,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1650609205, now seen corresponding path program 5 times [2024-11-13 12:58:13,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:13,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352531272] [2024-11-13 12:58:13,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:13,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:13,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:14,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:14,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:14,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2276, now seen corresponding path program 10 times [2024-11-13 12:58:14,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:14,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280042112] [2024-11-13 12:58:14,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:14,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:14,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:14,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:14,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:14,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1392512466, now seen corresponding path program 5 times [2024-11-13 12:58:14,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:14,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645397582] [2024-11-13 12:58:14,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:14,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:14,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:14,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645397582] [2024-11-13 12:58:14,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645397582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:58:14,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114048091] [2024-11-13 12:58:14,216 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 12:58:14,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:58:14,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:14,219 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:58:14,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 12:58:14,330 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-13 12:58:14,330 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:58:14,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 12:58:14,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:58:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:14,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:58:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:14,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114048091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:58:14,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:58:14,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2024-11-13 12:58:14,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710720833] [2024-11-13 12:58:14,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:58:14,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:14,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 12:58:14,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-13 12:58:14,701 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:14,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:14,830 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-13 12:58:14,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-11-13 12:58:14,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:14,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 34 states and 43 transitions. [2024-11-13 12:58:14,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-13 12:58:14,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-13 12:58:14,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2024-11-13 12:58:14,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:58:14,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-13 12:58:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2024-11-13 12:58:14,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-11-13 12:58:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-13 12:58:14,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-13 12:58:14,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:58:14,839 INFO L424 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-13 12:58:14,840 INFO L331 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-13 12:58:14,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2024-11-13 12:58:14,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:14,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:58:14,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:58:14,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:14,842 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-13 12:58:14,842 INFO L745 eck$LassoCheckResult]: Stem: 1719#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1720#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1721#L367 assume !(main_~length~0#1 < 1); 1714#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1715#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1716#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1726#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1736#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1727#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1723#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1724#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1728#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1735#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1734#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1732#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1733#L372 assume main_#t~mem208#1 > 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1731#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1729#L370-2 assume !(main_~i~0#1 < main_~length~0#1); 1722#L370-3 main_~j~0#1 := 0; 1718#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1725#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1740#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1739#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1738#L378-2 [2024-11-13 12:58:14,843 INFO L747 eck$LassoCheckResult]: Loop: 1738#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1737#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1738#L378-2 [2024-11-13 12:58:14,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1476167138, now seen corresponding path program 2 times [2024-11-13 12:58:14,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:14,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683676439] [2024-11-13 12:58:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:14,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:14,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:14,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:14,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:14,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2276, now seen corresponding path program 11 times [2024-11-13 12:58:14,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:14,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725997016] [2024-11-13 12:58:14,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:14,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:14,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:14,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:14,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:14,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1257413253, now seen corresponding path program 2 times [2024-11-13 12:58:14,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:14,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463028897] [2024-11-13 12:58:14,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:14,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:15,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:15,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463028897] [2024-11-13 12:58:15,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463028897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:58:15,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306884089] [2024-11-13 12:58:15,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:58:15,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:58:15,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:15,453 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:58:15,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 12:58:15,562 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:58:15,562 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:58:15,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 12:58:15,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:58:15,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 12:58:15,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:58:15,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 12:58:15,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:58:15,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 12:58:16,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:58:16,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:58:16,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2024-11-13 12:58:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:16,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:58:16,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-11-13 12:58:16,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-13 12:58:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:58:16,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306884089] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:58:16,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:58:16,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 26 [2024-11-13 12:58:16,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798125951] [2024-11-13 12:58:16,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:58:16,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:16,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 12:58:16,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2024-11-13 12:58:16,683 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 11 Second operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:21,921 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2024-11-13 12:58:21,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2024-11-13 12:58:21,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-13 12:58:21,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 58 transitions. [2024-11-13 12:58:21,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-13 12:58:21,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-13 12:58:21,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 58 transitions. [2024-11-13 12:58:21,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:58:21,923 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-13 12:58:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 58 transitions. [2024-11-13 12:58:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 27. [2024-11-13 12:58:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-13 12:58:21,929 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-13 12:58:21,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 12:58:21,934 INFO L424 stractBuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-13 12:58:21,934 INFO L331 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-13 12:58:21,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2024-11-13 12:58:21,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:21,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:58:21,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:58:21,935 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:21,935 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-13 12:58:21,936 INFO L745 eck$LassoCheckResult]: Stem: 1990#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1991#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1992#L367 assume !(main_~length~0#1 < 1); 1985#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1986#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1987#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1998#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 2007#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1999#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2000#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 2001#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2002#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2006#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 2005#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2004#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1995#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1996#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2003#L370-2 assume !(main_~i~0#1 < main_~length~0#1); 1993#L370-3 main_~j~0#1 := 0; 1994#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1988#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1989#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1997#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2011#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2010#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2009#L378-2 [2024-11-13 12:58:21,936 INFO L747 eck$LassoCheckResult]: Loop: 2009#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2008#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2009#L378-2 [2024-11-13 12:58:21,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:21,936 INFO L85 PathProgramCache]: Analyzing trace with hash 864386245, now seen corresponding path program 6 times [2024-11-13 12:58:21,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:21,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227788235] [2024-11-13 12:58:21,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:21,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:21,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:22,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:22,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:22,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2276, now seen corresponding path program 12 times [2024-11-13 12:58:22,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:22,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389444766] [2024-11-13 12:58:22,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:22,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:22,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:22,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:22,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:22,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1746494632, now seen corresponding path program 6 times [2024-11-13 12:58:22,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:22,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378444512] [2024-11-13 12:58:22,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:22,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:22,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:22,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378444512] [2024-11-13 12:58:22,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378444512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:58:22,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678142619] [2024-11-13 12:58:22,597 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 12:58:22,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:58:22,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:22,601 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:58:22,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 12:58:22,724 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-13 12:58:22,725 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:58:22,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 12:58:22,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:58:22,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-13 12:58:23,363 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 12:58:23,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2024-11-13 12:58:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:23,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:58:25,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-13 12:58:25,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2024-11-13 12:58:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:26,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678142619] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:58:26,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:58:26,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2024-11-13 12:58:26,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895332803] [2024-11-13 12:58:26,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:58:26,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:26,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 12:58:26,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2024-11-13 12:58:26,106 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 8 Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:28,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:28,142 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-13 12:58:28,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2024-11-13 12:58:28,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-13 12:58:28,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 47 transitions. [2024-11-13 12:58:28,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-13 12:58:28,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-13 12:58:28,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2024-11-13 12:58:28,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:58:28,144 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-11-13 12:58:28,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2024-11-13 12:58:28,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 21. [2024-11-13 12:58:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-11-13 12:58:28,149 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-13 12:58:28,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 12:58:28,150 INFO L424 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-13 12:58:28,150 INFO L331 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-13 12:58:28,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2024-11-13 12:58:28,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-13 12:58:28,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:58:28,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:58:28,151 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:28,151 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-13 12:58:28,152 INFO L745 eck$LassoCheckResult]: Stem: 2298#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2300#L367 assume !(main_~length~0#1 < 1); 2293#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2294#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2295#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2305#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 2313#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2306#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2302#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 2303#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2304#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2312#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 2311#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2310#L370-2 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2308#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 2309#L372-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2307#L370-2 assume !(main_~i~0#1 < main_~length~0#1); 2301#L370-3 main_~j~0#1 := 0; 2297#L378-2 [2024-11-13 12:58:28,152 INFO L747 eck$LassoCheckResult]: Loop: 2297#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2296#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2297#L378-2 [2024-11-13 12:58:28,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:28,152 INFO L85 PathProgramCache]: Analyzing trace with hash -49003114, now seen corresponding path program 2 times [2024-11-13 12:58:28,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:28,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546876094] [2024-11-13 12:58:28,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:28,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:28,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:28,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:28,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:28,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 1 times [2024-11-13 12:58:28,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:28,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746391664] [2024-11-13 12:58:28,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:28,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:28,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:28,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:28,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:28,186 INFO L85 PathProgramCache]: Analyzing trace with hash 152649019, now seen corresponding path program 7 times [2024-11-13 12:58:28,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:28,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054751427] [2024-11-13 12:58:28,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:28,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:28,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:58:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:58:28,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:58:29,277 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 12:58:29,277 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 12:58:29,277 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 12:58:29,278 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 12:58:29,278 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-13 12:58:29,278 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:29,278 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 12:58:29,278 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 12:58:29,278 INFO L132 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration14_Lasso [2024-11-13 12:58:29,278 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 12:58:29,278 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 12:58:29,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:29,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:29,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:29,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:29,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:29,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:29,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:29,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:29,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:29,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:29,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:58:29,976 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 12:58:29,977 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-13 12:58:29,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:29,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:29,979 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:29,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-13 12:58:29,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:29,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:29,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:58:29,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:29,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:29,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:29,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:58:29,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:58:29,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:30,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-13 12:58:30,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,017 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-13 12:58:30,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:30,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:30,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:58:30,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:30,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:30,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:30,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:58:30,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:58:30,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:30,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-13 12:58:30,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,056 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-13 12:58:30,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:30,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:30,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:58:30,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:30,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:30,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:30,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:58:30,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:58:30,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:30,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-13 12:58:30,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,095 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-13 12:58:30,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:30,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:30,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:58:30,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:30,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:30,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:30,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:58:30,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:58:30,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:30,134 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-13 12:58:30,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,136 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-13 12:58:30,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:30,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:30,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:58:30,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:30,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:30,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:30,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:58:30,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:58:30,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:30,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-13 12:58:30,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,201 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-13 12:58:30,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:30,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:30,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:58:30,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:30,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:30,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:30,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:58:30,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:58:30,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:30,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-13 12:58:30,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,240 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-13 12:58:30,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:30,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:30,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:58:30,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:30,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:30,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:30,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:58:30,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:58:30,260 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:30,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-13 12:58:30,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,279 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-13 12:58:30,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:30,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:30,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:58:30,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:30,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:30,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:30,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:58:30,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:58:30,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:30,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-13 12:58:30,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,318 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-13 12:58:30,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:30,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:30,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:58:30,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:30,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:30,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:30,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:58:30,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:58:30,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:30,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-13 12:58:30,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,368 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-13 12:58:30,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:30,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:30,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:58:30,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:30,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:30,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:30,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:58:30,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:58:30,388 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:30,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-13 12:58:30,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,405 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-13 12:58:30,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:30,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:30,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:30,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:30,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:30,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 12:58:30,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 12:58:30,428 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:30,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-13 12:58:30,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,447 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-13 12:58:30,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:30,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:30,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:30,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:30,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:30,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 12:58:30,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 12:58:30,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:30,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-13 12:58:30,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,519 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-13 12:58:30,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:30,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:30,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:30,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:30,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:30,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 12:58:30,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 12:58:30,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:30,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-13 12:58:30,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,573 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-13 12:58:30,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:30,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:30,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:30,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:30,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:30,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 12:58:30,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 12:58:30,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:30,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-13 12:58:30,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,620 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-13 12:58:30,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:30,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:30,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:30,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:30,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:30,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 12:58:30,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 12:58:30,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:58:30,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-13 12:58:30,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,663 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-13 12:58:30,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 12:58:30,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:58:30,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:58:30,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:58:30,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:58:30,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 12:58:30,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 12:58:30,708 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-13 12:58:30,728 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-13 12:58:30,728 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-13 12:58:30,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:58:30,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:30,731 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:30,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-13 12:58:30,733 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-13 12:58:30,750 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-13 12:58:30,750 INFO L474 LassoAnalysis]: Proved termination. [2024-11-13 12:58:30,750 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-13 12:58:30,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-13 12:58:30,780 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-13 12:58:30,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:30,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 12:58:30,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:58:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:30,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:58:30,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:58:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:30,909 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-13 12:58:30,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:30,933 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 29 transitions. Complement of second has 4 states. [2024-11-13 12:58:30,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-13 12:58:30,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-13 12:58:30,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-13 12:58:30,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 12:58:30,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 21 letters. Loop has 2 letters. [2024-11-13 12:58:30,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 12:58:30,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2024-11-13 12:58:30,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 12:58:30,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2024-11-13 12:58:30,936 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-13 12:58:30,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2024-11-13 12:58:30,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-13 12:58:30,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-13 12:58:30,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-13 12:58:30,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:58:30,937 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 12:58:30,937 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 12:58:30,937 INFO L424 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 12:58:30,937 INFO L331 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-13 12:58:30,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-13 12:58:30,937 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-13 12:58:30,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-13 12:58:30,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.11 12:58:30 BoogieIcfgContainer [2024-11-13 12:58:30,949 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-13 12:58:30,950 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:58:30,950 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:58:30,950 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:58:30,951 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:58:00" (3/4) ... [2024-11-13 12:58:30,954 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 12:58:30,956 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:58:30,958 INFO L158 Benchmark]: Toolchain (without parser) took 31557.55ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 92.2MB in the beginning and 115.2MB in the end (delta: -23.0MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2024-11-13 12:58:30,959 INFO L158 Benchmark]: CDTParser took 1.35ms. Allocated memory is still 117.4MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:58:30,959 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.64ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 74.1MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 12:58:30,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.68ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 72.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:58:30,961 INFO L158 Benchmark]: Boogie Preprocessor took 70.10ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 71.3MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:58:30,961 INFO L158 Benchmark]: RCFGBuilder took 443.71ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 60.8MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:58:30,962 INFO L158 Benchmark]: BuchiAutomizer took 30401.17ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 60.8MB in the beginning and 115.3MB in the end (delta: -54.5MB). Peak memory consumption was 122.4kB. Max. memory is 16.1GB. [2024-11-13 12:58:30,962 INFO L158 Benchmark]: Witness Printer took 6.02ms. Allocated memory is still 176.2MB. Free memory was 115.3MB in the beginning and 115.2MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:58:30,965 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.35ms. Allocated memory is still 117.4MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 570.64ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 74.1MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.68ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 72.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.10ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 71.3MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 443.71ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 60.8MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 30401.17ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 60.8MB in the beginning and 115.3MB in the end (delta: -54.5MB). Peak memory consumption was 122.4kB. Max. memory is 16.1GB. * Witness Printer took 6.02ms. Allocated memory is still 176.2MB. Free memory was 115.3MB in the beginning and 115.2MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~arr~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (12 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function (((long) -1 * j) + length) and consists of 3 locations. 12 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 30.3s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 19.6s. Construction of modules took 2.9s. Büchi inclusion checks took 7.5s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 98 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 422 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 420 mSDsluCounter, 580 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 459 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1847 IncrementalHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 121 mSDtfsCounter, 1847 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc10 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital140 mio100 ax100 hnf100 lsp100 ukn73 mio100 lsp58 div165 bol100 ite100 ukn100 eq146 hnf94 smp71 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 55ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-13 12:58:31,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-13 12:58:31,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 12:58:31,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 12:58:31,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-13 12:58:31,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-13 12:58:31,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-13 12:58:32,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 12:58:32,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 12:58:32,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 12:58:32,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 12:58:32,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 12:58:33,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 12:58:33,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daec0499-8348-4fea-bf5b-8b31f60ec2fb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE