./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 b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD --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 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 23:47:38,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 23:47:38,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 23:47:38,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 23:47:38,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 23:47:38,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 23:47:38,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 23:47:38,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 23:47:38,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 23:47:38,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 23:47:38,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 23:47:38,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 23:47:38,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 23:47:38,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 23:47:38,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 23:47:38,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 23:47:38,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 23:47:38,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 23:47:38,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 23:47:38,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 23:47:38,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 23:47:38,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 23:47:38,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 23:47:38,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 23:47:38,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 23:47:38,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 23:47:38,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 23:47:38,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 23:47:38,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 23:47:38,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 23:47:38,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 23:47:38,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 23:47:38,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 23:47:38,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 23:47:38,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 23:47:38,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 23:47:38,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 23:47:38,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 23:47:38,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 23:47:38,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 23:47:38,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 23:47:38,627 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-28 23:47:38,674 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 23:47:38,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 23:47:38,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 23:47:38,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 23:47:38,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 23:47:38,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 23:47:38,678 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 23:47:38,678 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-28 23:47:38,678 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-28 23:47:38,679 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-28 23:47:38,680 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-28 23:47:38,680 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-28 23:47:38,680 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-28 23:47:38,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 23:47:38,681 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 23:47:38,681 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-28 23:47:38,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 23:47:38,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 23:47:38,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 23:47:38,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-28 23:47:38,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-28 23:47:38,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-28 23:47:38,682 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 23:47:38,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 23:47:38,683 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-28 23:47:38,683 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 23:47:38,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-28 23:47:38,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 23:47:38,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 23:47:38,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 23:47:38,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 23:47:38,685 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 23:47:38,686 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-28 23:47:38,686 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_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/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_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD 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-10-28 23:47:38,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 23:47:39,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 23:47:39,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 23:47:39,020 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 23:47:39,022 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 23:47:39,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2021-10-28 23:47:39,133 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/data/c35539f1d/f774fa857a8c4a77a60c8dd832e22ada/FLAG6c0afca50 [2021-10-28 23:47:39,817 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 23:47:39,818 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2021-10-28 23:47:39,831 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/data/c35539f1d/f774fa857a8c4a77a60c8dd832e22ada/FLAG6c0afca50 [2021-10-28 23:47:40,098 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/data/c35539f1d/f774fa857a8c4a77a60c8dd832e22ada [2021-10-28 23:47:40,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 23:47:40,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 23:47:40,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 23:47:40,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 23:47:40,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 23:47:40,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:47:40" (1/1) ... [2021-10-28 23:47:40,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eeaf1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:47:40, skipping insertion in model container [2021-10-28 23:47:40,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:47:40" (1/1) ... [2021-10-28 23:47:40,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 23:47:40,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 23:47:40,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:47:40,701 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 23:47:40,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:47:40,794 INFO L208 MainTranslator]: Completed translation [2021-10-28 23:47:40,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:47:40 WrapperNode [2021-10-28 23:47:40,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 23:47:40,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 23:47:40,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 23:47:40,796 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 23:47:40,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:47:40" (1/1) ... [2021-10-28 23:47:40,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:47:40" (1/1) ... [2021-10-28 23:47:40,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 23:47:40,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 23:47:40,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 23:47:40,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 23:47:40,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:47:40" (1/1) ... [2021-10-28 23:47:40,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:47:40" (1/1) ... [2021-10-28 23:47:40,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:47:40" (1/1) ... [2021-10-28 23:47:40,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:47:40" (1/1) ... [2021-10-28 23:47:40,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:47:40" (1/1) ... [2021-10-28 23:47:40,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:47:40" (1/1) ... [2021-10-28 23:47:40,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:47:40" (1/1) ... [2021-10-28 23:47:40,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 23:47:40,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 23:47:40,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 23:47:40,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 23:47:40,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:47:40" (1/1) ... [2021-10-28 23:47:40,942 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:47:40,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:47:40,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:47:40,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-28 23:47:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-28 23:47:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-28 23:47:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 23:47:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-28 23:47:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 23:47:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 23:47:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 23:47:41,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 23:47:41,655 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 23:47:41,656 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-28 23:47:41,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:47:41 BoogieIcfgContainer [2021-10-28 23:47:41,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 23:47:41,659 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-28 23:47:41,659 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-28 23:47:41,663 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-28 23:47:41,664 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 23:47:41,664 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.10 11:47:40" (1/3) ... [2021-10-28 23:47:41,665 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27b0204e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 11:47:41, skipping insertion in model container [2021-10-28 23:47:41,665 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 23:47:41,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:47:40" (2/3) ... [2021-10-28 23:47:41,666 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27b0204e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 11:47:41, skipping insertion in model container [2021-10-28 23:47:41,666 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 23:47:41,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:47:41" (3/3) ... [2021-10-28 23:47:41,668 INFO L389 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2021-10-28 23:47:41,714 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-28 23:47:41,714 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-28 23:47:41,714 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-28 23:47:41,714 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-28 23:47:41,714 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-28 23:47:41,715 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-28 23:47:41,715 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-28 23:47:41,715 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-28 23:47:41,731 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-10-28 23:47:41,751 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-10-28 23:47:41,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:47:41,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:47:41,759 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:47:41,759 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-10-28 23:47:41,759 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-28 23:47:41,760 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-10-28 23:47:41,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-10-28 23:47:41,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:47:41,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:47:41,763 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:47:41,763 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-10-28 23:47:41,770 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(18); 9#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 14#L552-2true [2021-10-28 23:47:41,771 INFO L793 eck$LassoCheckResult]: Loop: 14#L552-2true assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 22#L541-2true assume !true; 7#L540-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 6#L546true assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);havoc main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem18.base, 8 + main_#t~mem18.offset, 4);havoc main_#t~mem18.base, main_#t~mem18.offset; 16#L546-2true call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 12#L552true assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 14#L552-2true [2021-10-28 23:47:41,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:47:41,778 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-28 23:47:41,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:47:41,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758976079] [2021-10-28 23:47:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:47:41,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:47:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:47:41,944 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:47:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:47:42,025 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:47:42,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:47:42,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-10-28 23:47:42,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:47:42,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794261160] [2021-10-28 23:47:42,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:47:42,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:47:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:47:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:47:42,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:47:42,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794261160] [2021-10-28 23:47:42,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794261160] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:47:42,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:47:42,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 23:47:42,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607299849] [2021-10-28 23:47:42,086 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:47:42,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:47:42,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-28 23:47:42,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 23:47:42,105 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-10-28 23:47:42,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:47:42,112 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2021-10-28 23:47:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-28 23:47:42,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2021-10-28 23:47:42,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-10-28 23:47:42,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2021-10-28 23:47:42,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-10-28 23:47:42,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-10-28 23:47:42,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2021-10-28 23:47:42,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:47:42,123 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-10-28 23:47:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2021-10-28 23:47:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-10-28 23:47:42,149 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-10-28 23:47:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2021-10-28 23:47:42,151 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-10-28 23:47:42,151 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-10-28 23:47:42,152 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-28 23:47:42,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2021-10-28 23:47:42,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-10-28 23:47:42,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:47:42,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:47:42,154 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:47:42,154 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:47:42,154 INFO L791 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(18); 53#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 61#L552-2 [2021-10-28 23:47:42,154 INFO L793 eck$LassoCheckResult]: Loop: 61#L552-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 64#L541-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 50#L540-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 51#L540-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 56#L540-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 54#L546 assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);havoc main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem18.base, 8 + main_#t~mem18.offset, 4);havoc main_#t~mem18.base, main_#t~mem18.offset; 55#L546-2 call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 62#L552 assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 61#L552-2 [2021-10-28 23:47:42,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:47:42,179 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-10-28 23:47:42,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:47:42,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320792268] [2021-10-28 23:47:42,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:47:42,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:47:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:47:42,201 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:47:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:47:42,240 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:47:42,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:47:42,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-10-28 23:47:42,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:47:42,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38278986] [2021-10-28 23:47:42,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:47:42,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:47:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:47:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:47:42,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:47:42,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38278986] [2021-10-28 23:47:42,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38278986] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:47:42,436 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:47:42,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:47:42,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374612779] [2021-10-28 23:47:42,438 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:47:42,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:47:42,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:47:42,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:47:42,444 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-10-28 23:47:42,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:47:42,651 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2021-10-28 23:47:42,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:47:42,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-10-28 23:47:42,653 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-10-28 23:47:42,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2021-10-28 23:47:42,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-10-28 23:47:42,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-10-28 23:47:42,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2021-10-28 23:47:42,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:47:42,656 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2021-10-28 23:47:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2021-10-28 23:47:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2021-10-28 23:47:42,658 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-10-28 23:47:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-10-28 23:47:42,659 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-10-28 23:47:42,659 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-10-28 23:47:42,659 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-28 23:47:42,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2021-10-28 23:47:42,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-10-28 23:47:42,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:47:42,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:47:42,660 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:47:42,661 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:47:42,661 INFO L791 eck$LassoCheckResult]: Stem: 104#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(18); 105#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 111#L552-2 [2021-10-28 23:47:42,661 INFO L793 eck$LassoCheckResult]: Loop: 111#L552-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 116#L541-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 101#L540-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 102#L540-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 108#L540-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 106#L546 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 107#L546-2 call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 114#L552 assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 111#L552-2 [2021-10-28 23:47:42,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:47:42,661 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-10-28 23:47:42,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:47:42,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036877475] [2021-10-28 23:47:42,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:47:42,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:47:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:47:42,698 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:47:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:47:42,721 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:47:42,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:47:42,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-10-28 23:47:42,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:47:42,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267504424] [2021-10-28 23:47:42,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:47:42,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:47:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:47:42,741 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:47:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:47:42,767 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:47:42,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:47:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-10-28 23:47:42,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:47:42,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948848917] [2021-10-28 23:47:42,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:47:42,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:47:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:47:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:47:42,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:47:42,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948848917] [2021-10-28 23:47:42,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948848917] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:47:42,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:47:42,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:47:42,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355586632] [2021-10-28 23:47:43,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:47:43,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:47:43,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:47:43,174 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-10-28 23:47:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:47:43,464 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2021-10-28 23:47:43,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:47:43,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2021-10-28 23:47:43,467 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-10-28 23:47:43,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2021-10-28 23:47:43,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-10-28 23:47:43,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-10-28 23:47:43,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2021-10-28 23:47:43,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:47:43,469 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2021-10-28 23:47:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2021-10-28 23:47:43,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2021-10-28 23:47:43,472 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-10-28 23:47:43,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2021-10-28 23:47:43,473 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-10-28 23:47:43,473 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-10-28 23:47:43,473 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-28 23:47:43,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2021-10-28 23:47:43,474 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-10-28 23:47:43,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:47:43,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:47:43,475 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:47:43,475 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:47:43,475 INFO L791 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(18); 171#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 177#L552-2 [2021-10-28 23:47:43,475 INFO L793 eck$LassoCheckResult]: Loop: 177#L552-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 184#L541-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 168#L540-1 assume !main_#t~short9; 169#L540-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 195#L540-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 193#L546 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 185#L546-2 call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 181#L552 assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 177#L552-2 [2021-10-28 23:47:43,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:47:43,476 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-10-28 23:47:43,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:47:43,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869147588] [2021-10-28 23:47:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:47:43,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:47:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:47:43,489 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:47:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:47:43,504 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:47:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:47:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-10-28 23:47:43,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:47:43,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122488404] [2021-10-28 23:47:43,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:47:43,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:47:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:47:43,514 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:47:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:47:43,526 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:47:43,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:47:43,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-10-28 23:47:43,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:47:43,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76018005] [2021-10-28 23:47:43,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:47:43,533 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:47:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:47:43,548 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:47:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:47:43,568 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:47:44,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.10 11:47:44 BoogieIcfgContainer [2021-10-28 23:47:44,669 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-28 23:47:44,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 23:47:44,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 23:47:44,670 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 23:47:44,684 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:47:41" (3/4) ... [2021-10-28 23:47:44,687 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-28 23:47:44,717 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 23:47:44,718 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 23:47:44,719 INFO L168 Benchmark]: Toolchain (without parser) took 4615.93 ms. Allocated memory is still 127.9 MB. Free memory was 91.1 MB in the beginning and 67.9 MB in the end (delta: 23.1 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. [2021-10-28 23:47:44,720 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 86.0 MB. Free memory was 63.5 MB in the beginning and 63.5 MB in the end (delta: 26.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:47:44,721 INFO L168 Benchmark]: CACSL2BoogieTranslator took 690.15 ms. Allocated memory is still 127.9 MB. Free memory was 90.8 MB in the beginning and 94.3 MB in the end (delta: -3.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-28 23:47:44,721 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.72 ms. Allocated memory is still 127.9 MB. Free memory was 94.3 MB in the beginning and 91.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:47:44,722 INFO L168 Benchmark]: Boogie Preprocessor took 63.93 ms. Allocated memory is still 127.9 MB. Free memory was 91.6 MB in the beginning and 90.3 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:47:44,723 INFO L168 Benchmark]: RCFGBuilder took 726.58 ms. Allocated memory is still 127.9 MB. Free memory was 90.1 MB in the beginning and 65.1 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-28 23:47:44,723 INFO L168 Benchmark]: BuchiAutomizer took 3010.58 ms. Allocated memory is still 127.9 MB. Free memory was 65.1 MB in the beginning and 70.0 MB in the end (delta: -4.9 MB). Peak memory consumption was 27.6 MB. Max. memory is 16.1 GB. [2021-10-28 23:47:44,724 INFO L168 Benchmark]: Witness Printer took 47.94 ms. Allocated memory is still 127.9 MB. Free memory was 70.0 MB in the beginning and 67.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:47:44,728 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.32 ms. Allocated memory is still 86.0 MB. Free memory was 63.5 MB in the beginning and 63.5 MB in the end (delta: 26.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 690.15 ms. Allocated memory is still 127.9 MB. Free memory was 90.8 MB in the beginning and 94.3 MB in the end (delta: -3.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 70.72 ms. Allocated memory is still 127.9 MB. Free memory was 94.3 MB in the beginning and 91.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 63.93 ms. Allocated memory is still 127.9 MB. Free memory was 91.6 MB in the beginning and 90.3 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 726.58 ms. Allocated memory is still 127.9 MB. Free memory was 90.1 MB in the beginning and 65.1 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 3010.58 ms. Allocated memory is still 127.9 MB. Free memory was 65.1 MB in the beginning and 70.0 MB in the end (delta: -4.9 MB). Peak memory consumption was 27.6 MB. Max. memory is 16.1 GB. * Witness Printer took 47.94 ms. Allocated memory is still 127.9 MB. Free memory was 70.0 MB in the beginning and 67.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * 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 2.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.3s. 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: 68 SDtfs, 29 SDslu, 60 SDs, 0 SdLazy, 100 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time 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=32661} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@bf92011=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@128efec2=0, NULL=32663, NULL=32661, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3533c127=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1db59e1a=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6f31378d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@42f608f4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@bf92011=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40fdc2fe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6ab32702=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4207ffc1=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17c28020=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@42f608f4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1aa7e331=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@392b1411=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@523a8e3e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@392b1411=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1db59e1a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6f31378d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5c04f387=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@466954ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1674cbed=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5db67cb0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4611b816=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@523a8e3e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a9c5c5c=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4c337441=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5c04f387=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3533c127=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@a29d8b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@32e5a7a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1674cbed=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@32e5a7a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22a2086b=24, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@466954ec=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@128efec2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6ab32702=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@578be9a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7830b010=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4611b816=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4c337441=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@5a7f8d37=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@a29d8b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7830b010=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@578be9a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1aa7e331=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4207ffc1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5cfa6242=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e6554c=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a9c5c5c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e6554c=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3af908cc=0, NULL=32662, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5cfa6242=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5db67cb0=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-10-28 23:47:44,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d909c42b-0f4e-43e0-a710-66e4b4091cfc/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...