./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:43:22,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:43:22,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:43:22,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:43:22,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:43:22,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:43:22,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:43:22,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:43:22,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:43:22,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:43:22,146 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:43:22,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:43:22,148 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:43:22,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:43:22,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:43:22,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:43:22,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:43:22,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:43:22,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:43:22,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:43:22,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:43:22,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:43:22,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:43:22,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:43:22,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:43:22,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:43:22,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:43:22,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:43:22,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:43:22,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:43:22,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:43:22,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:43:22,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:43:22,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:43:22,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:43:22,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:43:22,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:43:22,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:43:22,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:43:22,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:43:22,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:43:22,208 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-28 09:43:22,262 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:43:22,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:43:22,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:43:22,263 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:43:22,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:43:22,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:43:22,266 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:43:22,266 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-28 09:43:22,266 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-28 09:43:22,267 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-28 09:43:22,268 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-28 09:43:22,268 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-28 09:43:22,268 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-28 09:43:22,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:43:22,269 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:43:22,269 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-28 09:43:22,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:43:22,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:43:22,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:43:22,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-28 09:43:22,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-28 09:43:22,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-28 09:43:22,271 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:43:22,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:43:22,271 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-28 09:43:22,272 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:43:22,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-28 09:43:22,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:43:22,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:43:22,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:43:22,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:43:22,274 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:43:22,275 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-28 09:43:22,275 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_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/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_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 [2021-10-28 09:43:22,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:43:22,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:43:22,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:43:22,582 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:43:22,583 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:43:22,584 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2021-10-28 09:43:22,684 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/data/22243a5a5/7fedbb2b68ee4c8e9050a19bbd9598c5/FLAG35de97ae6 [2021-10-28 09:43:23,193 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:43:23,194 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2021-10-28 09:43:23,217 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/data/22243a5a5/7fedbb2b68ee4c8e9050a19bbd9598c5/FLAG35de97ae6 [2021-10-28 09:43:23,474 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/data/22243a5a5/7fedbb2b68ee4c8e9050a19bbd9598c5 [2021-10-28 09:43:23,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:43:23,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:43:23,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:43:23,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:43:23,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:43:23,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:43:23" (1/1) ... [2021-10-28 09:43:23,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53290b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:43:23, skipping insertion in model container [2021-10-28 09:43:23,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:43:23" (1/1) ... [2021-10-28 09:43:23,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:43:23,546 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:43:23,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:43:23,978 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:43:24,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:43:24,085 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:43:24,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:43:24 WrapperNode [2021-10-28 09:43:24,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:43:24,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:43:24,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:43:24,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:43:24,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:43:24" (1/1) ... [2021-10-28 09:43:24,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:43:24" (1/1) ... [2021-10-28 09:43:24,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:43:24,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:43:24,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:43:24,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:43:24,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:43:24" (1/1) ... [2021-10-28 09:43:24,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:43:24" (1/1) ... [2021-10-28 09:43:24,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:43:24" (1/1) ... [2021-10-28 09:43:24,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:43:24" (1/1) ... [2021-10-28 09:43:24,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:43:24" (1/1) ... [2021-10-28 09:43:24,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:43:24" (1/1) ... [2021-10-28 09:43:24,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:43:24" (1/1) ... [2021-10-28 09:43:24,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:43:24,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:43:24,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:43:24,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:43:24,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:43:24" (1/1) ... [2021-10-28 09:43:24,207 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 09:43:24,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:43:24,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 09:43:24,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-28 09:43:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-28 09:43:24,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-28 09:43:24,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:43:24,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-28 09:43:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 09:43:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:43:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:43:24,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:43:25,033 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:43:25,033 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-28 09:43:25,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:43:25 BoogieIcfgContainer [2021-10-28 09:43:25,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:43:25,037 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-28 09:43:25,037 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-28 09:43:25,053 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-28 09:43:25,054 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 09:43:25,054 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.10 09:43:23" (1/3) ... [2021-10-28 09:43:25,056 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2227e194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 09:43:25, skipping insertion in model container [2021-10-28 09:43:25,056 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 09:43:25,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:43:24" (2/3) ... [2021-10-28 09:43:25,057 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2227e194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 09:43:25, skipping insertion in model container [2021-10-28 09:43:25,057 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 09:43:25,057 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:43:25" (3/3) ... [2021-10-28 09:43:25,059 INFO L389 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2021-10-28 09:43:25,114 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-28 09:43:25,114 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-28 09:43:25,115 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-28 09:43:25,115 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-28 09:43:25,115 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-28 09:43:25,115 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-28 09:43:25,115 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-28 09:43:25,116 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-28 09:43:25,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:43:25,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-10-28 09:43:25,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:43:25,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:43:25,180 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:43:25,180 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-10-28 09:43:25,181 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-28 09:43:25,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:43:25,184 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-10-28 09:43:25,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:43:25,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:43:25,185 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:43:25,185 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-10-28 09:43:25,193 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(18); 9#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 14#L552-2true [2021-10-28 09:43:25,194 INFO L793 eck$LassoCheckResult]: Loop: 14#L552-2true assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 22#L541-2true assume !true; 7#L540-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 6#L546true assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);havoc main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem18.base, 8 + main_#t~mem18.offset, 4);havoc main_#t~mem18.base, main_#t~mem18.offset; 16#L546-2true call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 12#L552true assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 14#L552-2true [2021-10-28 09:43:25,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:43:25,203 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-28 09:43:25,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:43:25,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811190301] [2021-10-28 09:43:25,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:43:25,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:43:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:43:25,354 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:43:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:43:25,406 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:43:25,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:43:25,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-10-28 09:43:25,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:43:25,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994551132] [2021-10-28 09:43:25,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:43:25,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:43:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:43:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:43:25,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:43:25,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994551132] [2021-10-28 09:43:25,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994551132] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:43:25,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:43:25,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:43:25,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513901742] [2021-10-28 09:43:25,491 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 09:43:25,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:43:25,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-28 09:43:25,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 09:43:25,512 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:43:25,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:43:25,520 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2021-10-28 09:43:25,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-28 09:43:25,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2021-10-28 09:43:25,526 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-10-28 09:43:25,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2021-10-28 09:43:25,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-10-28 09:43:25,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-10-28 09:43:25,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2021-10-28 09:43:25,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:43:25,534 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-10-28 09:43:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2021-10-28 09:43:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-10-28 09:43:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:43:25,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2021-10-28 09:43:25,566 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-10-28 09:43:25,567 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-10-28 09:43:25,567 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-28 09:43:25,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2021-10-28 09:43:25,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-10-28 09:43:25,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:43:25,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:43:25,571 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:43:25,571 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:43:25,572 INFO L791 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(18); 53#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 61#L552-2 [2021-10-28 09:43:25,572 INFO L793 eck$LassoCheckResult]: Loop: 61#L552-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 64#L541-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 50#L540-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 51#L540-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 56#L540-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 54#L546 assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);havoc main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem18.base, 8 + main_#t~mem18.offset, 4);havoc main_#t~mem18.base, main_#t~mem18.offset; 55#L546-2 call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 62#L552 assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 61#L552-2 [2021-10-28 09:43:25,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:43:25,575 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-10-28 09:43:25,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:43:25,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714833920] [2021-10-28 09:43:25,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:43:25,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:43:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:43:25,625 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:43:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:43:25,680 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:43:25,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:43:25,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-10-28 09:43:25,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:43:25,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432990627] [2021-10-28 09:43:25,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:43:25,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:43:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:43:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:43:25,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:43:25,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432990627] [2021-10-28 09:43:25,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432990627] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:43:25,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:43:25,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:43:25,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656724318] [2021-10-28 09:43:25,888 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 09:43:25,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:43:25,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:43:25,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:43:25,889 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:43:26,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:43:26,109 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2021-10-28 09:43:26,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:43:26,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-10-28 09:43:26,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-10-28 09:43:26,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2021-10-28 09:43:26,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-10-28 09:43:26,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-10-28 09:43:26,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2021-10-28 09:43:26,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:43:26,115 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2021-10-28 09:43:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2021-10-28 09:43:26,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2021-10-28 09:43:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:43:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-10-28 09:43:26,118 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-10-28 09:43:26,119 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-10-28 09:43:26,119 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-28 09:43:26,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2021-10-28 09:43:26,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-10-28 09:43:26,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:43:26,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:43:26,120 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:43:26,120 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:43:26,121 INFO L791 eck$LassoCheckResult]: Stem: 104#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(18); 105#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 111#L552-2 [2021-10-28 09:43:26,121 INFO L793 eck$LassoCheckResult]: Loop: 111#L552-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 116#L541-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 101#L540-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 102#L540-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 108#L540-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 106#L546 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 107#L546-2 call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 114#L552 assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 111#L552-2 [2021-10-28 09:43:26,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:43:26,122 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-10-28 09:43:26,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:43:26,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628541330] [2021-10-28 09:43:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:43:26,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:43:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:43:26,138 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:43:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:43:26,156 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:43:26,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:43:26,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-10-28 09:43:26,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:43:26,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072539970] [2021-10-28 09:43:26,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:43:26,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:43:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:43:26,168 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:43:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:43:26,180 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:43:26,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:43:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-10-28 09:43:26,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:43:26,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761870526] [2021-10-28 09:43:26,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:43:26,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:43:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:43:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:43:26,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:43:26,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761870526] [2021-10-28 09:43:26,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761870526] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:43:26,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:43:26,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:43:26,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467221440] [2021-10-28 09:43:26,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:43:26,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:43:26,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:43:26,593 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:43:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:43:26,888 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2021-10-28 09:43:26,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 09:43:26,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2021-10-28 09:43:26,891 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-10-28 09:43:26,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2021-10-28 09:43:26,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-10-28 09:43:26,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-10-28 09:43:26,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2021-10-28 09:43:26,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:43:26,893 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2021-10-28 09:43:26,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2021-10-28 09:43:26,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2021-10-28 09:43:26,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:43:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2021-10-28 09:43:26,896 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-10-28 09:43:26,896 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-10-28 09:43:26,897 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-28 09:43:26,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2021-10-28 09:43:26,898 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-10-28 09:43:26,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:43:26,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:43:26,898 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:43:26,898 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:43:26,898 INFO L791 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(18); 171#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 177#L552-2 [2021-10-28 09:43:26,899 INFO L793 eck$LassoCheckResult]: Loop: 177#L552-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 184#L541-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 168#L540-1 assume !main_#t~short9; 169#L540-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 195#L540-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 193#L546 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 185#L546-2 call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 181#L552 assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 177#L552-2 [2021-10-28 09:43:26,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:43:26,899 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-10-28 09:43:26,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:43:26,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894202341] [2021-10-28 09:43:26,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:43:26,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:43:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:43:26,932 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:43:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:43:26,961 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:43:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:43:26,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-10-28 09:43:26,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:43:26,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980964701] [2021-10-28 09:43:26,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:43:26,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:43:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:43:26,973 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:43:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:43:26,988 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:43:26,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:43:26,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-10-28 09:43:26,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:43:26,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371402383] [2021-10-28 09:43:26,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:43:26,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:43:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:43:27,022 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:43:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:43:27,065 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:43:28,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.10 09:43:28 BoogieIcfgContainer [2021-10-28 09:43:28,165 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-28 09:43:28,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:43:28,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:43:28,166 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:43:28,167 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:43:25" (3/4) ... [2021-10-28 09:43:28,171 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-28 09:43:28,225 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:43:28,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:43:28,227 INFO L168 Benchmark]: Toolchain (without parser) took 4747.79 ms. Allocated memory was 88.1 MB in the beginning and 130.0 MB in the end (delta: 41.9 MB). Free memory was 49.8 MB in the beginning and 84.6 MB in the end (delta: -34.8 MB). Peak memory consumption was 6.7 MB. Max. memory is 16.1 GB. [2021-10-28 09:43:28,228 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 88.1 MB. Free memory is still 67.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:43:28,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 602.44 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 49.6 MB in the beginning and 76.0 MB in the end (delta: -26.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:43:28,229 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.82 ms. Allocated memory is still 107.0 MB. Free memory was 76.0 MB in the beginning and 74.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:43:28,230 INFO L168 Benchmark]: Boogie Preprocessor took 42.22 ms. Allocated memory is still 107.0 MB. Free memory was 74.0 MB in the beginning and 72.2 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:43:28,230 INFO L168 Benchmark]: RCFGBuilder took 840.19 ms. Allocated memory is still 107.0 MB. Free memory was 71.9 MB in the beginning and 47.1 MB in the end (delta: 24.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-10-28 09:43:28,231 INFO L168 Benchmark]: BuchiAutomizer took 3128.35 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 46.7 MB in the beginning and 86.7 MB in the end (delta: -40.0 MB). Peak memory consumption was 17.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:43:28,232 INFO L168 Benchmark]: Witness Printer took 59.63 ms. Allocated memory is still 130.0 MB. Free memory was 86.7 MB in the beginning and 84.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:43:28,235 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.28 ms. Allocated memory is still 88.1 MB. Free memory is still 67.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 602.44 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 49.6 MB in the beginning and 76.0 MB in the end (delta: -26.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.82 ms. Allocated memory is still 107.0 MB. Free memory was 76.0 MB in the beginning and 74.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 42.22 ms. Allocated memory is still 107.0 MB. Free memory was 74.0 MB in the beginning and 72.2 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 840.19 ms. Allocated memory is still 107.0 MB. Free memory was 71.9 MB in the beginning and 47.1 MB in the end (delta: 24.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 3128.35 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 46.7 MB in the beginning and 86.7 MB in the end (delta: -40.0 MB). Peak memory consumption was 17.5 MB. Max. memory is 16.1 GB. * Witness Printer took 59.63 ms. Allocated memory is still 130.0 MB. Free memory was 86.7 MB in the beginning and 84.6 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.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.3s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 68 SDtfs, 29 SDslu, 60 SDs, 0 SdLazy, 100 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 538]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=32661} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@27edd89a=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@238aec48=0, NULL=32663, NULL=32661, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1f2bf3e8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@787e0085=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5d708831=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c771230=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@27edd89a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@fbc59f9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6687051c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d18132d=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50a5870f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c771230=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@73060897=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61094338=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@440ab618=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61094338=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@787e0085=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5d708831=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1d0bc563=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b393e41=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@22824e0d=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6220b048=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2061337e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@440ab618=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@ad5341a=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51d060d1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1d0bc563=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1f2bf3e8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@727851f2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@65639b5a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@22824e0d=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@65639b5a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@422bdafb=24, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b393e41=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@238aec48=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6687051c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@596dc6be=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f0cc79=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2061337e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51d060d1=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@16f7cbb6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@727851f2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f0cc79=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@596dc6be=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@73060897=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d18132d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3bde4068=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42295cb3=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@ad5341a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42295cb3=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48dff682=0, NULL=32662, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3bde4068=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6220b048=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 538]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L535] root->left = ((void *)0) [L536] root->right = ((void *)0) [L537] root->parent = ((void *)0) Loop: [L538] COND TRUE __VERIFIER_nondet_int() [L539] n = root [L540] EXPR n->left [L540] n->left && n->right [L540] COND FALSE !(n->left && n->right) [L546] EXPR n->left [L546] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L552] EXPR n->right [L552] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-10-28 09:43:28,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9faeaec-9bd5-4aed-ae4f-bb5bd36c026d/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...