./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_stack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_stack.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU --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 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 22:53:59,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:53:59,667 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:53:59,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:53:59,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:53:59,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:53:59,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:53:59,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:53:59,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:53:59,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:53:59,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:53:59,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:53:59,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:53:59,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:53:59,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:53:59,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:53:59,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:53:59,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:53:59,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:53:59,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:53:59,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:53:59,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:53:59,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:53:59,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:53:59,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:53:59,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:53:59,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:53:59,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:53:59,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:53:59,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:53:59,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:53:59,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:53:59,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:53:59,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:53:59,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:53:59,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:53:59,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:53:59,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:53:59,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:53:59,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:53:59,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:53:59,769 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-02 22:53:59,817 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:53:59,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:53:59,818 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:53:59,819 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:53:59,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:53:59,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:53:59,820 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:53:59,821 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-02 22:53:59,821 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-02 22:53:59,821 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-02 22:53:59,822 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-02 22:53:59,822 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-02 22:53:59,823 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-02 22:53:59,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:53:59,823 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:53:59,823 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-02 22:53:59,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 22:53:59,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:53:59,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:53:59,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-02 22:53:59,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-02 22:53:59,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-02 22:53:59,825 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:53:59,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 22:53:59,825 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-02 22:53:59,825 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:53:59,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-02 22:53:59,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:53:59,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:53:59,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:53:59,829 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 22:53:59,829 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:53:59,830 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-02 22:53:59,830 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_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/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_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU 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 -> 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c [2021-11-02 22:54:00,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:54:00,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:54:00,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:54:00,118 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:54:00,121 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:54:00,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/memsafety-ext/tree_stack.i [2021-11-02 22:54:00,196 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/data/88f341c75/1843dea80a6145b8a50054d65d455278/FLAG9f4a02130 [2021-11-02 22:54:00,675 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:54:00,675 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/sv-benchmarks/c/memsafety-ext/tree_stack.i [2021-11-02 22:54:00,699 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/data/88f341c75/1843dea80a6145b8a50054d65d455278/FLAG9f4a02130 [2021-11-02 22:54:01,001 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/data/88f341c75/1843dea80a6145b8a50054d65d455278 [2021-11-02 22:54:01,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:54:01,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 22:54:01,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:54:01,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:54:01,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:54:01,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:54:01" (1/1) ... [2021-11-02 22:54:01,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ebce94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:54:01, skipping insertion in model container [2021-11-02 22:54:01,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:54:01" (1/1) ... [2021-11-02 22:54:01,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:54:01,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:54:01,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:54:01,419 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:54:01,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:54:01,531 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:54:01,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:54:01 WrapperNode [2021-11-02 22:54:01,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:54:01,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 22:54:01,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 22:54:01,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 22:54:01,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:54:01" (1/1) ... [2021-11-02 22:54:01,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:54:01" (1/1) ... [2021-11-02 22:54:01,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 22:54:01,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:54:01,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:54:01,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:54:01,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:54:01" (1/1) ... [2021-11-02 22:54:01,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:54:01" (1/1) ... [2021-11-02 22:54:01,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:54:01" (1/1) ... [2021-11-02 22:54:01,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:54:01" (1/1) ... [2021-11-02 22:54:01,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:54:01" (1/1) ... [2021-11-02 22:54:01,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:54:01" (1/1) ... [2021-11-02 22:54:01,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:54:01" (1/1) ... [2021-11-02 22:54:01,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:54:01,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:54:01,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:54:01,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:54:01,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:54:01" (1/1) ... [2021-11-02 22:54:01,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:54:01,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:54:01,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:54:01,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-02 22:54:01,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 22:54:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 22:54:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:54:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 22:54:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 22:54:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 22:54:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:54:01,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:54:02,266 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:54:02,266 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-11-02 22:54:02,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:54:02 BoogieIcfgContainer [2021-11-02 22:54:02,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:54:02,270 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-02 22:54:02,270 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-02 22:54:02,274 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-02 22:54:02,274 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-02 22:54:02,275 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 10:54:01" (1/3) ... [2021-11-02 22:54:02,276 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62fd0a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 10:54:02, skipping insertion in model container [2021-11-02 22:54:02,276 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-02 22:54:02,276 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:54:01" (2/3) ... [2021-11-02 22:54:02,277 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62fd0a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 10:54:02, skipping insertion in model container [2021-11-02 22:54:02,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-02 22:54:02,277 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:54:02" (3/3) ... [2021-11-02 22:54:02,278 INFO L389 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2021-11-02 22:54:02,318 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-02 22:54:02,318 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-02 22:54:02,319 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-02 22:54:02,319 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-02 22:54:02,319 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-02 22:54:02,319 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-02 22:54:02,319 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-02 22:54:02,320 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-02 22:54:02,333 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-11-02 22:54:02,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-02 22:54:02,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:54:02,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:54:02,354 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:54:02,355 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-11-02 22:54:02,355 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-02 22:54:02,355 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-11-02 22:54:02,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-02 22:54:02,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:54:02,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:54:02,357 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:54:02,357 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-11-02 22:54:02,363 INFO L791 eck$LassoCheckResult]: Stem: 6#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(13); 12#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~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.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(8);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); 16#L549-2true [2021-11-02 22:54:02,364 INFO L793 eck$LassoCheckResult]: Loop: 16#L549-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; 21#L539-2true assume !true; 14#L538-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 10#L544true 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(8);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; 7#L544-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 20#L549true assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 16#L549-2true [2021-11-02 22:54:02,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:54:02,369 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-11-02 22:54:02,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:54:02,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805284135] [2021-11-02 22:54:02,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:54:02,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:54:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:54:02,502 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:54:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:54:02,583 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:54:02,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:54:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-11-02 22:54:02,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:54:02,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158919448] [2021-11-02 22:54:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:54:02,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:54:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:54:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:54:02,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:54:02,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158919448] [2021-11-02 22:54:02,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158919448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:54:02,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:54:02,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 22:54:02,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710961708] [2021-11-02 22:54:02,676 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-02 22:54:02,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:54:02,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 22:54:02,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 22:54:02,692 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-11-02 22:54:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:54:02,699 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2021-11-02 22:54:02,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 22:54:02,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2021-11-02 22:54:02,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-02 22:54:02,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2021-11-02 22:54:02,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-11-02 22:54:02,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-11-02 22:54:02,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2021-11-02 22:54:02,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:54:02,709 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-11-02 22:54:02,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2021-11-02 22:54:02,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-02 22:54:02,732 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-11-02 22:54:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2021-11-02 22:54:02,733 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-11-02 22:54:02,734 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-11-02 22:54:02,734 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-02 22:54:02,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2021-11-02 22:54:02,735 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-02 22:54:02,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:54:02,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:54:02,736 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:54:02,736 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:54:02,736 INFO L791 eck$LassoCheckResult]: Stem: 56#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(13); 57#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~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.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(8);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); 63#L549-2 [2021-11-02 22:54:02,736 INFO L793 eck$LassoCheckResult]: Loop: 63#L549-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; 53#L539-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; 64#L538-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; 50#L538-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; 51#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 62#L544 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(8);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; 54#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 55#L549 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 63#L549-2 [2021-11-02 22:54:02,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:54:02,737 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-11-02 22:54:02,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:54:02,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747238807] [2021-11-02 22:54:02,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:54:02,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:54:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:54:02,756 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:54:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:54:02,776 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:54:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:54:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-11-02 22:54:02,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:54:02,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325179200] [2021-11-02 22:54:02,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:54:02,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:54:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:54:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:54:02,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:54:02,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325179200] [2021-11-02 22:54:02,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325179200] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:54:02,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:54:02,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:54:02,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894779935] [2021-11-02 22:54:02,914 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-02 22:54:02,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:54:02,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:54:02,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:54:02,916 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-11-02 22:54:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:54:03,049 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2021-11-02 22:54:03,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:54:03,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-11-02 22:54:03,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-11-02 22:54:03,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2021-11-02 22:54:03,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-11-02 22:54:03,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-11-02 22:54:03,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2021-11-02 22:54:03,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:54:03,060 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2021-11-02 22:54:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2021-11-02 22:54:03,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2021-11-02 22:54:03,063 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-11-02 22:54:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-11-02 22:54:03,064 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-11-02 22:54:03,064 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-11-02 22:54:03,064 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-02 22:54:03,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2021-11-02 22:54:03,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-11-02 22:54:03,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:54:03,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:54:03,065 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:54:03,066 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:54:03,066 INFO L791 eck$LassoCheckResult]: Stem: 107#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(13); 108#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~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.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(8);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); 114#L549-2 [2021-11-02 22:54:03,066 INFO L793 eck$LassoCheckResult]: Loop: 114#L549-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; 104#L539-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; 115#L538-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; 116#L538-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; 120#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 113#L544 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; 105#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 106#L549 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 114#L549-2 [2021-11-02 22:54:03,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:54:03,066 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-11-02 22:54:03,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:54:03,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168503862] [2021-11-02 22:54:03,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:54:03,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:54:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:54:03,097 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:54:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:54:03,135 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:54:03,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:54:03,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-11-02 22:54:03,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:54:03,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011124766] [2021-11-02 22:54:03,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:54:03,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:54:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:54:03,154 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:54:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:54:03,181 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:54:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:54:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-11-02 22:54:03,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:54:03,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298115168] [2021-11-02 22:54:03,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:54:03,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:54:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:54:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:54:03,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:54:03,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298115168] [2021-11-02 22:54:03,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298115168] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:54:03,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:54:03,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:54:03,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353442722] [2021-11-02 22:54:03,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:54:03,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:54:03,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:54:03,555 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-11-02 22:54:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:54:03,744 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2021-11-02 22:54:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 22:54:03,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2021-11-02 22:54:03,747 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-11-02 22:54:03,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2021-11-02 22:54:03,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-11-02 22:54:03,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-11-02 22:54:03,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2021-11-02 22:54:03,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:54:03,766 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2021-11-02 22:54:03,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2021-11-02 22:54:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2021-11-02 22:54:03,768 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-11-02 22:54:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2021-11-02 22:54:03,769 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-11-02 22:54:03,769 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-11-02 22:54:03,769 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-02 22:54:03,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2021-11-02 22:54:03,770 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-11-02 22:54:03,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:54:03,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:54:03,771 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:54:03,771 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:54:03,771 INFO L791 eck$LassoCheckResult]: Stem: 172#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(13); 173#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~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.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(8);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); 181#L549-2 [2021-11-02 22:54:03,771 INFO L793 eck$LassoCheckResult]: Loop: 181#L549-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; 185#L539-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; 182#L538-1 assume !main_#t~short9; 183#L538-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; 194#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 193#L544 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; 192#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 191#L549 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 181#L549-2 [2021-11-02 22:54:03,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:54:03,772 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-11-02 22:54:03,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:54:03,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459643354] [2021-11-02 22:54:03,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:54:03,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:54:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:54:03,798 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:54:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:54:03,827 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:54:03,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:54:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-11-02 22:54:03,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:54:03,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269479976] [2021-11-02 22:54:03,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:54:03,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:54:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:54:03,841 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:54:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:54:03,863 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:54:03,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:54:03,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-11-02 22:54:03,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:54:03,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758099295] [2021-11-02 22:54:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:54:03,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:54:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:54:03,901 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:54:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:54:03,928 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:54:04,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.11 10:54:04 BoogieIcfgContainer [2021-11-02 22:54:04,693 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-11-02 22:54:04,694 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 22:54:04,694 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 22:54:04,694 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 22:54:04,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:54:02" (3/4) ... [2021-11-02 22:54:04,697 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-11-02 22:54:04,740 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/witness.graphml [2021-11-02 22:54:04,742 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 22:54:04,744 INFO L168 Benchmark]: Toolchain (without parser) took 3738.14 ms. Allocated memory was 113.2 MB in the beginning and 146.8 MB in the end (delta: 33.6 MB). Free memory was 71.1 MB in the beginning and 77.1 MB in the end (delta: -6.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 16.1 GB. [2021-11-02 22:54:04,744 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 113.2 MB. Free memory is still 88.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:54:04,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.77 ms. Allocated memory is still 113.2 MB. Free memory was 70.9 MB in the beginning and 80.4 MB in the end (delta: -9.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-02 22:54:04,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.41 ms. Allocated memory is still 113.2 MB. Free memory was 80.4 MB in the beginning and 78.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 22:54:04,748 INFO L168 Benchmark]: Boogie Preprocessor took 47.76 ms. Allocated memory is still 113.2 MB. Free memory was 78.3 MB in the beginning and 76.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 22:54:04,749 INFO L168 Benchmark]: RCFGBuilder took 603.65 ms. Allocated memory is still 113.2 MB. Free memory was 76.6 MB in the beginning and 56.9 MB in the end (delta: 19.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-11-02 22:54:04,750 INFO L168 Benchmark]: BuchiAutomizer took 2423.03 ms. Allocated memory was 113.2 MB in the beginning and 146.8 MB in the end (delta: 33.6 MB). Free memory was 56.9 MB in the beginning and 78.3 MB in the end (delta: -21.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. [2021-11-02 22:54:04,750 INFO L168 Benchmark]: Witness Printer took 48.76 ms. Allocated memory is still 146.8 MB. Free memory was 78.3 MB in the beginning and 77.1 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:54:04,755 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.18 ms. Allocated memory is still 113.2 MB. Free memory is still 88.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 525.77 ms. Allocated memory is still 113.2 MB. Free memory was 70.9 MB in the beginning and 80.4 MB in the end (delta: -9.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 82.41 ms. Allocated memory is still 113.2 MB. Free memory was 80.4 MB in the beginning and 78.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.76 ms. Allocated memory is still 113.2 MB. Free memory was 78.3 MB in the beginning and 76.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 603.65 ms. Allocated memory is still 113.2 MB. Free memory was 76.6 MB in the beginning and 56.9 MB in the end (delta: 19.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2423.03 ms. Allocated memory was 113.2 MB in the beginning and 146.8 MB in the end (delta: 33.6 MB). Free memory was 56.9 MB in the beginning and 78.3 MB in the end (delta: -21.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. * Witness Printer took 48.76 ms. Allocated memory is still 146.8 MB. Free memory was 78.3 MB in the beginning and 77.1 MB in the end (delta: 1.2 MB). There was no memory consumed. 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.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. 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: 68 SDtfs, 29 SDslu, 60 SDs, 0 SdLazy, 100 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s 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: 536]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=5609} State at position 1 is {s=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@17b018cc=0, NULL=5610, NULL=5609, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69c49a01=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2548b40b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5aa3e82f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2470f558=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@17a36596=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e913ee1=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2d763660=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@18f240c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2548b40b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@dc6b35=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5c958a67=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ee7e423=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b031d0c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@18f240c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d823f0c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@223b73db=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d823f0c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2470f558=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2d763660=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e913ee1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69c49a01=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e42263c=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a3dee65=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5cbba9e5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@223b73db=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6abd4a6d=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78452cfa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4b37c8e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5aa3e82f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a2126a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3477d16e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e42263c=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3477d16e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@868911e=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ae61ff1=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@17b018cc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5c958a67=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@17a36596=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5cbba9e5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4b37c8e4=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@acec915=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a2126a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@184c7156=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78452cfa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ae61ff1=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6abd4a6d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@184c7156=0, s=0, NULL=5611, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a3dee65=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 536]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] root->left = ((void *)0) [L535] root->right = ((void *)0) Loop: [L536] COND TRUE __VERIFIER_nondet_int() [L537] n = root [L538] EXPR n->left [L538] n->left && n->right [L538] COND FALSE !(n->left && n->right) [L544] EXPR n->left [L544] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L549] EXPR n->right [L549] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-11-02 22:54:04,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a4544c-bb70-4847-b756-2d8ab405049c/bin/uautomizer-tBqnrhUYjU/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)