./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 02:14:27,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:14:27,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-23 02:14:27,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:14:27,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:14:27,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:14:27,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:14:27,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:14:27,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:14:27,970 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:14:27,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:14:27,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:14:27,971 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:14:27,973 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:14:27,973 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:14:27,974 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:14:27,974 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:14:27,974 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:14:27,975 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:14:27,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:14:27,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:14:27,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 02:14:27,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:14:27,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 02:14:27,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:14:27,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:14:27,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:14:27,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:14:27,979 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:14:27,979 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:14:27,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 02:14:27,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:14:27,980 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:14:27,980 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:14:27,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:14:27,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:14:27,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:14:27,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:14:27,982 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:14:27,982 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2024-11-23 02:14:28,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:14:28,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:14:28,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:14:28,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:14:28,292 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:14:28,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2024-11-23 02:14:29,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:14:29,887 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:14:29,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2024-11-23 02:14:29,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb3e808c/68ef5c16a6c74edda9ede30c05494197/FLAG6afb00462 [2024-11-23 02:14:29,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb3e808c/68ef5c16a6c74edda9ede30c05494197 [2024-11-23 02:14:29,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:14:29,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:14:29,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:14:29,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:14:29,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:14:29,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:29" (1/1) ... [2024-11-23 02:14:29,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7defedcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:29, skipping insertion in model container [2024-11-23 02:14:29,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:29" (1/1) ... [2024-11-23 02:14:29,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:14:30,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:14:30,191 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:14:30,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:14:30,232 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:14:30,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:30 WrapperNode [2024-11-23 02:14:30,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:14:30,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:14:30,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:14:30,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:14:30,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:30" (1/1) ... [2024-11-23 02:14:30,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:30" (1/1) ... [2024-11-23 02:14:30,275 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 176 [2024-11-23 02:14:30,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:14:30,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:14:30,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:14:30,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:14:30,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:30" (1/1) ... [2024-11-23 02:14:30,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:30" (1/1) ... [2024-11-23 02:14:30,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:30" (1/1) ... [2024-11-23 02:14:30,323 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 9, 3]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-11-23 02:14:30,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:30" (1/1) ... [2024-11-23 02:14:30,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:30" (1/1) ... [2024-11-23 02:14:30,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:30" (1/1) ... [2024-11-23 02:14:30,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:30" (1/1) ... [2024-11-23 02:14:30,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:30" (1/1) ... [2024-11-23 02:14:30,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:30" (1/1) ... [2024-11-23 02:14:30,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:14:30,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:14:30,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:14:30,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:14:30,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:30" (1/1) ... [2024-11-23 02:14:30,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:30,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:30,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:30,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-23 02:14:30,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 02:14:30,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 02:14:30,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 02:14:30,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-23 02:14:30,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 02:14:30,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 02:14:30,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 02:14:30,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-23 02:14:30,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:14:30,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:14:30,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 02:14:30,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 02:14:30,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-23 02:14:30,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 02:14:30,569 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:14:30,573 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:14:30,882 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-23 02:14:30,882 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:14:30,895 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:14:30,895 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-23 02:14:30,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:14:30 BoogieIcfgContainer [2024-11-23 02:14:30,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:14:30,896 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:14:30,897 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:14:30,902 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:14:30,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:14:30,903 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:14:29" (1/3) ... [2024-11-23 02:14:30,904 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@727ed034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:14:30, skipping insertion in model container [2024-11-23 02:14:30,904 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:14:30,904 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:30" (2/3) ... [2024-11-23 02:14:30,907 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@727ed034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:14:30, skipping insertion in model container [2024-11-23 02:14:30,907 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:14:30,907 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:14:30" (3/3) ... [2024-11-23 02:14:30,908 INFO L332 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2024-11-23 02:14:30,957 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:14:30,957 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:14:30,958 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:14:30,958 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:14:30,958 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:14:30,958 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:14:30,958 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:14:30,958 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:14:30,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 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-23 02:14:30,975 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2024-11-23 02:14:30,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:30,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:30,982 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:14:30,983 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:14:30,983 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:14:30,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 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-23 02:14:30,986 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2024-11-23 02:14:30,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:30,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:30,987 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:14:30,987 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:14:30,995 INFO L745 eck$LassoCheckResult]: Stem: 23#$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(48, 2); 26#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 50#L33-3true [2024-11-23 02:14:30,995 INFO L747 eck$LassoCheckResult]: Loop: 50#L33-3true assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 15#L33-2true main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 50#L33-3true [2024-11-23 02:14:31,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:31,001 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-23 02:14:31,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:31,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508569862] [2024-11-23 02:14:31,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:31,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:31,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:31,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:31,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:31,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-11-23 02:14:31,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:31,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545198984] [2024-11-23 02:14:31,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:31,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:31,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:31,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:31,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:31,171 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-23 02:14:31,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:31,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512729120] [2024-11-23 02:14:31,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:31,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:31,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:31,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:31,588 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:14:31,589 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:14:31,589 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:14:31,589 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:14:31,589 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:14:31,589 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:31,590 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:14:31,590 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:14:31,590 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration1_Lasso [2024-11-23 02:14:31,590 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:14:31,593 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:14:31,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:31,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:32,220 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:14:32,226 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:14:32,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-23 02:14:32,233 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-23 02:14:32,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:14:32,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:14:32,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:14:32,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-23 02:14:32,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-23 02:14:32,267 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-23 02:14:32,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:14:32,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:14:32,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:14:32,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-23 02:14:32,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,294 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-23 02:14:32,297 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-23 02:14:32,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:14:32,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:14:32,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:14:32,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-23 02:14:32,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,318 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-23 02:14:32,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:14:32,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:14:32,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:14:32,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:14:32,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-23 02:14:32,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,346 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-23 02:14:32,348 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-23 02:14:32,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:14:32,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:14:32,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:14:32,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-23 02:14:32,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,375 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-23 02:14:32,378 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-23 02:14:32,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:14:32,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:14:32,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:14:32,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-23 02:14:32,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,406 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-23 02:14:32,409 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-23 02:14:32,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:14:32,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:14:32,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:14:32,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-23 02:14:32,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,433 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-23 02:14:32,435 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-23 02:14:32,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:14:32,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:14:32,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:14:32,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-23 02:14:32,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,459 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-23 02:14:32,461 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-23 02:14:32,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:14:32,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:14:32,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:14:32,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-23 02:14:32,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,481 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-23 02:14:32,483 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-23 02:14:32,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:14:32,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:14:32,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-23 02:14:32,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,528 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-23 02:14:32,531 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-23 02:14:32,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:14:32,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:14:32,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-23 02:14:32,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,559 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-23 02:14:32,561 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-23 02:14:32,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:14:32,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:14:32,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-23 02:14:32,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,589 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-23 02:14:32,592 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-23 02:14:32,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:14:32,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:14:32,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-23 02:14:32,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,623 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-23 02:14:32,626 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-23 02:14:32,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:14:32,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:14:32,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-23 02:14:32,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,658 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-23 02:14:32,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-23 02:14:32,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:14:32,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:14:32,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:32,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-23 02:14:32,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,693 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-23 02:14:32,697 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-23 02:14:32,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:32,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:32,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:32,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:32,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:14:32,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:14:32,721 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:14:32,757 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-23 02:14:32,757 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-23 02:14:32,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:32,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:32,761 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:32,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-23 02:14:32,764 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:14:32,777 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:14:32,777 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:14:32,778 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1) = -8*ULTIMATE.start_main_~x~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1 Supporting invariants [] [2024-11-23 02:14:32,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-23 02:14:32,797 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-23 02:14:32,808 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-23 02:14:32,808 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-23 02:14:32,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:14:32,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:14:32,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:14:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:14:32,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:14:32,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:14:32,898 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-23 02:14:32,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-23 02:14:32,946 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:14:32,948 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 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-23 02:14:33,011 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 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) Result 100 states and 155 transitions. Complement of second has 6 states. [2024-11-23 02:14:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:14:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. 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-23 02:14:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2024-11-23 02:14:33,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-23 02:14:33,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:14:33,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-23 02:14:33,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:14:33,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-23 02:14:33,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:14:33,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 155 transitions. [2024-11-23 02:14:33,026 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2024-11-23 02:14:33,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 48 states and 74 transitions. [2024-11-23 02:14:33,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-11-23 02:14:33,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-23 02:14:33,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 74 transitions. [2024-11-23 02:14:33,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:14:33,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 74 transitions. [2024-11-23 02:14:33,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 74 transitions. [2024-11-23 02:14:33,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-23 02:14:33,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 47 states have internal predecessors, (74), 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-23 02:14:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 74 transitions. [2024-11-23 02:14:33,053 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 74 transitions. [2024-11-23 02:14:33,053 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 74 transitions. [2024-11-23 02:14:33,054 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:14:33,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 74 transitions. [2024-11-23 02:14:33,055 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2024-11-23 02:14:33,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:33,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:33,055 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-23 02:14:33,055 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:14:33,056 INFO L745 eck$LassoCheckResult]: Stem: 250#$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(48, 2); 216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 217#L33-3 assume !(main_~x~0#1 < 100000); 209#L33-4 main_~x~0#1 := 0; 210#L39-3 [2024-11-23 02:14:33,056 INFO L747 eck$LassoCheckResult]: Loop: 210#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 224#L40-3 assume !true; 226#L39-2 main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 210#L39-3 [2024-11-23 02:14:33,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:33,057 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-11-23 02:14:33,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:33,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678962515] [2024-11-23 02:14:33,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:33,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:14:33,131 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-23 02:14:33,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:33,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678962515] [2024-11-23 02:14:33,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678962515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:14:33,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:14:33,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:14:33,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257782956] [2024-11-23 02:14:33,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:14:33,135 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:14:33,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:33,136 INFO L85 PathProgramCache]: Analyzing trace with hash 54521, now seen corresponding path program 1 times [2024-11-23 02:14:33,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:33,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456792187] [2024-11-23 02:14:33,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:33,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:14:33,145 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-23 02:14:33,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:33,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456792187] [2024-11-23 02:14:33,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456792187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:14:33,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:14:33,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 02:14:33,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025598755] [2024-11-23 02:14:33,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:14:33,149 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:14:33,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:14:33,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 02:14:33,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 02:14:33,153 INFO L87 Difference]: Start difference. First operand 48 states and 74 transitions. cyclomatic complexity: 31 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-23 02:14:33,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:14:33,158 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2024-11-23 02:14:33,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2024-11-23 02:14:33,159 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2024-11-23 02:14:33,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 39 states and 51 transitions. [2024-11-23 02:14:33,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2024-11-23 02:14:33,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-23 02:14:33,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2024-11-23 02:14:33,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:14:33,161 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-23 02:14:33,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2024-11-23 02:14:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-23 02:14:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 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-23 02:14:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-23 02:14:33,163 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-23 02:14:33,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 02:14:33,164 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-23 02:14:33,164 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:14:33,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2024-11-23 02:14:33,165 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2024-11-23 02:14:33,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:33,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:33,165 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-23 02:14:33,165 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:14:33,165 INFO L745 eck$LassoCheckResult]: Stem: 340#$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(48, 2); 310#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 311#L33-3 assume !(main_~x~0#1 < 100000); 306#L33-4 main_~x~0#1 := 0; 307#L39-3 [2024-11-23 02:14:33,166 INFO L747 eck$LassoCheckResult]: Loop: 307#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 318#L40-3 assume !(main_~y~0#1 < main_~n~0#1); 320#L39-2 main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 307#L39-3 [2024-11-23 02:14:33,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:33,166 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 2 times [2024-11-23 02:14:33,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:33,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137714981] [2024-11-23 02:14:33,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:14:33,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:33,175 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:14:33,175 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:33,211 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-23 02:14:33,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:33,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137714981] [2024-11-23 02:14:33,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137714981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:14:33,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:14:33,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:14:33,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317845930] [2024-11-23 02:14:33,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:14:33,212 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:14:33,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:33,213 INFO L85 PathProgramCache]: Analyzing trace with hash 53839, now seen corresponding path program 1 times [2024-11-23 02:14:33,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:33,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158618938] [2024-11-23 02:14:33,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:33,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:33,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:33,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:33,244 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:14:33,244 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:14:33,244 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:14:33,244 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:14:33,244 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:14:33,244 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:33,244 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:14:33,244 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:14:33,244 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2024-11-23 02:14:33,244 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:14:33,244 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:14:33,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:33,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:33,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:33,276 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:14:33,277 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:14:33,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:33,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:33,281 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:33,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-23 02:14:33,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:14:33,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:14:33,302 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:14:33,302 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:14:33,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-23 02:14:33,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:33,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:33,313 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:33,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-23 02:14:33,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:14:33,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:14:33,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-23 02:14:33,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:33,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:33,338 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:33,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-23 02:14:33,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:14:33,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:14:33,428 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:14:33,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-23 02:14:33,434 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:14:33,434 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:14:33,434 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:14:33,434 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:14:33,434 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:14:33,434 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:33,434 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:14:33,434 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:14:33,434 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2024-11-23 02:14:33,434 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:14:33,435 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:14:33,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:33,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:33,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:14:33,467 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:14:33,467 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:14:33,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:33,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:33,470 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:33,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-23 02:14:33,474 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-23 02:14:33,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:33,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:14:33,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:33,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:33,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:33,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:14:33,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:14:33,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:33,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-23 02:14:33,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:33,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:33,502 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:33,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-23 02:14:33,504 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-23 02:14:33,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:33,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:14:33,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:33,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:33,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:33,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:14:33,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:14:33,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:14:33,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-23 02:14:33,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:33,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:33,529 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:33,532 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-23 02:14:33,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-23 02:14:33,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:14:33,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:14:33,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:14:33,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:14:33,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:14:33,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:14:33,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:14:33,549 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:14:33,553 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:14:33,554 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-23 02:14:33,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:14:33,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:33,557 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:14:33,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-23 02:14:33,558 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:14:33,559 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:14:33,559 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:14:33,559 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2024-11-23 02:14:33,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-23 02:14:33,567 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:14:33,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:14:33,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:14:33,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:14:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:14:33,611 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:14:33,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:14:33,633 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-23 02:14:33,633 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:14:33,634 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:33,662 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 46 states and 62 transitions. Complement of second has 5 states. [2024-11-23 02:14:33,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:14:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-23 02:14:33,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 3 letters. [2024-11-23 02:14:33,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:14:33,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 7 letters. Loop has 3 letters. [2024-11-23 02:14:33,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:14:33,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2024-11-23 02:14:33,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:14:33,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 62 transitions. [2024-11-23 02:14:33,668 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2024-11-23 02:14:33,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 60 transitions. [2024-11-23 02:14:33,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-11-23 02:14:33,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-23 02:14:33,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 60 transitions. [2024-11-23 02:14:33,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:14:33,673 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 60 transitions. [2024-11-23 02:14:33,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 60 transitions. [2024-11-23 02:14:33,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-11-23 02:14:33,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 43 states have internal predecessors, (59), 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-23 02:14:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2024-11-23 02:14:33,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 59 transitions. [2024-11-23 02:14:33,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:14:33,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:14:33,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:14:33,679 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. 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-23 02:14:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:14:33,727 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2024-11-23 02:14:33,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 84 transitions. [2024-11-23 02:14:33,730 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 42 [2024-11-23 02:14:33,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 84 transitions. [2024-11-23 02:14:33,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-11-23 02:14:33,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2024-11-23 02:14:33,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 84 transitions. [2024-11-23 02:14:33,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:14:33,731 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-11-23 02:14:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 84 transitions. [2024-11-23 02:14:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2024-11-23 02:14:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 43 states have internal predecessors, (58), 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-23 02:14:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2024-11-23 02:14:33,737 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 58 transitions. [2024-11-23 02:14:33,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:14:33,738 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2024-11-23 02:14:33,739 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:14:33,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 58 transitions. [2024-11-23 02:14:33,739 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2024-11-23 02:14:33,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:33,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:33,740 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:14:33,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:14:33,740 INFO L745 eck$LassoCheckResult]: Stem: 580#$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(48, 2); 547#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 548#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 578#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 579#L33-3 assume !(main_~x~0#1 < 100000); 541#L33-4 main_~x~0#1 := 0; 542#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 555#L40-3 [2024-11-23 02:14:33,740 INFO L747 eck$LassoCheckResult]: Loop: 555#L40-3 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem5#1 := read~int#1(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem6#1 := read~int#1(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1 != main_#t~mem6#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 556#L13 assume !(0 == __VERIFIER_assert_~cond#1); 543#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1; 544#L40-2 main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 555#L40-3 [2024-11-23 02:14:33,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669547, now seen corresponding path program 1 times [2024-11-23 02:14:33,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:33,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378983366] [2024-11-23 02:14:33,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:33,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:14:33,799 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-23 02:14:33,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:33,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378983366] [2024-11-23 02:14:33,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378983366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:14:33,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224850273] [2024-11-23 02:14:33,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:33,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:14:33,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:33,802 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:14:33,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-23 02:14:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:14:33,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 02:14:33,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:14:33,862 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-23 02:14:33,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:14:33,885 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-23 02:14:33,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224850273] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:14:33,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:14:33,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-23 02:14:33,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938707827] [2024-11-23 02:14:33,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:14:33,886 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:14:33,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:33,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1922577, now seen corresponding path program 1 times [2024-11-23 02:14:33,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:33,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019855516] [2024-11-23 02:14:33,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:33,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:33,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:33,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:33,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:14:33,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 02:14:33,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-23 02:14:33,989 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. cyclomatic complexity: 20 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-23 02:14:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:14:34,109 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2024-11-23 02:14:34,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 173 transitions. [2024-11-23 02:14:34,111 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 84 [2024-11-23 02:14:34,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 137 states and 173 transitions. [2024-11-23 02:14:34,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2024-11-23 02:14:34,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2024-11-23 02:14:34,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 173 transitions. [2024-11-23 02:14:34,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:14:34,114 INFO L218 hiAutomatonCegarLoop]: Abstraction has 137 states and 173 transitions. [2024-11-23 02:14:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 173 transitions. [2024-11-23 02:14:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 50. [2024-11-23 02:14:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 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-23 02:14:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2024-11-23 02:14:34,119 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-11-23 02:14:34,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 02:14:34,122 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-11-23 02:14:34,122 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:14:34,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2024-11-23 02:14:34,123 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2024-11-23 02:14:34,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:34,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:34,123 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2024-11-23 02:14:34,123 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:14:34,123 INFO L745 eck$LassoCheckResult]: Stem: 807#$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(48, 2); 774#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 775#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 805#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 806#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 808#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 813#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 812#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 811#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 810#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 809#L33-3 assume !(main_~x~0#1 < 100000); 768#L33-4 main_~x~0#1 := 0; 769#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 782#L40-3 [2024-11-23 02:14:34,124 INFO L747 eck$LassoCheckResult]: Loop: 782#L40-3 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem5#1 := read~int#1(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem6#1 := read~int#1(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1 != main_#t~mem6#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 783#L13 assume !(0 == __VERIFIER_assert_~cond#1); 770#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1; 771#L40-2 main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 782#L40-3 [2024-11-23 02:14:34,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:34,124 INFO L85 PathProgramCache]: Analyzing trace with hash 82232677, now seen corresponding path program 2 times [2024-11-23 02:14:34,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:34,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311728337] [2024-11-23 02:14:34,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:14:34,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:34,139 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:14:34,139 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-23 02:14:34,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:34,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311728337] [2024-11-23 02:14:34,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311728337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:14:34,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:14:34,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:14:34,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536345253] [2024-11-23 02:14:34,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:14:34,177 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:14:34,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:34,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1922577, now seen corresponding path program 2 times [2024-11-23 02:14:34,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:34,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702089205] [2024-11-23 02:14:34,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:14:34,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:34,183 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:14:34,183 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:14:34,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:34,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:34,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:14:34,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:14:34,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-23 02:14:34,266 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. cyclomatic complexity: 20 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:14:34,296 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2024-11-23 02:14:34,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 64 transitions. [2024-11-23 02:14:34,298 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-23 02:14:34,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 50 states and 62 transitions. [2024-11-23 02:14:34,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-23 02:14:34,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-23 02:14:34,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 62 transitions. [2024-11-23 02:14:34,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:14:34,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 62 transitions. [2024-11-23 02:14:34,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 62 transitions. [2024-11-23 02:14:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-23 02:14:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 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-23 02:14:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2024-11-23 02:14:34,305 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 62 transitions. [2024-11-23 02:14:34,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:14:34,307 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2024-11-23 02:14:34,307 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:14:34,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 62 transitions. [2024-11-23 02:14:34,307 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-23 02:14:34,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:34,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:34,309 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-11-23 02:14:34,309 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:14:34,309 INFO L745 eck$LassoCheckResult]: Stem: 913#$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(48, 2); 878#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 879#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 909#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 910#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 914#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 919#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 918#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 917#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 916#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 915#L33-3 assume !(main_~x~0#1 < 100000); 876#L33-4 main_~x~0#1 := 0; 877#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 895#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 896#L47-3 [2024-11-23 02:14:34,309 INFO L747 eck$LassoCheckResult]: Loop: 896#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#2(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1; 897#L47-2 main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 896#L47-3 [2024-11-23 02:14:34,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:34,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754313, now seen corresponding path program 1 times [2024-11-23 02:14:34,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:34,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040717500] [2024-11-23 02:14:34,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:34,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:14:34,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-23 02:14:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:34,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:34,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040717500] [2024-11-23 02:14:34,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040717500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:14:34,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370988670] [2024-11-23 02:14:34,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:34,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:14:34,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:34,464 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:14:34,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-23 02:14:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:14:34,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:14:34,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:14:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:34,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:14:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:34,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370988670] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:14:34,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:14:34,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-23 02:14:34,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908713464] [2024-11-23 02:14:34,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:14:34,602 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:14:34,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:34,603 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2024-11-23 02:14:34,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:34,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584838026] [2024-11-23 02:14:34,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:14:34,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:34,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:34,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:34,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:14:34,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 02:14:34,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-23 02:14:34,658 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. cyclomatic complexity: 17 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:14:34,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:14:34,826 INFO L93 Difference]: Finished difference Result 182 states and 224 transitions. [2024-11-23 02:14:34,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 224 transitions. [2024-11-23 02:14:34,828 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 134 [2024-11-23 02:14:34,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 224 transitions. [2024-11-23 02:14:34,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2024-11-23 02:14:34,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2024-11-23 02:14:34,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 224 transitions. [2024-11-23 02:14:34,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:14:34,834 INFO L218 hiAutomatonCegarLoop]: Abstraction has 182 states and 224 transitions. [2024-11-23 02:14:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 224 transitions. [2024-11-23 02:14:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 62. [2024-11-23 02:14:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 61 states have internal predecessors, (74), 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-23 02:14:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2024-11-23 02:14:34,842 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 74 transitions. [2024-11-23 02:14:34,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 02:14:34,847 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 74 transitions. [2024-11-23 02:14:34,847 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 02:14:34,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 74 transitions. [2024-11-23 02:14:34,847 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-23 02:14:34,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:34,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:34,848 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2024-11-23 02:14:34,848 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:14:34,848 INFO L745 eck$LassoCheckResult]: Stem: 1233#$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(48, 2); 1207#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 1208#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1231#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1232#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1235#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1255#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1254#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1253#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1252#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1251#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1250#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1249#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1248#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1247#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1246#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1245#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1244#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1243#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1242#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1241#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1237#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1236#L33-3 assume !(main_~x~0#1 < 100000); 1203#L33-4 main_~x~0#1 := 0; 1204#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 1221#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 1222#L47-3 [2024-11-23 02:14:34,848 INFO L747 eck$LassoCheckResult]: Loop: 1222#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#2(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1; 1223#L47-2 main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1222#L47-3 [2024-11-23 02:14:34,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:34,849 INFO L85 PathProgramCache]: Analyzing trace with hash -95702845, now seen corresponding path program 2 times [2024-11-23 02:14:34,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:34,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652118046] [2024-11-23 02:14:34,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:14:34,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:34,878 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:14:34,878 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:35,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:35,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652118046] [2024-11-23 02:14:35,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652118046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:14:35,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853306657] [2024-11-23 02:14:35,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:14:35,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:14:35,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:35,113 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:14:35,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-23 02:14:35,177 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:14:35,178 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:35,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-23 02:14:35,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:14:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:35,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:14:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:35,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853306657] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:14:35,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:14:35,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-23 02:14:35,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991759874] [2024-11-23 02:14:35,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:14:35,444 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:14:35,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:35,445 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 2 times [2024-11-23 02:14:35,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:35,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400317980] [2024-11-23 02:14:35,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:14:35,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:35,465 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:14:35,465 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:14:35,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:35,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:35,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:14:35,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-23 02:14:35,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-23 02:14:35,512 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. cyclomatic complexity: 17 Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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-23 02:14:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:14:35,871 INFO L93 Difference]: Finished difference Result 350 states and 428 transitions. [2024-11-23 02:14:35,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 428 transitions. [2024-11-23 02:14:35,875 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 254 [2024-11-23 02:14:35,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 350 states and 428 transitions. [2024-11-23 02:14:35,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2024-11-23 02:14:35,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2024-11-23 02:14:35,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 350 states and 428 transitions. [2024-11-23 02:14:35,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:14:35,882 INFO L218 hiAutomatonCegarLoop]: Abstraction has 350 states and 428 transitions. [2024-11-23 02:14:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 428 transitions. [2024-11-23 02:14:35,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 86. [2024-11-23 02:14:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 85 states have internal predecessors, (98), 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-23 02:14:35,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-11-23 02:14:35,889 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-11-23 02:14:35,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-23 02:14:35,891 INFO L425 stractBuchiCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-11-23 02:14:35,891 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-23 02:14:35,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 98 transitions. [2024-11-23 02:14:35,891 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-23 02:14:35,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:35,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:35,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1, 1, 1] [2024-11-23 02:14:35,893 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:14:35,893 INFO L745 eck$LassoCheckResult]: Stem: 1825#$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(48, 2); 1795#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 1796#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1827#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1828#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1823#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1824#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1870#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1869#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1868#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1867#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1866#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1865#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1864#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1863#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1862#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1861#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1860#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1859#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1858#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1857#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1856#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1855#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1854#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1853#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1852#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1851#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1850#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1849#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1848#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1847#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1846#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1845#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1844#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1843#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1842#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1841#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1840#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1839#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1838#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1837#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1836#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1835#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1832#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1831#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1830#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1829#L33-3 assume !(main_~x~0#1 < 100000); 1793#L33-4 main_~x~0#1 := 0; 1794#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 1812#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 1813#L47-3 [2024-11-23 02:14:35,893 INFO L747 eck$LassoCheckResult]: Loop: 1813#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#2(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1; 1814#L47-2 main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1813#L47-3 [2024-11-23 02:14:35,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:35,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1293970907, now seen corresponding path program 3 times [2024-11-23 02:14:35,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:35,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845775034] [2024-11-23 02:14:35,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:14:35,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:35,956 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2024-11-23 02:14:35,956 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:36,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:36,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845775034] [2024-11-23 02:14:36,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845775034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:14:36,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196780287] [2024-11-23 02:14:36,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:14:36,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:14:36,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:36,567 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:14:36,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-23 02:14:37,110 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2024-11-23 02:14:37,110 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:37,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-23 02:14:37,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:14:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:37,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:14:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:38,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196780287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:14:38,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:14:38,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-11-23 02:14:38,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563420048] [2024-11-23 02:14:38,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:14:38,053 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:14:38,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:38,053 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 3 times [2024-11-23 02:14:38,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:38,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888846771] [2024-11-23 02:14:38,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:14:38,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:38,058 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:14:38,059 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:14:38,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:38,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:38,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:14:38,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-23 02:14:38,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-23 02:14:38,105 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. cyclomatic complexity: 17 Second operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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-23 02:14:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:14:38,976 INFO L93 Difference]: Finished difference Result 686 states and 836 transitions. [2024-11-23 02:14:38,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 686 states and 836 transitions. [2024-11-23 02:14:38,981 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 494 [2024-11-23 02:14:38,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 686 states to 686 states and 836 transitions. [2024-11-23 02:14:38,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 594 [2024-11-23 02:14:38,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 594 [2024-11-23 02:14:38,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 686 states and 836 transitions. [2024-11-23 02:14:38,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:14:38,985 INFO L218 hiAutomatonCegarLoop]: Abstraction has 686 states and 836 transitions. [2024-11-23 02:14:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states and 836 transitions. [2024-11-23 02:14:38,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 134. [2024-11-23 02:14:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 1.0895522388059702) internal successors, (146), 133 states have internal predecessors, (146), 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-23 02:14:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2024-11-23 02:14:38,993 INFO L240 hiAutomatonCegarLoop]: Abstraction has 134 states and 146 transitions. [2024-11-23 02:14:38,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-23 02:14:38,996 INFO L425 stractBuchiCegarLoop]: Abstraction has 134 states and 146 transitions. [2024-11-23 02:14:38,997 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-23 02:14:38,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 146 transitions. [2024-11-23 02:14:38,998 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-23 02:14:38,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:38,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:39,002 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1, 1, 1] [2024-11-23 02:14:39,002 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:14:39,003 INFO L745 eck$LassoCheckResult]: Stem: 2941#$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(48, 2); 2913#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 2914#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2939#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2940#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2943#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3035#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3034#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3033#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3032#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3031#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3030#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3029#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3028#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3027#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3026#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3025#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3024#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3023#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3022#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3021#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3020#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3019#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3018#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3017#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3016#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3015#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3014#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3013#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3012#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3011#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3010#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3009#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3008#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3007#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3006#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3005#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3004#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3003#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3002#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3001#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3000#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2999#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2998#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2997#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2996#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2995#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2994#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2993#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2992#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2991#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2990#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2989#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2988#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2987#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2986#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2985#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2984#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2983#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2982#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2981#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2980#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2979#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2978#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2977#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2976#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2975#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2974#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2973#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2972#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2971#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2970#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2969#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2968#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2967#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2966#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2965#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2964#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2963#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2962#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2961#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2960#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2959#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2958#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2957#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2956#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2955#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2954#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2953#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2952#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2951#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2950#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2949#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2945#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2944#L33-3 assume !(main_~x~0#1 < 100000); 2911#L33-4 main_~x~0#1 := 0; 2912#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 2929#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 2930#L47-3 [2024-11-23 02:14:39,004 INFO L747 eck$LassoCheckResult]: Loop: 2930#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#2(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1; 2931#L47-2 main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2930#L47-3 [2024-11-23 02:14:39,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:39,007 INFO L85 PathProgramCache]: Analyzing trace with hash -675114997, now seen corresponding path program 4 times [2024-11-23 02:14:39,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:39,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716039377] [2024-11-23 02:14:39,007 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:14:39,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:39,076 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:14:39,079 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:40,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:40,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716039377] [2024-11-23 02:14:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716039377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:14:40,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852819810] [2024-11-23 02:14:40,843 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:14:40,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:14:40,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:40,846 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:14:40,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-23 02:14:41,008 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:14:41,008 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:41,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-23 02:14:41,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:14:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:41,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:14:43,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:43,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852819810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:14:43,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:14:43,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2024-11-23 02:14:43,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682835569] [2024-11-23 02:14:43,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:14:43,659 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:14:43,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 4 times [2024-11-23 02:14:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:43,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615270896] [2024-11-23 02:14:43,660 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:14:43,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:43,665 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:14:43,665 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:14:43,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:14:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:14:43,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:14:43,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:14:43,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-11-23 02:14:43,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-11-23 02:14:43,714 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. cyclomatic complexity: 17 Second operand has 96 states, 96 states have (on average 2.0) internal successors, (192), 96 states have internal predecessors, (192), 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-23 02:14:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:14:47,635 INFO L93 Difference]: Finished difference Result 1358 states and 1652 transitions. [2024-11-23 02:14:47,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1358 states and 1652 transitions. [2024-11-23 02:14:47,643 INFO L131 ngComponentsAnalysis]: Automaton has 98 accepting balls. 974 [2024-11-23 02:14:47,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1358 states to 1358 states and 1652 transitions. [2024-11-23 02:14:47,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1170 [2024-11-23 02:14:47,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1170 [2024-11-23 02:14:47,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1358 states and 1652 transitions. [2024-11-23 02:14:47,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:14:47,652 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1358 states and 1652 transitions. [2024-11-23 02:14:47,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states and 1652 transitions. [2024-11-23 02:14:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 230. [2024-11-23 02:14:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 230 states have (on average 1.0521739130434782) internal successors, (242), 229 states have internal predecessors, (242), 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-23 02:14:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 242 transitions. [2024-11-23 02:14:47,665 INFO L240 hiAutomatonCegarLoop]: Abstraction has 230 states and 242 transitions. [2024-11-23 02:14:47,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-23 02:14:47,670 INFO L425 stractBuchiCegarLoop]: Abstraction has 230 states and 242 transitions. [2024-11-23 02:14:47,670 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-23 02:14:47,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 242 transitions. [2024-11-23 02:14:47,671 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-23 02:14:47,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:14:47,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:14:47,676 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1, 1, 1] [2024-11-23 02:14:47,676 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:14:47,677 INFO L745 eck$LassoCheckResult]: Stem: 5116#$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(48, 2); 5086#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 5087#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5118#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5119#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5114#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5115#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5305#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5304#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5303#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5302#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5301#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5300#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5299#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5298#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5297#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5296#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5295#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5294#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5293#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5292#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5291#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5290#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5289#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5288#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5287#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5286#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5285#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5284#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5283#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5282#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5281#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5280#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5279#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5278#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5277#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5276#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5275#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5274#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5273#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5272#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5271#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5270#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5269#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5268#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5267#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5266#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5265#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5264#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5263#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5262#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5261#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5260#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5259#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5258#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5257#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5256#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5255#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5254#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5253#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5252#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5251#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5250#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5249#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5248#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5247#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5246#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5245#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5244#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5243#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5242#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5241#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5240#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5239#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5238#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5237#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5236#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5235#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5234#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5233#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5232#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5231#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5230#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5229#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5228#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5227#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5226#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5225#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5224#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5223#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5222#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5221#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5220#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5219#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5218#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5217#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5216#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5215#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5214#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5213#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5212#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5211#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5210#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5209#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5208#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5207#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5206#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5205#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5204#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5203#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5202#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5201#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5200#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5199#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5198#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5197#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5196#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5195#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5194#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5193#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5192#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5191#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5190#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5189#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5188#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5187#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5186#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5185#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5184#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5183#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5182#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5181#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5180#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5179#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5178#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5177#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5176#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5175#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5174#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5173#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5172#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5171#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5170#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5169#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5168#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5167#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5166#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5165#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5164#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5163#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5162#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5161#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5160#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5159#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5158#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5157#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5156#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5155#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5154#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5153#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5152#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5151#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5150#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5149#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5148#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5147#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5146#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5145#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5144#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5143#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5142#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5141#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5140#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5139#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5138#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5137#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5136#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5135#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5134#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5133#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5132#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5131#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5130#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5129#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5128#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5127#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5126#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5123#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5122#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5121#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5120#L33-3 assume !(main_~x~0#1 < 100000); 5084#L33-4 main_~x~0#1 := 0; 5085#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 5103#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 5104#L47-3 [2024-11-23 02:14:47,678 INFO L747 eck$LassoCheckResult]: Loop: 5104#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#2(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1; 5105#L47-2 main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5104#L47-3 [2024-11-23 02:14:47,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:14:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1064733589, now seen corresponding path program 5 times [2024-11-23 02:14:47,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:14:47,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166356974] [2024-11-23 02:14:47,679 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:14:47,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:14:48,136 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 95 check-sat command(s) [2024-11-23 02:14:48,137 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:14:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:14:53,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:14:53,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166356974] [2024-11-23 02:14:53,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166356974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:14:53,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929964493] [2024-11-23 02:14:53,652 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:14:53,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:14:53,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:14:53,655 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:14:53,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process