./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_stack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/memsafety-ext/tree_stack.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 22:50:28,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 22:50:28,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 22:50:28,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 22:50:28,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 22:50:28,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 22:50:28,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 22:50:28,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 22:50:28,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 22:50:28,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 22:50:28,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 22:50:28,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 22:50:28,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 22:50:28,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 22:50:28,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 22:50:28,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 22:50:28,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 22:50:28,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 22:50:28,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 22:50:28,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 22:50:28,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 22:50:28,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 22:50:28,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 22:50:28,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 22:50:28,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 22:50:28,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 22:50:28,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 22:50:28,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 22:50:28,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 22:50:28,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 22:50:28,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 22:50:28,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 22:50:28,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 22:50:28,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 22:50:28,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 22:50:28,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 22:50:28,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 22:50:28,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 22:50:28,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 22:50:28,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 22:50:28,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 22:50:28,914 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-21 22:50:28,936 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 22:50:28,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 22:50:28,937 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 22:50:28,937 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 22:50:28,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 22:50:28,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 22:50:28,938 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 22:50:28,938 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 22:50:28,938 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 22:50:28,939 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 22:50:28,939 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 22:50:28,939 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 22:50:28,939 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 22:50:28,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 22:50:28,940 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 22:50:28,940 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 22:50:28,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 22:50:28,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 22:50:28,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 22:50:28,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 22:50:28,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 22:50:28,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 22:50:28,941 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 22:50:28,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 22:50:28,941 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 22:50:28,941 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 22:50:28,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 22:50:28,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 22:50:28,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 22:50:28,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 22:50:28,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 22:50:28,942 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 22:50:28,943 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 22:50:28,943 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c [2021-12-21 22:50:29,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 22:50:29,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 22:50:29,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 22:50:29,131 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 22:50:29,132 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 22:50:29,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2021-12-21 22:50:29,180 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06b5d8223/ca71a3ae57cb4ee9a51bc02b219b9921/FLAG1e8718e88 [2021-12-21 22:50:29,583 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 22:50:29,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2021-12-21 22:50:29,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06b5d8223/ca71a3ae57cb4ee9a51bc02b219b9921/FLAG1e8718e88 [2021-12-21 22:50:29,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06b5d8223/ca71a3ae57cb4ee9a51bc02b219b9921 [2021-12-21 22:50:29,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 22:50:29,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 22:50:29,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 22:50:29,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 22:50:29,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 22:50:29,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:50:29" (1/1) ... [2021-12-21 22:50:29,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5865d0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:29, skipping insertion in model container [2021-12-21 22:50:29,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:50:29" (1/1) ... [2021-12-21 22:50:29,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 22:50:29,642 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 22:50:29,855 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:50:29,863 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 22:50:29,891 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:50:29,908 INFO L208 MainTranslator]: Completed translation [2021-12-21 22:50:29,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:29 WrapperNode [2021-12-21 22:50:29,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 22:50:29,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 22:50:29,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 22:50:29,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 22:50:29,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:29" (1/1) ... [2021-12-21 22:50:29,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:29" (1/1) ... [2021-12-21 22:50:29,947 INFO L137 Inliner]: procedures = 123, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2021-12-21 22:50:29,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 22:50:29,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 22:50:29,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 22:50:29,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 22:50:29,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:29" (1/1) ... [2021-12-21 22:50:29,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:29" (1/1) ... [2021-12-21 22:50:29,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:29" (1/1) ... [2021-12-21 22:50:29,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:29" (1/1) ... [2021-12-21 22:50:29,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:29" (1/1) ... [2021-12-21 22:50:29,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:29" (1/1) ... [2021-12-21 22:50:29,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:29" (1/1) ... [2021-12-21 22:50:29,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 22:50:29,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 22:50:29,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 22:50:29,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 22:50:29,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:29" (1/1) ... [2021-12-21 22:50:29,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:29,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:30,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:50:30,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-21 22:50:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 22:50:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 22:50:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 22:50:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 22:50:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 22:50:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 22:50:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 22:50:30,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 22:50:30,124 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 22:50:30,125 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 22:50:30,338 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 22:50:30,342 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 22:50:30,342 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-21 22:50:30,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:50:30 BoogieIcfgContainer [2021-12-21 22:50:30,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 22:50:30,345 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 22:50:30,345 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 22:50:30,347 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 22:50:30,348 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:50:30,348 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 10:50:29" (1/3) ... [2021-12-21 22:50:30,349 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@205dddf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:50:30, skipping insertion in model container [2021-12-21 22:50:30,349 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:50:30,349 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:29" (2/3) ... [2021-12-21 22:50:30,349 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@205dddf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:50:30, skipping insertion in model container [2021-12-21 22:50:30,349 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:50:30,349 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:50:30" (3/3) ... [2021-12-21 22:50:30,350 INFO L388 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2021-12-21 22:50:30,377 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 22:50:30,377 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 22:50:30,378 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 22:50:30,378 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 22:50:30,378 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 22:50:30,378 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 22:50:30,378 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 22:50:30,378 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 22:50:30,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:30,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-12-21 22:50:30,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:30,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:30,418 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:50:30,418 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-21 22:50:30,418 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 22:50:30,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:30,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-12-21 22:50:30,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:30,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:30,420 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:50:30,420 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-21 22:50:30,425 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 16#L549-2true [2021-12-21 22:50:30,425 INFO L793 eck$LassoCheckResult]: Loop: 16#L549-2true assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 21#L539-2true assume !true; 14#L538-5true call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 10#L544true assume (main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; 7#L544-2true call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 20#L549true assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 16#L549-2true [2021-12-21 22:50:30,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:30,429 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-21 22:50:30,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:30,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761161535] [2021-12-21 22:50:30,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:30,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:30,551 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:30,595 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:30,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:30,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-12-21 22:50:30,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:30,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897711158] [2021-12-21 22:50:30,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:30,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:50:30,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:30,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897711158] [2021-12-21 22:50:30,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897711158] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:50:30,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:50:30,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 22:50:30,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135705578] [2021-12-21 22:50:30,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:50:30,677 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:50:30,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:30,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 22:50:30,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 22:50:30,708 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:30,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:30,715 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2021-12-21 22:50:30,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 22:50:30,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2021-12-21 22:50:30,722 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-12-21 22:50:30,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2021-12-21 22:50:30,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-21 22:50:30,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-21 22:50:30,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2021-12-21 22:50:30,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:30,727 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-12-21 22:50:30,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2021-12-21 22:50:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-21 22:50:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2021-12-21 22:50:30,744 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-12-21 22:50:30,745 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-12-21 22:50:30,745 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 22:50:30,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2021-12-21 22:50:30,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-12-21 22:50:30,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:30,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:30,747 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:50:30,747 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:30,748 INFO L791 eck$LassoCheckResult]: Stem: 56#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 57#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 63#L549-2 [2021-12-21 22:50:30,748 INFO L793 eck$LassoCheckResult]: Loop: 63#L549-2 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 53#L539-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 64#L538-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; 50#L538-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 51#L538-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 62#L544 assume (main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; 54#L544-2 call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 55#L549 assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 63#L549-2 [2021-12-21 22:50:30,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:30,750 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-21 22:50:30,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:30,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570820719] [2021-12-21 22:50:30,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:30,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:30,780 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:30,793 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:30,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:30,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-12-21 22:50:30,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:30,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563780512] [2021-12-21 22:50:30,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:30,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:50:30,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:30,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563780512] [2021-12-21 22:50:30,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563780512] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:50:30,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:50:30,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 22:50:30,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077058795] [2021-12-21 22:50:30,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:50:30,962 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:50:30,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:30,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 22:50:30,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 22:50:30,963 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:31,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:31,056 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2021-12-21 22:50:31,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 22:50:31,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-12-21 22:50:31,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-12-21 22:50:31,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2021-12-21 22:50:31,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-12-21 22:50:31,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-12-21 22:50:31,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2021-12-21 22:50:31,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:31,066 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2021-12-21 22:50:31,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2021-12-21 22:50:31,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2021-12-21 22:50:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:31,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-12-21 22:50:31,073 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-12-21 22:50:31,073 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-12-21 22:50:31,073 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 22:50:31,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2021-12-21 22:50:31,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-12-21 22:50:31,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:31,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:31,075 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:50:31,075 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:31,076 INFO L791 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 108#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 114#L549-2 [2021-12-21 22:50:31,076 INFO L793 eck$LassoCheckResult]: Loop: 114#L549-2 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 104#L539-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 115#L538-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; 116#L538-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 120#L538-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 113#L544 assume !((main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; 105#L544-2 call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 106#L549 assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 114#L549-2 [2021-12-21 22:50:31,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:31,076 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-21 22:50:31,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:31,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681780595] [2021-12-21 22:50:31,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:31,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:31,101 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:31,113 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:31,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:31,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-12-21 22:50:31,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:31,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14969812] [2021-12-21 22:50:31,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:31,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:31,134 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:31,166 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:31,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:31,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-12-21 22:50:31,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:31,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260362591] [2021-12-21 22:50:31,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:31,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:50:31,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:31,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260362591] [2021-12-21 22:50:31,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260362591] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:50:31,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:50:31,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 22:50:31,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696912507] [2021-12-21 22:50:31,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:50:31,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:31,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 22:50:31,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 22:50:31,423 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:31,559 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2021-12-21 22:50:31,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 22:50:31,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2021-12-21 22:50:31,562 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-12-21 22:50:31,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2021-12-21 22:50:31,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-12-21 22:50:31,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-12-21 22:50:31,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2021-12-21 22:50:31,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:31,563 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2021-12-21 22:50:31,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2021-12-21 22:50:31,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2021-12-21 22:50:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2021-12-21 22:50:31,565 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-12-21 22:50:31,565 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-12-21 22:50:31,565 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-21 22:50:31,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2021-12-21 22:50:31,565 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-12-21 22:50:31,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:31,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:31,566 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:50:31,566 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:31,566 INFO L791 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 173#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 181#L549-2 [2021-12-21 22:50:31,566 INFO L793 eck$LassoCheckResult]: Loop: 181#L549-2 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 185#L539-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 182#L538-1 assume !main_#t~short7#1; 183#L538-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 194#L538-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 193#L544 assume !((main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; 192#L544-2 call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 191#L549 assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 181#L549-2 [2021-12-21 22:50:31,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:31,566 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-21 22:50:31,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:31,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466511810] [2021-12-21 22:50:31,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:31,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:31,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:31,596 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:31,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:31,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-12-21 22:50:31,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:31,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732238668] [2021-12-21 22:50:31,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:31,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:31,603 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:31,612 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:31,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:31,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-12-21 22:50:31,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:31,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449853243] [2021-12-21 22:50:31,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:31,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:31,634 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:31,643 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:32,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.12 10:50:32 BoogieIcfgContainer [2021-12-21 22:50:32,072 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-21 22:50:32,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 22:50:32,072 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 22:50:32,073 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 22:50:32,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:50:30" (3/4) ... [2021-12-21 22:50:32,075 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-21 22:50:32,098 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 22:50:32,099 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 22:50:32,102 INFO L158 Benchmark]: Toolchain (without parser) took 2493.58ms. Allocated memory was 115.3MB in the beginning and 144.7MB in the end (delta: 29.4MB). Free memory was 82.7MB in the beginning and 106.2MB in the end (delta: -23.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2021-12-21 22:50:32,102 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 79.7MB. Free memory was 37.5MB in the beginning and 37.4MB in the end (delta: 39.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 22:50:32,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.48ms. Allocated memory is still 115.3MB. Free memory was 82.5MB in the beginning and 82.8MB in the end (delta: -293.2kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-21 22:50:32,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.01ms. Allocated memory is still 115.3MB. Free memory was 82.8MB in the beginning and 80.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 22:50:32,103 INFO L158 Benchmark]: Boogie Preprocessor took 20.70ms. Allocated memory is still 115.3MB. Free memory was 80.5MB in the beginning and 79.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 22:50:32,104 INFO L158 Benchmark]: RCFGBuilder took 372.79ms. Allocated memory is still 115.3MB. Free memory was 78.6MB in the beginning and 58.8MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-21 22:50:32,107 INFO L158 Benchmark]: BuchiAutomizer took 1727.09ms. Allocated memory was 115.3MB in the beginning and 144.7MB in the end (delta: 29.4MB). Free memory was 58.5MB in the beginning and 108.3MB in the end (delta: -49.8MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2021-12-21 22:50:32,107 INFO L158 Benchmark]: Witness Printer took 26.51ms. Allocated memory is still 144.7MB. Free memory was 108.3MB in the beginning and 106.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 22:50:32,108 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.09ms. Allocated memory is still 79.7MB. Free memory was 37.5MB in the beginning and 37.4MB in the end (delta: 39.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.48ms. Allocated memory is still 115.3MB. Free memory was 82.5MB in the beginning and 82.8MB in the end (delta: -293.2kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.01ms. Allocated memory is still 115.3MB. Free memory was 82.8MB in the beginning and 80.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.70ms. Allocated memory is still 115.3MB. Free memory was 80.5MB in the beginning and 79.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.79ms. Allocated memory is still 115.3MB. Free memory was 78.6MB in the beginning and 58.8MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 1727.09ms. Allocated memory was 115.3MB in the beginning and 144.7MB in the end (delta: 29.4MB). Free memory was 58.5MB in the beginning and 108.3MB in the end (delta: -49.8MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * Witness Printer took 26.51ms. Allocated memory is still 144.7MB. Free memory was 108.3MB in the beginning and 106.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 68 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 536]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4cdeda6b=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d0331b4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@55c77112=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f0e97c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c082bd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@55c77112=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f475324=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6ff4f35b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7df00550=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69cc2be3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2327e0b7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14ed8cf2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@52845299=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6ff4f35b=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2344eb8a=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f0e97c7=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69cc2be3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@af4d28e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@175ba780=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ca4216b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1f063155=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@175ba780=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@119c2dcc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7df00550=0, n=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1a4533c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@302a2cfa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75fca069=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c6014cc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4cdeda6b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75fca069=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c6014cc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14ed8cf2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c082bd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@524f0018=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a2b98a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2327e0b7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2344eb8a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1f063155=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d0331b4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@119c2dcc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@52845299=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ca4216b=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66466aa1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1a4533c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@467e974f=9, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a2b98a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f475324=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10ad8427=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@524f0018=0, s=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 536]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] root->left = ((void *)0) [L535] root->right = ((void *)0) Loop: [L536] COND TRUE __VERIFIER_nondet_int() [L537] n = root [L538] EXPR n->left [L538] n->left && n->right [L538] COND FALSE !(n->left && n->right) [L544] EXPR n->left [L544] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L549] EXPR n->right [L549] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-21 22:50:32,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)