./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme --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 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:02:28,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:02:28,681 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-26 12:02:28,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:02:28,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:02:28,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:02:28,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:02:28,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:02:28,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:02:28,752 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:02:28,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:02:28,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:02:28,753 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:02:28,756 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-26 12:02:28,756 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-26 12:02:28,757 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-26 12:02:28,757 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-26 12:02:28,759 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-26 12:02:28,759 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-26 12:02:28,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:02:28,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-26 12:02:28,761 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:02:28,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:02:28,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:02:28,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:02:28,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-26 12:02:28,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-26 12:02:28,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-26 12:02:28,771 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:02:28,772 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:02:28,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:02:28,774 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-26 12:02:28,774 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:02:28,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:02:28,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:02:28,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:02:28,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:02:28,776 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-26 12:02:28,776 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme 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 -> 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 [2023-11-26 12:02:29,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:02:29,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:02:29,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:02:29,159 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:02:29,160 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:02:29,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2023-11-26 12:02:32,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:02:32,794 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:02:32,795 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2023-11-26 12:02:32,810 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme/data/f9c1fc31f/02ec0ce881cd4005bcc34525b59f3169/FLAG3cd3c30a3 [2023-11-26 12:02:32,825 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme/data/f9c1fc31f/02ec0ce881cd4005bcc34525b59f3169 [2023-11-26 12:02:32,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:02:32,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:02:32,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:02:32,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:02:32,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:02:32,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:32" (1/1) ... [2023-11-26 12:02:32,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f7372b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:32, skipping insertion in model container [2023-11-26 12:02:32,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:32" (1/1) ... [2023-11-26 12:02:32,904 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:02:33,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:02:33,366 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:02:33,450 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:02:33,486 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:02:33,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:33 WrapperNode [2023-11-26 12:02:33,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:02:33,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:02:33,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:02:33,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:02:33,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:33" (1/1) ... [2023-11-26 12:02:33,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:33" (1/1) ... [2023-11-26 12:02:33,565 INFO L138 Inliner]: procedures = 123, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 142 [2023-11-26 12:02:33,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:02:33,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:02:33,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:02:33,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:02:33,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:33" (1/1) ... [2023-11-26 12:02:33,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:33" (1/1) ... [2023-11-26 12:02:33,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:33" (1/1) ... [2023-11-26 12:02:33,626 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2023-11-26 12:02:33,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:33" (1/1) ... [2023-11-26 12:02:33,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:33" (1/1) ... [2023-11-26 12:02:33,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:33" (1/1) ... [2023-11-26 12:02:33,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:33" (1/1) ... [2023-11-26 12:02:33,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:33" (1/1) ... [2023-11-26 12:02:33,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:33" (1/1) ... [2023-11-26 12:02:33,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:02:33,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:02:33,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:02:33,679 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:02:33,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:33" (1/1) ... [2023-11-26 12:02:33,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:33,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:33,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:33,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-26 12:02:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 12:02:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:02:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-26 12:02:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-26 12:02:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-26 12:02:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-26 12:02:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:02:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:02:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 12:02:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:02:33,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:02:33,935 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:02:33,938 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:02:34,390 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:02:34,399 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:02:34,400 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-26 12:02:34,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:34 BoogieIcfgContainer [2023-11-26 12:02:34,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:02:34,403 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-26 12:02:34,403 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-26 12:02:34,407 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-26 12:02:34,408 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 12:02:34,409 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.11 12:02:32" (1/3) ... [2023-11-26 12:02:34,410 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54ffebfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 12:02:34, skipping insertion in model container [2023-11-26 12:02:34,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 12:02:34,410 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:33" (2/3) ... [2023-11-26 12:02:34,411 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54ffebfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 12:02:34, skipping insertion in model container [2023-11-26 12:02:34,411 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 12:02:34,411 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:34" (3/3) ... [2023-11-26 12:02:34,413 INFO L332 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2023-11-26 12:02:34,471 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-26 12:02:34,472 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-26 12:02:34,472 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-26 12:02:34,472 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-26 12:02:34,473 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-26 12:02:34,475 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-26 12:02:34,475 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-26 12:02:34,476 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-26 12:02:34,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:34,504 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-11-26 12:02:34,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:34,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:34,511 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 12:02:34,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:34,512 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-26 12:02:34,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:34,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-11-26 12:02:34,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:34,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:34,519 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 12:02:34,519 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:34,528 INFO L748 eck$LassoCheckResult]: Stem: 20#$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(18, 2); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 5#L552-4true [2023-11-26 12:02:34,529 INFO L750 eck$LassoCheckResult]: Loop: 5#L552-4true havoc main_#t~nondet4#1; 16#L538-1true assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 24#L541-2true assume !true; 7#L540-5true call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; 6#L546true assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 18#L546-2true assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; 12#L546-4true call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; 13#L552true assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 15#L552-2true assume main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$#1(main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;call main_#t~mem23#1.base, main_#t~mem23#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem23#1.base, 4 + main_#t~mem23#1.offset, 4);havoc main_#t~mem23#1.base, main_#t~mem23#1.offset;call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem24#1.base, 8 + main_#t~mem24#1.offset, 4);havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; 5#L552-4true [2023-11-26 12:02:34,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:34,536 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-26 12:02:34,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:34,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021579449] [2023-11-26 12:02:34,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:34,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:34,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:34,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:34,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1807228567, now seen corresponding path program 1 times [2023-11-26 12:02:34,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:34,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062900935] [2023-11-26 12:02:34,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:34,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:34,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062900935] [2023-11-26 12:02:34,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062900935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:34,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:34,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:02:34,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151552952] [2023-11-26 12:02:34,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:34,979 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 12:02:34,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:35,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 12:02:35,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 12:02:35,028 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2023-11-26 12:02:35,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:35,038 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2023-11-26 12:02:35,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. [2023-11-26 12:02:35,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-11-26 12:02:35,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 30 transitions. [2023-11-26 12:02:35,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-11-26 12:02:35,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-11-26 12:02:35,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 30 transitions. [2023-11-26 12:02:35,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:35,053 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 30 transitions. [2023-11-26 12:02:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 30 transitions. [2023-11-26 12:02:35,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-26 12:02:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 states have internal predecessors, (30), 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) [2023-11-26 12:02:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2023-11-26 12:02:35,087 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 30 transitions. [2023-11-26 12:02:35,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 12:02:35,093 INFO L428 stractBuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2023-11-26 12:02:35,093 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-26 12:02:35,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2023-11-26 12:02:35,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-11-26 12:02:35,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:35,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:35,098 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 12:02:35,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:35,099 INFO L748 eck$LassoCheckResult]: Stem: 73#$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(18, 2); 66#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 60#L552-4 [2023-11-26 12:02:35,099 INFO L750 eck$LassoCheckResult]: Loop: 60#L552-4 havoc main_#t~nondet4#1; 61#L538-1 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 72#L541-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 58#L540-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; 59#L540-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 64#L540-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; 62#L546 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 63#L546-2 assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; 69#L546-4 call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; 70#L552 assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 71#L552-2 assume main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$#1(main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;call main_#t~mem23#1.base, main_#t~mem23#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem23#1.base, 4 + main_#t~mem23#1.offset, 4);havoc main_#t~mem23#1.base, main_#t~mem23#1.offset;call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem24#1.base, 8 + main_#t~mem24#1.offset, 4);havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; 60#L552-4 [2023-11-26 12:02:35,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:35,100 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-26 12:02:35,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:35,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328910148] [2023-11-26 12:02:35,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:35,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:35,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:35,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:35,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:35,176 INFO L85 PathProgramCache]: Analyzing trace with hash 639218396, now seen corresponding path program 1 times [2023-11-26 12:02:35,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:35,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754843879] [2023-11-26 12:02:35,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:35,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:35,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:35,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754843879] [2023-11-26 12:02:35,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754843879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:35,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:35,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:02:35,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842997790] [2023-11-26 12:02:35,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:35,602 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 12:02:35,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:35,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:02:35,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:02:35,605 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2023-11-26 12:02:35,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:35,892 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2023-11-26 12:02:35,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2023-11-26 12:02:35,894 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2023-11-26 12:02:35,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. [2023-11-26 12:02:35,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-11-26 12:02:35,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-11-26 12:02:35,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2023-11-26 12:02:35,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:35,897 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2023-11-26 12:02:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2023-11-26 12:02:35,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2023-11-26 12:02:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 states have internal predecessors, (35), 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) [2023-11-26 12:02:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2023-11-26 12:02:35,906 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2023-11-26 12:02:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:02:35,910 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2023-11-26 12:02:35,912 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-26 12:02:35,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2023-11-26 12:02:35,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2023-11-26 12:02:35,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:35,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:35,920 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 12:02:35,920 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:35,922 INFO L748 eck$LassoCheckResult]: Stem: 136#$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(18, 2); 129#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 122#L552-4 [2023-11-26 12:02:35,922 INFO L750 eck$LassoCheckResult]: Loop: 122#L552-4 havoc main_#t~nondet4#1; 123#L538-1 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 135#L541-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 119#L540-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; 120#L540-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 140#L540-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; 124#L546 assume !main_#t~short13#1; 125#L546-2 assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; 132#L546-4 call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; 133#L552 assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 134#L552-2 assume main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$#1(main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;call main_#t~mem23#1.base, main_#t~mem23#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem23#1.base, 4 + main_#t~mem23#1.offset, 4);havoc main_#t~mem23#1.base, main_#t~mem23#1.offset;call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem24#1.base, 8 + main_#t~mem24#1.offset, 4);havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; 122#L552-4 [2023-11-26 12:02:35,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:35,923 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-26 12:02:35,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:35,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161185380] [2023-11-26 12:02:35,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:35,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:35,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:35,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:35,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash 641065438, now seen corresponding path program 1 times [2023-11-26 12:02:35,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:35,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367299074] [2023-11-26 12:02:35,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:35,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:36,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:36,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:36,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:36,103 INFO L85 PathProgramCache]: Analyzing trace with hash 264589532, now seen corresponding path program 1 times [2023-11-26 12:02:36,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:36,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727141181] [2023-11-26 12:02:36,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:36,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:36,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:36,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727141181] [2023-11-26 12:02:36,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727141181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:36,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:36,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:02:36,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194545642] [2023-11-26 12:02:36,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:43,507 WARN L293 SmtUtils]: Spent 6.92s on a formula simplification. DAG size of input: 196 DAG size of output: 143 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-26 12:03:13,070 WARN L293 SmtUtils]: Spent 23.08s on a formula simplification that was a NOOP. DAG size: 195 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-26 12:03:13,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:13,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:03:13,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:03:13,073 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:03:13,338 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2023-11-26 12:03:13,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2023-11-26 12:03:13,340 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2023-11-26 12:03:13,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 60 transitions. [2023-11-26 12:03:13,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2023-11-26 12:03:13,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2023-11-26 12:03:13,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 60 transitions. [2023-11-26 12:03:13,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:13,342 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 60 transitions. [2023-11-26 12:03:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 60 transitions. [2023-11-26 12:03:13,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2023-11-26 12:03:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 35 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) [2023-11-26 12:03:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2023-11-26 12:03:13,347 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 51 transitions. [2023-11-26 12:03:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:03:13,348 INFO L428 stractBuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2023-11-26 12:03:13,348 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-26 12:03:13,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 51 transitions. [2023-11-26 12:03:13,350 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2023-11-26 12:03:13,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:03:13,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:03:13,350 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 12:03:13,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:13,351 INFO L748 eck$LassoCheckResult]: Stem: 222#$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(18, 2); 209#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 202#L552-4 [2023-11-26 12:03:13,351 INFO L750 eck$LassoCheckResult]: Loop: 202#L552-4 havoc main_#t~nondet4#1; 203#L538-1 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 225#L541-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 200#L540-1 assume !main_#t~short7#1; 201#L540-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 233#L540-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; 232#L546 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 231#L546-2 assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; 212#L546-4 call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; 213#L552 assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 216#L552-2 assume !main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1; 202#L552-4 [2023-11-26 12:03:13,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-11-26 12:03:13,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:13,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818325175] [2023-11-26 12:03:13,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:13,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:13,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:03:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:13,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:03:13,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash -170128228, now seen corresponding path program 1 times [2023-11-26 12:03:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:13,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985364541] [2023-11-26 12:03:13,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:13,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:13,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:03:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:13,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:03:13,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:13,391 INFO L85 PathProgramCache]: Analyzing trace with hash -546604134, now seen corresponding path program 1 times [2023-11-26 12:03:13,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:13,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283314051] [2023-11-26 12:03:13,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:13,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:13,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:03:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:13,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:03:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:14,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:03:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:14,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.11 12:03:14 BoogieIcfgContainer [2023-11-26 12:03:14,246 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-26 12:03:14,247 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:03:14,247 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:03:14,247 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:03:14,248 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:34" (3/4) ... [2023-11-26 12:03:14,249 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-26 12:03:14,286 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 12:03:14,286 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:03:14,287 INFO L158 Benchmark]: Toolchain (without parser) took 41457.58ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 139.7MB in the beginning and 73.5MB in the end (delta: 66.2MB). Peak memory consumption was 102.5MB. Max. memory is 16.1GB. [2023-11-26 12:03:14,288 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 130.0MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:03:14,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.14ms. Allocated memory is still 172.0MB. Free memory was 139.7MB in the beginning and 121.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-26 12:03:14,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.47ms. Allocated memory is still 172.0MB. Free memory was 121.9MB in the beginning and 119.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:03:14,289 INFO L158 Benchmark]: Boogie Preprocessor took 105.94ms. Allocated memory is still 172.0MB. Free memory was 119.7MB in the beginning and 116.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:03:14,290 INFO L158 Benchmark]: RCFGBuilder took 723.50ms. Allocated memory is still 172.0MB. Free memory was 116.2MB in the beginning and 91.5MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-26 12:03:14,290 INFO L158 Benchmark]: BuchiAutomizer took 39843.25ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 91.5MB in the beginning and 75.6MB in the end (delta: 16.0MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2023-11-26 12:03:14,291 INFO L158 Benchmark]: Witness Printer took 39.53ms. Allocated memory is still 207.6MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:03:14,294 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.30ms. Allocated memory is still 130.0MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 656.14ms. Allocated memory is still 172.0MB. Free memory was 139.7MB in the beginning and 121.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.47ms. Allocated memory is still 172.0MB. Free memory was 121.9MB in the beginning and 119.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.94ms. Allocated memory is still 172.0MB. Free memory was 119.7MB in the beginning and 116.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 723.50ms. Allocated memory is still 172.0MB. Free memory was 116.2MB in the beginning and 91.5MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 39843.25ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 91.5MB in the beginning and 75.6MB in the end (delta: 16.0MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * Witness Printer took 39.53ms. Allocated memory is still 207.6MB. Free memory was 75.6MB in the beginning and 73.5MB 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 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 36 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 39.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 38.9s. Construction of modules took 0.4s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 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, 40 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 179 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 84 mSDtfsCounter, 122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 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: 538]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L535] root->left = ((void *)0) [L536] root->right = ((void *)0) [L537] root->parent = ((void *)0) Loop: [L538] COND TRUE __VERIFIER_nondet_int() [L539] n = root [L540] EXPR n->left [L540] n->left && n->right [L540] n->left && n->right [L540] COND FALSE !(n->left && n->right) [L546] EXPR n->left [L546] !n->left && __VERIFIER_nondet_int() [L546] !n->left && __VERIFIER_nondet_int() [L546] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L552] EXPR n->right [L552] !n->right && __VERIFIER_nondet_int() [L552] !n->right && __VERIFIER_nondet_int() [L552] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 538]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L535] root->left = ((void *)0) [L536] root->right = ((void *)0) [L537] root->parent = ((void *)0) Loop: [L538] COND TRUE __VERIFIER_nondet_int() [L539] n = root [L540] EXPR n->left [L540] n->left && n->right [L540] n->left && n->right [L540] COND FALSE !(n->left && n->right) [L546] EXPR n->left [L546] !n->left && __VERIFIER_nondet_int() [L546] !n->left && __VERIFIER_nondet_int() [L546] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L552] EXPR n->right [L552] !n->right && __VERIFIER_nondet_int() [L552] !n->right && __VERIFIER_nondet_int() [L552] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-26 12:03:14,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fd9ddeb-8bf9-42c5-8456-86bd619fd705/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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)