./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety/test-0217.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/memsafety/test-0217.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 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 02:33:05,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:33:05,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-23 02:33:05,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:33:05,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:33:05,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:33:05,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:33:05,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:33:05,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:33:05,760 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:33:05,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:33:05,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:33:05,762 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:33:05,762 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:33:05,763 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:33:05,764 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:33:05,764 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:33:05,764 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:33:05,764 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:33:05,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:33:05,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:33:05,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 02:33:05,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:33:05,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 02:33:05,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:33:05,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:33:05,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:33:05,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:33:05,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:33:05,771 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:33:05,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 02:33:05,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:33:05,772 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:33:05,772 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:33:05,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:33:05,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:33:05,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:33:05,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:33:05,774 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:33:05,775 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 -> 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec [2024-11-23 02:33:06,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:33:06,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:33:06,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:33:06,047 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:33:06,048 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:33:06,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0217.i [2024-11-23 02:33:07,550 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:33:07,823 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:33:07,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0217.i [2024-11-23 02:33:07,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7f6b4e4e/08e232ce477645e7b44aa4f35ac2c6ba/FLAGf7487e7a2 [2024-11-23 02:33:07,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7f6b4e4e/08e232ce477645e7b44aa4f35ac2c6ba [2024-11-23 02:33:07,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:33:07,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:33:07,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:33:07,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:33:07,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:33:07,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:33:07" (1/1) ... [2024-11-23 02:33:07,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f64d250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:07, skipping insertion in model container [2024-11-23 02:33:07,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:33:07" (1/1) ... [2024-11-23 02:33:07,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:33:08,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:33:08,334 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:33:08,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:33:08,435 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:33:08,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:08 WrapperNode [2024-11-23 02:33:08,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:33:08,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:33:08,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:33:08,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:33:08,445 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:33:08" (1/1) ... [2024-11-23 02:33:08,471 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:33:08" (1/1) ... [2024-11-23 02:33:08,507 INFO L138 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-23 02:33:08,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:33:08,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:33:08,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:33:08,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:33:08,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:08" (1/1) ... [2024-11-23 02:33:08,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:08" (1/1) ... [2024-11-23 02:33:08,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:08" (1/1) ... [2024-11-23 02:33:08,569 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2024-11-23 02:33:08,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:08" (1/1) ... [2024-11-23 02:33:08,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:08" (1/1) ... [2024-11-23 02:33:08,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:08" (1/1) ... [2024-11-23 02:33:08,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:08" (1/1) ... [2024-11-23 02:33:08,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:08" (1/1) ... [2024-11-23 02:33:08,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:08" (1/1) ... [2024-11-23 02:33:08,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:33:08,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:33:08,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:33:08,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:33:08,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:08" (1/1) ... [2024-11-23 02:33:08,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:33:08,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:33:08,631 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:33:08,635 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:33:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 02:33:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 02:33:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-23 02:33:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-23 02:33:08,672 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-23 02:33:08,672 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-23 02:33:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 02:33:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 02:33:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 02:33:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 02:33:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 02:33:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 02:33:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 02:33:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-23 02:33:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-23 02:33:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 02:33:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 02:33:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:33:08,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:33:08,797 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:33:08,800 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:33:08,803 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-23 02:33:08,865 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-23 02:33:09,178 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-11-23 02:33:09,179 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:33:09,193 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:33:09,195 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-23 02:33:09,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:09 BoogieIcfgContainer [2024-11-23 02:33:09,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:33:09,196 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:33:09,197 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:33:09,201 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:33:09,202 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:33:09,202 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:33:07" (1/3) ... [2024-11-23 02:33:09,203 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e604204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:33:09, skipping insertion in model container [2024-11-23 02:33:09,203 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:33:09,203 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:08" (2/3) ... [2024-11-23 02:33:09,203 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e604204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:33:09, skipping insertion in model container [2024-11-23 02:33:09,203 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:33:09,203 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:09" (3/3) ... [2024-11-23 02:33:09,204 INFO L332 chiAutomizerObserver]: Analyzing ICFG test-0217.i [2024-11-23 02:33:09,262 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:33:09,262 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:33:09,262 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:33:09,262 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:33:09,263 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:33:09,263 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:33:09,263 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:33:09,263 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:33:09,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 53 states, 50 states have (on average 1.52) internal successors, (76), 50 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 02:33:09,293 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2024-11-23 02:33:09,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:33:09,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:33:09,301 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:33:09,301 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:33:09,301 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:33:09,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 53 states, 50 states have (on average 1.52) internal successors, (76), 50 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 02:33:09,308 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2024-11-23 02:33:09,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:33:09,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:33:09,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:33:09,309 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:33:09,317 INFO L745 eck$LassoCheckResult]: Stem: 24#$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(12, 2);call #Ultimate.allocInit(8, 3);~#list~0.base, ~#list~0.offset := 3, 0;call write~init~$Pointer$#1(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); 29#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; 6#L732-3true [2024-11-23 02:33:09,318 INFO L747 eck$LassoCheckResult]: Loop: 6#L732-3true havoc main_#t~nondet28#1; 41#L729-1true assume !!(0 != main_#t~nondet28#1);havoc main_#t~nondet28#1; 19#L730-3true assume !true; 32#L732-2true assume !true; 6#L732-3true [2024-11-23 02:33:09,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:33:09,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2024-11-23 02:33:09,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:33:09,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832792631] [2024-11-23 02:33:09,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:33:09,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:33:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:33:09,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:33:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:33:09,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:33:09,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:33:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1701168, now seen corresponding path program 1 times [2024-11-23 02:33:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:33:09,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460864478] [2024-11-23 02:33:09,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:33:09,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:33:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:33:09,514 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:33:09,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:33:09,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460864478] [2024-11-23 02:33:09,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460864478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:33:09,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:33:09,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 02:33:09,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470598380] [2024-11-23 02:33:09,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:33:09,523 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:33:09,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:33:09,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 02:33:09,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 02:33:09,559 INFO L87 Difference]: Start difference. First operand has 53 states, 50 states have (on average 1.52) internal successors, (76), 50 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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:33:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:33:09,569 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-11-23 02:33:09,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 72 transitions. [2024-11-23 02:33:09,573 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2024-11-23 02:33:09,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 49 states and 68 transitions. [2024-11-23 02:33:09,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-23 02:33:09,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-11-23 02:33:09,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 68 transitions. [2024-11-23 02:33:09,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:33:09,583 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 68 transitions. [2024-11-23 02:33:09,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 68 transitions. [2024-11-23 02:33:09,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-23 02:33:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 46 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 02:33:09,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 68 transitions. [2024-11-23 02:33:09,630 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 68 transitions. [2024-11-23 02:33:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 02:33:09,636 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 68 transitions. [2024-11-23 02:33:09,637 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:33:09,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 68 transitions. [2024-11-23 02:33:09,638 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2024-11-23 02:33:09,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:33:09,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:33:09,639 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:33:09,639 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:33:09,640 INFO L745 eck$LassoCheckResult]: Stem: 147#$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(12, 2);call #Ultimate.allocInit(8, 3);~#list~0.base, ~#list~0.offset := 3, 0;call write~init~$Pointer$#1(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); 148#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; 121#L732-3 [2024-11-23 02:33:09,641 INFO L747 eck$LassoCheckResult]: Loop: 121#L732-3 havoc main_#t~nondet28#1; 122#L729-1 assume !!(0 != main_#t~nondet28#1);havoc main_#t~nondet28#1; 140#L730-3 havoc main_#t~nondet29#1; 141#L730-1 assume !(0 != main_#t~nondet29#1);havoc main_#t~nondet29#1; 137#L732-2 havoc main_#t~nondet31#1; 142#L732 assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; 121#L732-3 [2024-11-23 02:33:09,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:33:09,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 2 times [2024-11-23 02:33:09,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:33:09,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572102839] [2024-11-23 02:33:09,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:33:09,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:33:09,656 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:33:09,657 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:33:09,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:33:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:33:09,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:33:09,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:33:09,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1632021452, now seen corresponding path program 1 times [2024-11-23 02:33:09,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:33:09,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758564950] [2024-11-23 02:33:09,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:33:09,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:33:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:33:09,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:33:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:33:09,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:33:09,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:33:09,699 INFO L85 PathProgramCache]: Analyzing trace with hash 813082702, now seen corresponding path program 1 times [2024-11-23 02:33:09,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:33:09,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113056793] [2024-11-23 02:33:09,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:33:09,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:33:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:33:09,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:33:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:33:09,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:33:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:33:10,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:33:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:33:10,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:33:10 BoogieIcfgContainer [2024-11-23 02:33:10,040 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-23 02:33:10,041 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 02:33:10,041 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 02:33:10,041 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 02:33:10,042 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:09" (3/4) ... [2024-11-23 02:33:10,044 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-23 02:33:10,079 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-23 02:33:10,080 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 02:33:10,080 INFO L158 Benchmark]: Toolchain (without parser) took 2218.94ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 125.4MB in the end (delta: -28.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:33:10,080 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 109.1MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:33:10,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.46ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 120.9MB in the end (delta: -23.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-23 02:33:10,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.05ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 118.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:33:10,084 INFO L158 Benchmark]: Boogie Preprocessor took 87.23ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 114.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-23 02:33:10,085 INFO L158 Benchmark]: RCFGBuilder took 595.44ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 85.3MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-23 02:33:10,085 INFO L158 Benchmark]: BuchiAutomizer took 843.92ms. Allocated memory is still 167.8MB. Free memory was 85.3MB in the beginning and 127.5MB in the end (delta: -42.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:33:10,086 INFO L158 Benchmark]: Witness Printer took 38.70ms. Allocated memory is still 167.8MB. Free memory was 127.5MB in the beginning and 125.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:33:10,091 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.56ms. Allocated memory is still 109.1MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 573.46ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 120.9MB in the end (delta: -23.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.05ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 118.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.23ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 114.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 595.44ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 85.3MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 843.92ms. Allocated memory is still 167.8MB. Free memory was 85.3MB in the beginning and 127.5MB in the end (delta: -42.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 38.70ms. Allocated memory is still 167.8MB. Free memory was 127.5MB in the beginning and 125.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 2 locations. The remainder module has 49 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 72 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 729]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L728] static list_t list; [L728] static list_t list; [L728] static list_t list; VAL [list={3:0}] Loop: [L729] COND TRUE __VERIFIER_nondet_int() [L730] COND FALSE !(__VERIFIER_nondet_int()) [L732] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 729]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L728] static list_t list; [L728] static list_t list; [L728] static list_t list; VAL [list={3:0}] Loop: [L729] COND TRUE __VERIFIER_nondet_int() [L730] COND FALSE !(__VERIFIER_nondet_int()) [L732] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-23 02:33:10,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)