./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/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_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/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 32bit --witnessprinter.graph.data.programhash fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:00:43,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:00:43,591 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-13 13:00:43,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:00:43,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:00:43,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:00:43,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:00:43,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:00:43,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:00:43,622 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:00:43,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:00:43,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:00:43,623 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:00:43,623 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 13:00:43,623 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 13:00:43,623 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 13:00:43,623 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 13:00:43,623 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 13:00:43,623 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 13:00:43,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:00:43,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 13:00:43,624 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:00:43,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:00:43,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:00:43,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:00:43,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 13:00:43,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 13:00:43,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 13:00:43,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:00:43,625 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:00:43,625 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:00:43,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:00:43,626 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 13:00:43,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:00:43,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:00:43,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:00:43,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:00:43,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:00:43,627 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 13:00:43,627 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_6bec4bfc-cf07-41b0-b841-2c8ca570891f/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 [2024-11-13 13:00:43,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:00:43,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:00:43,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:00:43,923 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:00:43,924 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:00:43,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i Unable to find full path for "g++" [2024-11-13 13:00:45,861 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:00:46,186 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:00:46,187 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2024-11-13 13:00:46,194 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/data/1d8124882/a5ac05b6362e47c6a5f8b8afc7d0bd9f/FLAG0fa15ea0f [2024-11-13 13:00:46,439 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/data/1d8124882/a5ac05b6362e47c6a5f8b8afc7d0bd9f [2024-11-13 13:00:46,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:00:46,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:00:46,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:00:46,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:00:46,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:00:46,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:00:46" (1/1) ... [2024-11-13 13:00:46,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5bbfe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:46, skipping insertion in model container [2024-11-13 13:00:46,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:00:46" (1/1) ... [2024-11-13 13:00:46,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:00:46,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:00:46,663 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:00:46,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:00:46,692 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:00:46,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:46 WrapperNode [2024-11-13 13:00:46,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:00:46,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:00:46,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:00:46,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:00:46,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:46" (1/1) ... [2024-11-13 13:00:46,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:46" (1/1) ... [2024-11-13 13:00:46,727 INFO L138 Inliner]: procedures = 15, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2024-11-13 13:00:46,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:00:46,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:00:46,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:00:46,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:00:46,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:46" (1/1) ... [2024-11-13 13:00:46,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:46" (1/1) ... [2024-11-13 13:00:46,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:46" (1/1) ... [2024-11-13 13:00:46,761 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-13 13:00:46,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:46" (1/1) ... [2024-11-13 13:00:46,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:46" (1/1) ... [2024-11-13 13:00:46,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:46" (1/1) ... [2024-11-13 13:00:46,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:46" (1/1) ... [2024-11-13 13:00:46,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:46" (1/1) ... [2024-11-13 13:00:46,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:46" (1/1) ... [2024-11-13 13:00:46,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:00:46,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:00:46,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:00:46,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:00:46,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:46" (1/1) ... [2024-11-13 13:00:46,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:00:46,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:46,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:00:46,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-13 13:00:46,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:00:46,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:00:46,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:00:46,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 13:00:46,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 13:00:46,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 13:00:46,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:00:46,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:00:46,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 13:00:46,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 13:00:46,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:00:46,953 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:00:46,955 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:00:47,122 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 13:00:47,123 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:00:47,131 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:00:47,131 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 13:00:47,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:00:47 BoogieIcfgContainer [2024-11-13 13:00:47,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:00:47,133 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 13:00:47,133 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 13:00:47,137 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 13:00:47,138 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 13:00:47,138 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 01:00:46" (1/3) ... [2024-11-13 13:00:47,139 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5447319d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 01:00:47, skipping insertion in model container [2024-11-13 13:00:47,139 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 13:00:47,139 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:46" (2/3) ... [2024-11-13 13:00:47,139 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5447319d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 01:00:47, skipping insertion in model container [2024-11-13 13:00:47,139 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 13:00:47,140 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:00:47" (3/3) ... [2024-11-13 13:00:47,141 INFO L333 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2024-11-13 13:00:47,198 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 13:00:47,198 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 13:00:47,199 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 13:00:47,199 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 13:00:47,200 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 13:00:47,200 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 13:00:47,200 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 13:00:47,200 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 13:00:47,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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 13:00:47,226 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-13 13:00:47,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:00:47,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:00:47,232 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:00:47,232 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 13:00:47,232 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 13:00:47,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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 13:00:47,235 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-13 13:00:47,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:00:47,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:00:47,236 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:00:47,236 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 13:00:47,245 INFO L745 eck$LassoCheckResult]: Stem: 14#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 12#L18-2true [2024-11-13 13:00:47,245 INFO L747 eck$LassoCheckResult]: Loop: 12#L18-2true assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 12#L18-2true [2024-11-13 13:00:47,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:47,250 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-13 13:00:47,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:47,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838659173] [2024-11-13 13:00:47,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:47,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:47,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:00:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:47,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:00:47,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash 41, now seen corresponding path program 1 times [2024-11-13 13:00:47,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:47,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635990306] [2024-11-13 13:00:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:47,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:47,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:00:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:47,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:00:47,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:47,395 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-11-13 13:00:47,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:47,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682993681] [2024-11-13 13:00:47,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:47,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:47,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:00:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:47,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:00:47,931 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 13:00:47,932 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 13:00:47,932 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 13:00:47,933 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 13:00:47,933 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-13 13:00:47,933 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:00:47,933 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 13:00:47,934 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 13:00:47,935 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2024-11-13 13:00:47,935 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 13:00:47,935 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 13:00:47,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:00:47,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:00:47,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:00:47,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:00:48,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:00:48,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:00:48,594 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 13:00:48,598 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-13 13:00:48,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:00:48,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:48,603 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:00:48,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-13 13:00:48,606 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 13:00:48,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:00:48,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:00:48,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:00:48,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:00:48,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 13:00:48,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 13:00:48,636 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:00:48,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-13 13:00:48,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:00:48,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:48,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:00:48,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-13 13:00:48,661 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 13:00:48,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:00:48,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:00:48,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:00:48,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:00:48,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 13:00:48,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 13:00:48,687 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:00:48,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-13 13:00:48,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:00:48,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:48,702 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:00:48,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-13 13:00:48,704 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 13:00:48,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:00:48,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 13:00:48,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:00:48,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:00:48,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:00:48,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 13:00:48,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 13:00:48,719 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:00:48,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-13 13:00:48,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:00:48,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:48,738 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:00:48,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-13 13:00:48,740 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 13:00:48,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:00:48,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 13:00:48,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:00:48,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:00:48,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:00:48,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 13:00:48,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 13:00:48,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:00:48,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-13 13:00:48,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:00:48,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:48,782 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:00:48,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-13 13:00:48,785 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 13:00:48,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:00:48,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 13:00:48,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:00:48,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:00:48,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:00:48,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 13:00:48,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 13:00:48,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:00:48,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-13 13:00:48,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:00:48,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:48,826 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:00:48,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-13 13:00:48,830 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 13:00:48,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:00:48,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 13:00:48,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:00:48,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:00:48,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:00:48,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 13:00:48,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 13:00:48,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:00:48,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-13 13:00:48,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:00:48,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:48,875 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:00:48,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-13 13:00:48,878 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 13:00:48,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:00:48,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:00:48,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:00:48,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:00:48,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 13:00:48,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 13:00:48,922 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-13 13:00:48,950 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-13 13:00:48,954 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-13 13:00:48,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:00:48,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:48,959 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:00:48,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-13 13:00:48,963 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-13 13:00:48,981 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-13 13:00:48,982 INFO L474 LassoAnalysis]: Proved termination. [2024-11-13 13:00:48,982 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 199999 Supporting invariants [] [2024-11-13 13:00:49,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-13 13:00:49,021 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-13 13:00:49,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:49,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:00:49,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:49,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:00:49,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:49,103 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 13:00:49,132 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-13 13:00:49,134 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 13:00:49,175 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 30 states and 42 transitions. Complement of second has 4 states. [2024-11-13 13:00:49,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-13 13:00:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 13:00:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2024-11-13 13:00:49,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 2 letters. Loop has 1 letters. [2024-11-13 13:00:49,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 13:00:49,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 3 letters. Loop has 1 letters. [2024-11-13 13:00:49,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 13:00:49,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-13 13:00:49,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 13:00:49,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 42 transitions. [2024-11-13 13:00:49,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-13 13:00:49,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 13 states and 18 transitions. [2024-11-13 13:00:49,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-13 13:00:49,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-13 13:00:49,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2024-11-13 13:00:49,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:00:49,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-13 13:00:49,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2024-11-13 13:00:49,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-13 13:00:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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 13:00:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-11-13 13:00:49,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-13 13:00:49,222 INFO L424 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-13 13:00:49,222 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 13:00:49,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-11-13 13:00:49,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-13 13:00:49,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:00:49,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:00:49,223 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-13 13:00:49,223 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-13 13:00:49,223 INFO L745 eck$LassoCheckResult]: Stem: 102#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 103#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 98#L18-2 assume !(main_~i~0#1 < 100000); 99#L18-3 main_~i~0#1 := 0; 96#L22-2 [2024-11-13 13:00:49,223 INFO L747 eck$LassoCheckResult]: Loop: 96#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97#L13 assume !(0 == __VERIFIER_assert_~cond#1); 92#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 101#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 95#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 96#L22-2 [2024-11-13 13:00:49,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:49,224 INFO L85 PathProgramCache]: Analyzing trace with hash 925705, now seen corresponding path program 1 times [2024-11-13 13:00:49,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:49,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766314101] [2024-11-13 13:00:49,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:49,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:49,330 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 13:00:49,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:49,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766314101] [2024-11-13 13:00:49,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766314101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:49,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:49,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:00:49,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245559511] [2024-11-13 13:00:49,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:49,341 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 13:00:49,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:49,342 INFO L85 PathProgramCache]: Analyzing trace with hash 50056923, now seen corresponding path program 1 times [2024-11-13 13:00:49,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:49,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545147174] [2024-11-13 13:00:49,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:49,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:49,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:00:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:49,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:00:49,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:49,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:00:49,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:00:49,644 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 13:00:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:49,754 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-13 13:00:49,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2024-11-13 13:00:49,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-13 13:00:49,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 17 transitions. [2024-11-13 13:00:49,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-13 13:00:49,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-13 13:00:49,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2024-11-13 13:00:49,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:00:49,756 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-13 13:00:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2024-11-13 13:00:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-11-13 13:00:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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 13:00:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-11-13 13:00:49,761 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-13 13:00:49,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:00:49,762 INFO L424 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-13 13:00:49,765 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 13:00:49,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2024-11-13 13:00:49,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-13 13:00:49,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:00:49,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:00:49,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:49,766 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-13 13:00:49,766 INFO L745 eck$LassoCheckResult]: Stem: 138#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 133#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 134#L18-2 assume !(main_~i~0#1 < 100000); 135#L18-3 main_~i~0#1 := 0; 136#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 142#L13 assume !(0 == __VERIFIER_assert_~cond#1); 141#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 137#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 129#L25-2 [2024-11-13 13:00:49,766 INFO L747 eck$LassoCheckResult]: Loop: 129#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 130#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131#L13 assume !(0 == __VERIFIER_assert_~cond#1); 132#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 140#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 129#L25-2 [2024-11-13 13:00:49,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:49,766 INFO L85 PathProgramCache]: Analyzing trace with hash -478104194, now seen corresponding path program 1 times [2024-11-13 13:00:49,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:49,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272959358] [2024-11-13 13:00:49,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:49,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:49,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-13 13:00:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:49,887 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 13:00:49,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:49,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272959358] [2024-11-13 13:00:49,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272959358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:49,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282536683] [2024-11-13 13:00:49,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:49,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:49,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:49,890 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:49,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:00:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:49,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:00:49,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:49,974 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 13:00:49,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:00:49,997 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 13:00:49,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282536683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:00:49,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:00:49,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-13 13:00:49,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395978251] [2024-11-13 13:00:49,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:00:49,998 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 13:00:49,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:49,999 INFO L85 PathProgramCache]: Analyzing trace with hash 70878813, now seen corresponding path program 2 times [2024-11-13 13:00:49,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:49,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946627068] [2024-11-13 13:00:49,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:49,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:50,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:00:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:50,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:00:50,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:50,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:00:50,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:00:50,185 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 13:00:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:50,259 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-11-13 13:00:50,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 32 transitions. [2024-11-13 13:00:50,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-13 13:00:50,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 32 transitions. [2024-11-13 13:00:50,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-13 13:00:50,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-13 13:00:50,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2024-11-13 13:00:50,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:00:50,263 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-13 13:00:50,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2024-11-13 13:00:50,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2024-11-13 13:00:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 states have internal predecessors, (24), 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 13:00:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-13 13:00:50,266 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-13 13:00:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:00:50,267 INFO L424 stractBuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-13 13:00:50,268 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 13:00:50,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2024-11-13 13:00:50,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-13 13:00:50,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:00:50,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:00:50,270 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-13 13:00:50,271 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-13 13:00:50,271 INFO L745 eck$LassoCheckResult]: Stem: 240#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 241#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 234#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 235#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 236#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 244#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 243#L18-2 assume !(main_~i~0#1 < 100000); 237#L18-3 main_~i~0#1 := 0; 238#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 232#L13 assume !(0 == __VERIFIER_assert_~cond#1); 233#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 242#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 248#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 249#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 251#L13 assume !(0 == __VERIFIER_assert_~cond#1); 250#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 239#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 230#L25-2 [2024-11-13 13:00:50,271 INFO L747 eck$LassoCheckResult]: Loop: 230#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 231#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 247#L13 assume !(0 == __VERIFIER_assert_~cond#1); 246#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 245#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 230#L25-2 [2024-11-13 13:00:50,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:50,271 INFO L85 PathProgramCache]: Analyzing trace with hash -94493340, now seen corresponding path program 1 times [2024-11-13 13:00:50,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:50,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332024594] [2024-11-13 13:00:50,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:50,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 13:00:50,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:50,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332024594] [2024-11-13 13:00:50,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332024594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:50,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262889807] [2024-11-13 13:00:50,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:50,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:50,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:50,492 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:50,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 13:00:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:50,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:00:50,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 13:00:50,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:00:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 13:00:50,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262889807] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:00:50,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:00:50,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-13 13:00:50,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545588314] [2024-11-13 13:00:50,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:00:50,675 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 13:00:50,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:50,676 INFO L85 PathProgramCache]: Analyzing trace with hash 70878813, now seen corresponding path program 3 times [2024-11-13 13:00:50,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:50,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262453624] [2024-11-13 13:00:50,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:50,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:50,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:00:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:50,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:00:50,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:50,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 13:00:50,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:00:50,848 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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 13:00:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:50,991 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2024-11-13 13:00:50,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 71 transitions. [2024-11-13 13:00:50,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2024-11-13 13:00:50,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 71 transitions. [2024-11-13 13:00:50,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-11-13 13:00:51,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2024-11-13 13:00:51,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 71 transitions. [2024-11-13 13:00:51,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:00:51,000 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-11-13 13:00:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 71 transitions. [2024-11-13 13:00:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2024-11-13 13:00:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 42 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 13:00:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2024-11-13 13:00:51,007 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 45 transitions. [2024-11-13 13:00:51,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:00:51,008 INFO L424 stractBuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2024-11-13 13:00:51,008 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 13:00:51,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 45 transitions. [2024-11-13 13:00:51,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-13 13:00:51,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:00:51,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:00:51,010 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2024-11-13 13:00:51,010 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-13 13:00:51,011 INFO L745 eck$LassoCheckResult]: Stem: 440#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 441#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 433#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 434#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 435#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 449#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 448#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 447#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 446#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 445#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 444#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 443#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 442#L18-2 assume !(main_~i~0#1 < 100000); 436#L18-3 main_~i~0#1 := 0; 437#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 453#L13 assume !(0 == __VERIFIER_assert_~cond#1); 471#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 470#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 454#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 455#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 452#L13 assume !(0 == __VERIFIER_assert_~cond#1); 450#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 451#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 456#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 469#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 468#L13 assume !(0 == __VERIFIER_assert_~cond#1); 467#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 466#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 465#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 464#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 463#L13 assume !(0 == __VERIFIER_assert_~cond#1); 462#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 461#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 460#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 459#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 458#L13 assume !(0 == __VERIFIER_assert_~cond#1); 457#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 438#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 429#L25-2 [2024-11-13 13:00:51,011 INFO L747 eck$LassoCheckResult]: Loop: 429#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 430#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 431#L13 assume !(0 == __VERIFIER_assert_~cond#1); 432#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 439#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 429#L25-2 [2024-11-13 13:00:51,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:51,011 INFO L85 PathProgramCache]: Analyzing trace with hash -514573670, now seen corresponding path program 2 times [2024-11-13 13:00:51,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:51,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23014896] [2024-11-13 13:00:51,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:51,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 13:00:51,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:51,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23014896] [2024-11-13 13:00:51,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23014896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:51,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884311371] [2024-11-13 13:00:51,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:00:51,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:51,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:51,545 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:51,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 13:00:51,680 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:00:51,680 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:00:51,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 13:00:51,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 13:00:51,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:00:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 13:00:52,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884311371] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:00:52,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:00:52,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-13 13:00:52,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550079865] [2024-11-13 13:00:52,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:00:52,050 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 13:00:52,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:52,051 INFO L85 PathProgramCache]: Analyzing trace with hash 70878813, now seen corresponding path program 4 times [2024-11-13 13:00:52,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:52,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252703828] [2024-11-13 13:00:52,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:52,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:52,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:00:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:52,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:00:52,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:52,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 13:00:52,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-13 13:00:52,220 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. cyclomatic complexity: 4 Second operand has 25 states, 25 states have (on average 1.32) 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 13:00:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:52,533 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2024-11-13 13:00:52,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 149 transitions. [2024-11-13 13:00:52,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2024-11-13 13:00:52,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 137 states and 149 transitions. [2024-11-13 13:00:52,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2024-11-13 13:00:52,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2024-11-13 13:00:52,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 149 transitions. [2024-11-13 13:00:52,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:00:52,539 INFO L218 hiAutomatonCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-11-13 13:00:52,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 149 transitions. [2024-11-13 13:00:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2024-11-13 13:00:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 84 states have internal predecessors, (87), 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 13:00:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2024-11-13 13:00:52,545 INFO L240 hiAutomatonCegarLoop]: Abstraction has 85 states and 87 transitions. [2024-11-13 13:00:52,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 13:00:52,546 INFO L424 stractBuchiCegarLoop]: Abstraction has 85 states and 87 transitions. [2024-11-13 13:00:52,546 INFO L331 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-13 13:00:52,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 87 transitions. [2024-11-13 13:00:52,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-13 13:00:52,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:00:52,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:00:52,550 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 11, 11, 11, 11, 10, 1, 1, 1, 1] [2024-11-13 13:00:52,550 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-13 13:00:52,551 INFO L745 eck$LassoCheckResult]: Stem: 870#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 871#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 863#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 864#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 865#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 891#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 890#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 889#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 888#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 887#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 886#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 885#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 884#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 883#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 882#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 881#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 880#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 879#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 878#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 877#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 876#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 875#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 874#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 873#L18-2 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 872#L18-2 assume !(main_~i~0#1 < 100000); 866#L18-3 main_~i~0#1 := 0; 867#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 895#L13 assume !(0 == __VERIFIER_assert_~cond#1); 943#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 942#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 896#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 897#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 894#L13 assume !(0 == __VERIFIER_assert_~cond#1); 892#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 893#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 898#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 941#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 940#L13 assume !(0 == __VERIFIER_assert_~cond#1); 939#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 938#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 937#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 936#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 935#L13 assume !(0 == __VERIFIER_assert_~cond#1); 934#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 933#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 932#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 931#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 930#L13 assume !(0 == __VERIFIER_assert_~cond#1); 929#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 928#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 927#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 926#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 925#L13 assume !(0 == __VERIFIER_assert_~cond#1); 924#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 923#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 922#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 921#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 920#L13 assume !(0 == __VERIFIER_assert_~cond#1); 919#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 918#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 917#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 916#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 915#L13 assume !(0 == __VERIFIER_assert_~cond#1); 914#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 913#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 912#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 911#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 910#L13 assume !(0 == __VERIFIER_assert_~cond#1); 909#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 908#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 907#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 906#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 905#L13 assume !(0 == __VERIFIER_assert_~cond#1); 904#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 903#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 902#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 901#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 900#L13 assume !(0 == __VERIFIER_assert_~cond#1); 899#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 868#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 859#L25-2 [2024-11-13 13:00:52,551 INFO L747 eck$LassoCheckResult]: Loop: 859#L25-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 860#L22-2 assume !!(main_~i~0#1 < 100000);call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 861#L13 assume !(0 == __VERIFIER_assert_~cond#1); 862#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1; 869#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 859#L25-2 [2024-11-13 13:00:52,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:52,552 INFO L85 PathProgramCache]: Analyzing trace with hash 412262490, now seen corresponding path program 3 times [2024-11-13 13:00:52,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:52,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753007166] [2024-11-13 13:00:52,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:52,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-13 13:00:53,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:53,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753007166] [2024-11-13 13:00:53,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753007166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:53,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101226629] [2024-11-13 13:00:53,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:00:53,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:53,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:53,817 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:53,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 13:00:53,939 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 13:00:53,939 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:00:53,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 13:00:53,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:53,979 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 25 treesize of output 1 [2024-11-13 13:00:54,061 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 23 treesize of output 7 [2024-11-13 13:00:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2024-11-13 13:00:54,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:00:54,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101226629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:54,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:00:54,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [25] total 28 [2024-11-13 13:00:54,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85341260] [2024-11-13 13:00:54,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:54,085 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 13:00:54,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:54,085 INFO L85 PathProgramCache]: Analyzing trace with hash 70878813, now seen corresponding path program 5 times [2024-11-13 13:00:54,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:54,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325681790] [2024-11-13 13:00:54,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:54,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:54,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:00:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:00:54,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:00:54,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:54,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:00:54,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2024-11-13 13:00:54,220 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 13:00:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:54,274 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2024-11-13 13:00:54,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 33 transitions. [2024-11-13 13:00:54,275 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-13 13:00:54,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2024-11-13 13:00:54,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-13 13:00:54,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-13 13:00:54,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-13 13:00:54,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:00:54,275 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 13:00:54,275 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 13:00:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:00:54,276 INFO L424 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 13:00:54,276 INFO L331 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-13 13:00:54,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-13 13:00:54,276 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-13 13:00:54,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-13 13:00:54,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.11 01:00:54 BoogieIcfgContainer [2024-11-13 13:00:54,291 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-13 13:00:54,291 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:00:54,291 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:00:54,291 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:00:54,292 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:00:47" (3/4) ... [2024-11-13 13:00:54,294 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:00:54,295 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:00:54,298 INFO L158 Benchmark]: Toolchain (without parser) took 7852.88ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 92.5MB in the beginning and 97.3MB in the end (delta: -4.8MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-13 13:00:54,298 INFO L158 Benchmark]: CDTParser took 1.03ms. Allocated memory is still 117.4MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:00:54,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.28ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 81.8MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:00:54,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.49ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 80.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:00:54,299 INFO L158 Benchmark]: Boogie Preprocessor took 53.18ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:00:54,299 INFO L158 Benchmark]: RCFGBuilder took 349.04ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 69.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:00:54,299 INFO L158 Benchmark]: BuchiAutomizer took 7157.77ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 69.3MB in the beginning and 97.3MB in the end (delta: -28.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:00:54,299 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 97.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:00:54,302 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.03ms. Allocated memory is still 117.4MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.28ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 81.8MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.49ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 80.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.18ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 349.04ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 69.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 7157.77ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 69.3MB in the beginning and 97.3MB in the end (delta: -28.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 97.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 199999) and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 7 iterations. TraceHistogramMax:22. Analysis of lassos took 6.0s. Construction of modules took 0.4s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 82 StatesRemovedByMinimization, 4 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 310 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 309 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 214 IncrementalHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 38 mSDtfsCounter, 214 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital117 mio100 ax100 hnf100 lsp88 ukn75 mio100 lsp43 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 1 VariablesLoop: 0 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 13:00:54,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-13 13:00:54,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 13:00:54,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 13:00:54,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 13:00:55,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bec4bfc-cf07-41b0-b841-2c8ca570891f/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