./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 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/bin/uautomizer-Z5i5R5N3CC/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/bin/uautomizer-Z5i5R5N3CC --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 43439d71f7b47b10e5196ff582d5d2564aed0e67 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.0-7b2dab5 [2021-10-11 00:29:09,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:29:09,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:29:09,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:29:09,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:29:09,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:29:09,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:29:09,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:29:09,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:29:09,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:29:09,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:29:09,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:29:09,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:29:09,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:29:09,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:29:09,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:29:09,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:29:09,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:29:09,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:29:09,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:29:09,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:29:09,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:29:09,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:29:09,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:29:09,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:29:09,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:29:09,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:29:09,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:29:09,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:29:09,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:29:09,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:29:09,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:29:09,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:29:09,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:29:09,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:29:09,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:29:09,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:29:09,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:29:09,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:29:09,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:29:09,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:29:09,851 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-11 00:29:09,886 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:29:09,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:29:09,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:29:09,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:29:09,889 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:29:09,890 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-11 00:29:09,890 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-11 00:29:09,891 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-11 00:29:09,900 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-11 00:29:09,901 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-11 00:29:09,903 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-11 00:29:09,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:29:09,904 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:29:09,904 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-11 00:29:09,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:29:09,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:29:09,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:29:09,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-11 00:29:09,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-11 00:29:09,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-11 00:29:09,906 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:29:09,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:29:09,907 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-11 00:29:09,907 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:29:09,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-11 00:29:09,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:29:09,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:29:09,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:29:09,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:29:09,911 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:29:09,912 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-11 00:29:09,913 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_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/bin/uautomizer-Z5i5R5N3CC/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_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/bin/uautomizer-Z5i5R5N3CC 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 -> 43439d71f7b47b10e5196ff582d5d2564aed0e67 [2021-10-11 00:29:10,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:29:10,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:29:10,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:29:10,292 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:29:10,293 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:29:10,294 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2021-10-11 00:29:10,374 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/bin/uautomizer-Z5i5R5N3CC/data/7256f3bd3/0fa88a2a5a2e472095d0385c3ba2d213/FLAG8ee83de16 [2021-10-11 00:29:10,994 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:29:10,994 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2021-10-11 00:29:11,014 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/bin/uautomizer-Z5i5R5N3CC/data/7256f3bd3/0fa88a2a5a2e472095d0385c3ba2d213/FLAG8ee83de16 [2021-10-11 00:29:11,249 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/bin/uautomizer-Z5i5R5N3CC/data/7256f3bd3/0fa88a2a5a2e472095d0385c3ba2d213 [2021-10-11 00:29:11,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:29:11,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:29:11,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:29:11,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:29:11,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:29:11,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:29:11" (1/1) ... [2021-10-11 00:29:11,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dcb60bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:11, skipping insertion in model container [2021-10-11 00:29:11,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:29:11" (1/1) ... [2021-10-11 00:29:11,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:29:11,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:29:11,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:29:11,847 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:29:11,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:29:11,979 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:29:11,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:11 WrapperNode [2021-10-11 00:29:11,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:29:11,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:29:11,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:29:11,983 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:29:11,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:11" (1/1) ... [2021-10-11 00:29:12,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:11" (1/1) ... [2021-10-11 00:29:12,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:29:12,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:29:12,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:29:12,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:29:12,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:11" (1/1) ... [2021-10-11 00:29:12,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:11" (1/1) ... [2021-10-11 00:29:12,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:11" (1/1) ... [2021-10-11 00:29:12,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:11" (1/1) ... [2021-10-11 00:29:12,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:11" (1/1) ... [2021-10-11 00:29:12,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:11" (1/1) ... [2021-10-11 00:29:12,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:11" (1/1) ... [2021-10-11 00:29:12,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:29:12,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:29:12,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:29:12,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:29:12,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:11" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:29:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-11 00:29:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-11 00:29:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:29:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-11 00:29:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 00:29:12,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:29:12,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:29:12,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:29:12,986 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:29:12,986 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-11 00:29:12,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:29:12 BoogieIcfgContainer [2021-10-11 00:29:12,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:29:13,017 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-11 00:29:13,017 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-11 00:29:13,021 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-11 00:29:13,022 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:29:13,022 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 11.10 12:29:11" (1/3) ... [2021-10-11 00:29:13,032 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f371f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:29:13, skipping insertion in model container [2021-10-11 00:29:13,032 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:29:13,032 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:11" (2/3) ... [2021-10-11 00:29:13,033 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f371f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:29:13, skipping insertion in model container [2021-10-11 00:29:13,033 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:29:13,033 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:29:12" (3/3) ... [2021-10-11 00:29:13,035 INFO L389 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2021-10-11 00:29:13,100 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-11 00:29:13,101 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-11 00:29:13,101 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-11 00:29:13,101 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:29:13,101 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:29:13,101 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-11 00:29:13,102 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:29:13,102 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-11 00:29:13,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2021-10-11 00:29:13,140 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-10-11 00:29:13,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:29:13,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:29:13,148 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-11 00:29:13,148 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-10-11 00:29:13,149 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-11 00:29:13,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2021-10-11 00:29:13,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-10-11 00:29:13,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:29:13,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:29:13,152 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-11 00:29:13,153 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-10-11 00:29:13,161 INFO L794 eck$LassoCheckResult]: Stem: 12#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); 10#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_~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); 18#L552-2true [2021-10-11 00:29:13,162 INFO L796 eck$LassoCheckResult]: Loop: 18#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; 20#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);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; 9#L546-2true call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 13#L552true assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~nondet20;havoc main_#t~mem19.base, main_#t~mem19.offset; 18#L552-2true [2021-10-11 00:29:13,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:13,170 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-11 00:29:13,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:13,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527312770] [2021-10-11 00:29:13,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:13,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:13,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:13,374 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:29:13,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:13,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-10-11 00:29:13,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:13,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957094213] [2021-10-11 00:29:13,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:13,423 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-11 00:29:13,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957094213] [2021-10-11 00:29:13,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:13,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:29:13,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489518239] [2021-10-11 00:29:13,431 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:29:13,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:29:13,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-11 00:29:13,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-11 00:29:13,452 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2021-10-11 00:29:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:29:13,460 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2021-10-11 00:29:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-11 00:29:13,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2021-10-11 00:29:13,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-10-11 00:29:13,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2021-10-11 00:29:13,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-10-11 00:29:13,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-10-11 00:29:13,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2021-10-11 00:29:13,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:29:13,473 INFO L692 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-10-11 00:29:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2021-10-11 00:29:13,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-10-11 00:29:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-11 00:29:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2021-10-11 00:29:13,504 INFO L715 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-10-11 00:29:13,504 INFO L595 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-10-11 00:29:13,505 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-11 00:29:13,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2021-10-11 00:29:13,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-10-11 00:29:13,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:29:13,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:29:13,507 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-11 00:29:13,507 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:13,507 INFO L794 eck$LassoCheckResult]: Stem: 64#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); 61#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_~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); 62#L552-2 [2021-10-11 00:29:13,508 INFO L796 eck$LassoCheckResult]: Loop: 62#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; 65#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; 66#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; 50#L540-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset; 51#L540-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 57#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);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; 58#L546-2 call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 60#L552 assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~nondet20;havoc main_#t~mem19.base, main_#t~mem19.offset; 62#L552-2 [2021-10-11 00:29:13,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:13,509 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-10-11 00:29:13,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:13,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217014466] [2021-10-11 00:29:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:13,537 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:13,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:13,569 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:29:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:13,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-10-11 00:29:13,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:13,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847338946] [2021-10-11 00:29:13,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:13,684 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-11 00:29:13,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847338946] [2021-10-11 00:29:13,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:13,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:29:13,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022643758] [2021-10-11 00:29:13,686 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:29:13,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:29:13,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:29:13,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:29:13,689 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2021-10-11 00:29:13,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:29:13,903 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2021-10-11 00:29:13,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:29:13,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-10-11 00:29:13,906 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-10-11 00:29:13,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2021-10-11 00:29:13,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-10-11 00:29:13,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-10-11 00:29:13,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2021-10-11 00:29:13,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:29:13,910 INFO L692 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2021-10-11 00:29:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2021-10-11 00:29:13,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2021-10-11 00:29:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-10-11 00:29:13,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-10-11 00:29:13,914 INFO L715 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-10-11 00:29:13,914 INFO L595 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-10-11 00:29:13,914 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-11 00:29:13,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2021-10-11 00:29:13,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-10-11 00:29:13,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:29:13,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:29:13,917 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-11 00:29:13,917 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:13,917 INFO L794 eck$LassoCheckResult]: Stem: 117#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); 114#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_~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); 115#L552-2 [2021-10-11 00:29:13,918 INFO L796 eck$LassoCheckResult]: Loop: 115#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; 118#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; 119#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; 101#L540-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset; 102#L540-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 108#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; 109#L546-2 call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 113#L552 assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~nondet20;havoc main_#t~mem19.base, main_#t~mem19.offset; 115#L552-2 [2021-10-11 00:29:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:13,919 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-10-11 00:29:13,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:13,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442714970] [2021-10-11 00:29:13,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:13,937 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:13,954 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:13,960 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:29:13,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:13,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-10-11 00:29:13,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:13,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971370398] [2021-10-11 00:29:13,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:13,975 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:13,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:13,991 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:29:13,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:13,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-10-11 00:29:13,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:13,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966948034] [2021-10-11 00:29:13,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:14,104 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-11 00:29:14,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966948034] [2021-10-11 00:29:14,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:14,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:29:14,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935895400] [2021-10-11 00:29:14,309 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2021-10-11 00:29:14,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:29:14,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:29:14,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:29:14,388 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2021-10-11 00:29:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:29:14,757 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2021-10-11 00:29:14,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:29:14,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2021-10-11 00:29:14,761 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-10-11 00:29:14,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2021-10-11 00:29:14,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-10-11 00:29:14,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-10-11 00:29:14,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2021-10-11 00:29:14,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:29:14,767 INFO L692 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2021-10-11 00:29:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2021-10-11 00:29:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2021-10-11 00:29:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2021-10-11 00:29:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2021-10-11 00:29:14,777 INFO L715 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-10-11 00:29:14,777 INFO L595 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-10-11 00:29:14,777 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-11 00:29:14,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2021-10-11 00:29:14,779 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-10-11 00:29:14,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:29:14,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:29:14,781 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-11 00:29:14,781 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:14,781 INFO L794 eck$LassoCheckResult]: Stem: 183#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); 180#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_~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); 181#L552-2 [2021-10-11 00:29:14,782 INFO L796 eck$LassoCheckResult]: Loop: 181#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; 192#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; 189#L540-1 assume !main_#t~short9; 190#L540-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset; 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; 178#L546-2 call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 179#L552 assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~nondet20;havoc main_#t~mem19.base, main_#t~mem19.offset; 181#L552-2 [2021-10-11 00:29:14,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:14,783 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-10-11 00:29:14,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:14,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761151217] [2021-10-11 00:29:14,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:14,822 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:14,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:14,865 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:29:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:14,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-10-11 00:29:14,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:14,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008010345] [2021-10-11 00:29:14,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:14,885 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:14,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:14,905 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:29:14,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:14,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-10-11 00:29:14,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:14,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806210622] [2021-10-11 00:29:14,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:14,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:14,987 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:15,008 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:29:15,171 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2021-10-11 00:29:15,873 WARN L197 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 103 [2021-10-11 00:29:15,968 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-10-11 00:29:16,228 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-10-11 00:29:16,229 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:29:16,242 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-10-11 00:29:16,411 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-10-11 00:29:16,411 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:29:16,427 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-10-11 00:29:16,427 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:216, output treesize:190 [2021-10-11 00:29:16,603 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-10-11 00:29:16,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 11.10 12:29:16 BoogieIcfgContainer [2021-10-11 00:29:16,658 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-11 00:29:16,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:29:16,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:29:16,659 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:29:16,659 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:29:12" (3/4) ... [2021-10-11 00:29:16,662 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-11 00:29:16,700 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cbf1f4c-796b-45f8-8c59-cfd06c6094ad/bin/uautomizer-Z5i5R5N3CC/witness.graphml [2021-10-11 00:29:16,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:29:16,701 INFO L168 Benchmark]: Toolchain (without parser) took 5444.30 ms. Allocated memory was 86.0 MB in the beginning and 159.4 MB in the end (delta: 73.4 MB). Free memory was 50.0 MB in the beginning and 84.0 MB in the end (delta: -34.0 MB). Peak memory consumption was 37.4 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:16,702 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 86.0 MB. Free memory was 67.5 MB in the beginning and 67.4 MB in the end (delta: 117.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:29:16,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.35 ms. Allocated memory was 86.0 MB in the beginning and 119.5 MB in the end (delta: 33.6 MB). Free memory was 49.9 MB in the beginning and 84.9 MB in the end (delta: -35.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:16,703 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.73 ms. Allocated memory is still 119.5 MB. Free memory was 84.9 MB in the beginning and 82.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:16,704 INFO L168 Benchmark]: Boogie Preprocessor took 45.78 ms. Allocated memory is still 119.5 MB. Free memory was 82.8 MB in the beginning and 80.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:16,705 INFO L168 Benchmark]: RCFGBuilder took 898.17 ms. Allocated memory is still 119.5 MB. Free memory was 80.7 MB in the beginning and 48.2 MB in the end (delta: 32.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:16,706 INFO L168 Benchmark]: BuchiAutomizer took 3641.22 ms. Allocated memory was 119.5 MB in the beginning and 159.4 MB in the end (delta: 39.8 MB). Free memory was 97.1 MB in the beginning and 86.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 60.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:16,706 INFO L168 Benchmark]: Witness Printer took 41.52 ms. Allocated memory is still 159.4 MB. Free memory was 86.1 MB in the beginning and 84.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:16,711 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.36 ms. Allocated memory is still 86.0 MB. Free memory was 67.5 MB in the beginning and 67.4 MB in the end (delta: 117.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 713.35 ms. Allocated memory was 86.0 MB in the beginning and 119.5 MB in the end (delta: 33.6 MB). Free memory was 49.9 MB in the beginning and 84.9 MB in the end (delta: -35.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 60.73 ms. Allocated memory is still 119.5 MB. Free memory was 84.9 MB in the beginning and 82.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.78 ms. Allocated memory is still 119.5 MB. Free memory was 82.8 MB in the beginning and 80.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 898.17 ms. Allocated memory is still 119.5 MB. Free memory was 80.7 MB in the beginning and 48.2 MB in the end (delta: 32.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 3641.22 ms. Allocated memory was 119.5 MB in the beginning and 159.4 MB in the end (delta: 39.8 MB). Free memory was 97.1 MB in the beginning and 86.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 60.5 MB. Max. memory is 16.1 GB. * Witness Printer took 41.52 ms. Allocated memory is still 159.4 MB. Free memory was 86.1 MB in the beginning and 84.0 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 3.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.4s. 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.4s 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=12332} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@27ead6dc=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@125b59cb=0, NULL=12334, NULL=12332, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c30f14b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36290fea=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@a2e52be=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@df6790d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@27ead6dc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71793250=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5bb701f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e914e0=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cf46707=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@df6790d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@384bf65a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64848ca5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@238a9c1b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64848ca5=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36290fea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@a2e52be=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@40e1d1b9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e4720f2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3709c07b=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@155bd080=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@38bac9bf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@238a9c1b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1505d34a=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@26dd7893=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@40e1d1b9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c30f14b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1d34128f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@77fae874=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3709c07b=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@77fae874=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38024a06=26, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e4720f2=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@125b59cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5bb701f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3d93c409=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7da0fe20=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@38bac9bf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@26dd7893=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@32dde8e5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1d34128f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7da0fe20=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3d93c409=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@384bf65a=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e914e0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@499213df=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58bf5067=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1505d34a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58bf5067=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@aba5d8c=0, NULL=12333, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@499213df=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@155bd080=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; [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! Received shutdown request...