./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --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.2-hotfix-svcomp22-839c364 [2021-12-06 22:46:14,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 22:46:14,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 22:46:14,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 22:46:14,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 22:46:14,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 22:46:14,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 22:46:14,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 22:46:14,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 22:46:14,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 22:46:14,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 22:46:14,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 22:46:14,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 22:46:14,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 22:46:14,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 22:46:14,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 22:46:14,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 22:46:14,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 22:46:14,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 22:46:14,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 22:46:14,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 22:46:14,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 22:46:14,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 22:46:14,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 22:46:14,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 22:46:14,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 22:46:14,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 22:46:14,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 22:46:14,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 22:46:14,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 22:46:14,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 22:46:14,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 22:46:14,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 22:46:14,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 22:46:14,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 22:46:14,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 22:46:14,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 22:46:14,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 22:46:14,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 22:46:14,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 22:46:14,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 22:46:14,498 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-06 22:46:14,523 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 22:46:14,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 22:46:14,523 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 22:46:14,524 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 22:46:14,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 22:46:14,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 22:46:14,525 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 22:46:14,525 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-06 22:46:14,526 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-06 22:46:14,526 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-06 22:46:14,526 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-06 22:46:14,526 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-06 22:46:14,526 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-06 22:46:14,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 22:46:14,527 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 22:46:14,527 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 22:46:14,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 22:46:14,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 22:46:14,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 22:46:14,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-06 22:46:14,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-06 22:46:14,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-06 22:46:14,528 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 22:46:14,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 22:46:14,529 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-06 22:46:14,529 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 22:46:14,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-06 22:46:14,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 22:46:14,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 22:46:14,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 22:46:14,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 22:46:14,530 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 22:46:14,531 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-06 22:46:14,531 INFO L138 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_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/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_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2021-12-06 22:46:14,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 22:46:14,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 22:46:14,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 22:46:14,735 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 22:46:14,735 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 22:46:14,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2021-12-06 22:46:14,775 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/data/ebd36920d/01fcd35d38264f6ea5b14721db59ceb3/FLAGcc179b1c8 [2021-12-06 22:46:15,211 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 22:46:15,212 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2021-12-06 22:46:15,220 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/data/ebd36920d/01fcd35d38264f6ea5b14721db59ceb3/FLAGcc179b1c8 [2021-12-06 22:46:15,230 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/data/ebd36920d/01fcd35d38264f6ea5b14721db59ceb3 [2021-12-06 22:46:15,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 22:46:15,232 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 22:46:15,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 22:46:15,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 22:46:15,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 22:46:15,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:46:15" (1/1) ... [2021-12-06 22:46:15,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c63d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:46:15, skipping insertion in model container [2021-12-06 22:46:15,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:46:15" (1/1) ... [2021-12-06 22:46:15,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 22:46:15,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 22:46:15,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:46:15,474 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 22:46:15,504 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:46:15,526 INFO L208 MainTranslator]: Completed translation [2021-12-06 22:46:15,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:46:15 WrapperNode [2021-12-06 22:46:15,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 22:46:15,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 22:46:15,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 22:46:15,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 22:46:15,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:46:15" (1/1) ... [2021-12-06 22:46:15,550 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:46:15" (1/1) ... [2021-12-06 22:46:15,575 INFO L137 Inliner]: procedures = 123, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 129 [2021-12-06 22:46:15,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 22:46:15,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 22:46:15,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 22:46:15,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 22:46:15,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:46:15" (1/1) ... [2021-12-06 22:46:15,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:46:15" (1/1) ... [2021-12-06 22:46:15,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:46:15" (1/1) ... [2021-12-06 22:46:15,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:46:15" (1/1) ... [2021-12-06 22:46:15,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:46:15" (1/1) ... [2021-12-06 22:46:15,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:46:15" (1/1) ... [2021-12-06 22:46:15,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:46:15" (1/1) ... [2021-12-06 22:46:15,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 22:46:15,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 22:46:15,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 22:46:15,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 22:46:15,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:46:15" (1/1) ... [2021-12-06 22:46:15,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 22:46:15,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:46:15,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 22:46:15,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-06 22:46:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 22:46:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 22:46:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 22:46:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 22:46:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 22:46:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 22:46:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 22:46:15,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 22:46:15,764 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 22:46:15,766 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 22:46:16,049 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 22:46:16,053 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 22:46:16,053 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-06 22:46:16,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:46:16 BoogieIcfgContainer [2021-12-06 22:46:16,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 22:46:16,055 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-06 22:46:16,055 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-06 22:46:16,058 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-06 22:46:16,058 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-06 22:46:16,059 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.12 10:46:15" (1/3) ... [2021-12-06 22:46:16,059 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5546e87b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.12 10:46:16, skipping insertion in model container [2021-12-06 22:46:16,059 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-06 22:46:16,060 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:46:15" (2/3) ... [2021-12-06 22:46:16,060 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5546e87b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.12 10:46:16, skipping insertion in model container [2021-12-06 22:46:16,060 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-06 22:46:16,060 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:46:16" (3/3) ... [2021-12-06 22:46:16,061 INFO L388 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2021-12-06 22:46:16,092 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-06 22:46:16,092 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-06 22:46:16,092 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-06 22:46:16,092 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-06 22:46:16,092 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-06 22:46:16,092 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-06 22:46:16,092 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-06 22:46:16,093 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-06 22:46:16,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:46:16,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-12-06 22:46:16,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 22:46:16,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 22:46:16,123 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-06 22:46:16,124 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-06 22:46:16,124 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-06 22:46:16,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:46:16,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-12-06 22:46:16,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 22:46:16,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 22:46:16,127 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-06 22:46:16,127 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-06 22:46:16,133 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(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~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#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$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 14#L552-2true [2021-12-06 22:46:16,133 INFO L793 eck$LassoCheckResult]: Loop: 14#L552-2true 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; 22#L541-2true assume !true; 7#L540-5true call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 6#L546true assume (main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem16#1.base, 8 + main_#t~mem16#1.offset, 4);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; 16#L546-2true call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 12#L552true assume !((main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0) && 0 != main_#t~nondet18#1);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1; 14#L552-2true [2021-12-06 22:46:16,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:46:16,139 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-06 22:46:16,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:46:16,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321508309] [2021-12-06 22:46:16,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:46:16,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:46:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:46:16,230 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:46:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:46:16,259 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:46:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:46:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-12-06 22:46:16,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:46:16,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411858711] [2021-12-06 22:46:16,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:46:16,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:46:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:46:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:46:16,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:46:16,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411858711] [2021-12-06 22:46:16,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411858711] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:46:16,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:46:16,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 22:46:16,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783311323] [2021-12-06 22:46:16,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:46:16,366 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-06 22:46:16,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:46:16,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 22:46:16,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 22:46:16,390 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2021-12-06 22:46:16,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:46:16,395 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2021-12-06 22:46:16,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 22:46:16,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2021-12-06 22:46:16,401 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-12-06 22:46:16,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2021-12-06 22:46:16,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-06 22:46:16,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-06 22:46:16,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2021-12-06 22:46:16,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:46:16,407 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-12-06 22:46:16,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2021-12-06 22:46:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-06 22:46:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:46:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2021-12-06 22:46:16,425 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-12-06 22:46:16,425 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-12-06 22:46:16,425 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-06 22:46:16,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2021-12-06 22:46:16,426 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-12-06 22:46:16,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 22:46:16,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 22:46:16,426 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-06 22:46:16,426 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:46:16,426 INFO L791 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 53#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~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#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$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 61#L552-2 [2021-12-06 22:46:16,426 INFO L793 eck$LassoCheckResult]: Loop: 61#L552-2 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; 64#L541-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(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; 50#L540-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(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; 51#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; 56#L540-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 54#L546 assume (main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem16#1.base, 8 + main_#t~mem16#1.offset, 4);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; 55#L546-2 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 62#L552 assume !((main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0) && 0 != main_#t~nondet18#1);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1; 61#L552-2 [2021-12-06 22:46:16,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:46:16,427 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-06 22:46:16,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:46:16,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572200951] [2021-12-06 22:46:16,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:46:16,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:46:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:46:16,449 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:46:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:46:16,470 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:46:16,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:46:16,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-12-06 22:46:16,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:46:16,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582682570] [2021-12-06 22:46:16,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:46:16,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:46:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:46:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:46:16,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:46:16,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582682570] [2021-12-06 22:46:16,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582682570] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:46:16,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:46:16,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 22:46:16,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251533530] [2021-12-06 22:46:16,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:46:16,713 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-06 22:46:16,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:46:16,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:46:16,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:46:16,714 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:46:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:46:16,843 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2021-12-06 22:46:16,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:46:16,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-12-06 22:46:16,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-12-06 22:46:16,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2021-12-06 22:46:16,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-12-06 22:46:16,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-12-06 22:46:16,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2021-12-06 22:46:16,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:46:16,847 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2021-12-06 22:46:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2021-12-06 22:46:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2021-12-06 22:46:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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) [2021-12-06 22:46:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-12-06 22:46:16,849 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-12-06 22:46:16,849 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-12-06 22:46:16,849 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-06 22:46:16,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2021-12-06 22:46:16,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-12-06 22:46:16,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 22:46:16,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 22:46:16,850 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-06 22:46:16,850 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:46:16,850 INFO L791 eck$LassoCheckResult]: Stem: 104#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 105#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~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#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$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 111#L552-2 [2021-12-06 22:46:16,850 INFO L793 eck$LassoCheckResult]: Loop: 111#L552-2 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; 116#L541-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(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; 101#L540-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(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; 102#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; 108#L540-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 106#L546 assume !((main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; 107#L546-2 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 114#L552 assume !((main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0) && 0 != main_#t~nondet18#1);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1; 111#L552-2 [2021-12-06 22:46:16,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:46:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-06 22:46:16,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:46:16,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034444049] [2021-12-06 22:46:16,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:46:16,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:46:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:46:16,860 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:46:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:46:16,868 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:46:16,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:46:16,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-12-06 22:46:16,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:46:16,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392944966] [2021-12-06 22:46:16,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:46:16,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:46:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:46:16,875 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:46:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:46:16,881 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:46:16,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:46:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-12-06 22:46:16,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:46:16,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264839086] [2021-12-06 22:46:16,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:46:16,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:46:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:46:16,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:46:16,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:46:16,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264839086] [2021-12-06 22:46:16,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264839086] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:46:16,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:46:16,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 22:46:16,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168264506] [2021-12-06 22:46:16,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:46:17,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:46:17,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:46:17,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:46:17,103 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2021-12-06 22:46:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:46:17,294 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2021-12-06 22:46:17,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:46:17,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2021-12-06 22:46:17,297 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-12-06 22:46:17,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2021-12-06 22:46:17,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-12-06 22:46:17,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-12-06 22:46:17,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2021-12-06 22:46:17,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:46:17,299 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2021-12-06 22:46:17,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2021-12-06 22:46:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2021-12-06 22:46:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:46:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2021-12-06 22:46:17,303 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-12-06 22:46:17,303 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-12-06 22:46:17,303 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-06 22:46:17,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2021-12-06 22:46:17,304 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-12-06 22:46:17,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 22:46:17,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 22:46:17,304 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-06 22:46:17,304 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:46:17,305 INFO L791 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 171#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~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#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$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 177#L552-2 [2021-12-06 22:46:17,305 INFO L793 eck$LassoCheckResult]: Loop: 177#L552-2 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; 184#L541-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(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; 168#L540-1 assume !main_#t~short7#1; 169#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; 195#L540-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 193#L546 assume !((main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; 185#L546-2 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 181#L552 assume !((main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0) && 0 != main_#t~nondet18#1);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1; 177#L552-2 [2021-12-06 22:46:17,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:46:17,305 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-06 22:46:17,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:46:17,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923845474] [2021-12-06 22:46:17,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:46:17,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:46:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:46:17,318 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:46:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:46:17,329 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:46:17,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:46:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-12-06 22:46:17,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:46:17,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674212703] [2021-12-06 22:46:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:46:17,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:46:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:46:17,339 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:46:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:46:17,348 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:46:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:46:17,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-12-06 22:46:17,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:46:17,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351355061] [2021-12-06 22:46:17,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:46:17,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:46:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:46:17,365 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:46:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:46:17,381 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:46:17,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.12 10:46:17 BoogieIcfgContainer [2021-12-06 22:46:17,851 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-06 22:46:17,852 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 22:46:17,852 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 22:46:17,852 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 22:46:17,852 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:46:16" (3/4) ... [2021-12-06 22:46:17,854 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-06 22:46:17,878 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 22:46:17,878 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 22:46:17,879 INFO L158 Benchmark]: Toolchain (without parser) took 2645.84ms. Allocated memory was 77.6MB in the beginning and 117.4MB in the end (delta: 39.8MB). Free memory was 55.7MB in the beginning and 63.6MB in the end (delta: -7.9MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2021-12-06 22:46:17,879 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 77.6MB. Free memory is still 56.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 22:46:17,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.50ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 55.7MB in the beginning and 63.7MB in the end (delta: -8.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 22:46:17,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.27ms. Allocated memory is still 94.4MB. Free memory was 63.7MB in the beginning and 61.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 22:46:17,881 INFO L158 Benchmark]: Boogie Preprocessor took 33.53ms. Allocated memory is still 94.4MB. Free memory was 61.4MB in the beginning and 59.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 22:46:17,882 INFO L158 Benchmark]: RCFGBuilder took 444.15ms. Allocated memory is still 94.4MB. Free memory was 59.5MB in the beginning and 59.3MB in the end (delta: 257.9kB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2021-12-06 22:46:17,882 INFO L158 Benchmark]: BuchiAutomizer took 1796.16ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 59.3MB in the beginning and 65.6MB in the end (delta: -6.3MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2021-12-06 22:46:17,883 INFO L158 Benchmark]: Witness Printer took 26.04ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 63.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 22:46:17,887 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 77.6MB. Free memory is still 56.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.50ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 55.7MB in the beginning and 63.7MB in the end (delta: -8.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.27ms. Allocated memory is still 94.4MB. Free memory was 63.7MB in the beginning and 61.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.53ms. Allocated memory is still 94.4MB. Free memory was 61.4MB in the beginning and 59.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 444.15ms. Allocated memory is still 94.4MB. Free memory was 59.5MB in the beginning and 59.3MB in the end (delta: 257.9kB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 1796.16ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 59.3MB in the beginning and 65.6MB in the end (delta: -6.3MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * Witness Printer took 26.04ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 63.6MB in the end (delta: 1.5MB). 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 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 68 mSDtfsCounter, 100 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 - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 538]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@656abb88=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7f9ea2b7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@231b1e63=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a056624=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23a2869f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3988826c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6df809a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41f58745=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3988826c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c10b866=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a056624=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@caea73c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b2af2a9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@68c4bd80=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@75da3b37=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@176dc355=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7bab5120=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b2af2a9=0, NULL=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6df809a4=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@75da3b37=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@598ea35b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5047a7ee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@598ea35b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@318848bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@68c4bd80=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c10b866=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b9035dc=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1ea9515a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@71d51722=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36c22599=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@656abb88=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41f58745=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36c22599=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7f9ea2b7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3aa69763=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5889c829=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@176dc355=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5047a7ee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37d54b90=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@231b1e63=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@318848bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7bab5120=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b9035dc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5889c829=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59a1e85c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@caea73c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1ea9515a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ab6816c=23, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23a2869f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a880b66=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3aa69763=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37d54b90=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@765da007=0, s=0} - 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] COND FALSE !(n->left && n->right) [L546] EXPR n->left [L546] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L552] EXPR n->right [L552] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-06 22:46:17,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cec9093-6310-4b8f-8c88-e5051eb981b7/bin/uautomizer-DrprNOufMa/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)