./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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_cnstr.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 66a6115d1da56800c2be9161dfbbac5b90c8a3d9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-20ed64e [2021-08-27 17:39:55,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:39:55,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:39:55,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:39:55,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:39:55,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:39:55,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:39:55,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:39:55,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:39:55,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:39:55,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:39:55,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:39:55,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:39:55,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:39:55,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:39:55,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:39:55,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:39:55,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:39:55,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:39:55,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:39:55,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:39:55,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:39:55,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:39:55,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:39:55,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:39:55,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:39:55,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:39:55,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:39:55,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:39:55,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:39:55,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:39:55,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:39:55,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:39:55,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:39:55,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:39:55,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:39:55,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:39:55,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:39:55,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:39:55,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:39:55,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:39:55,960 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:39:55,999 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:39:56,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:39:56,000 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:39:56,000 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:39:56,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:39:56,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:39:56,002 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:39:56,002 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:39:56,002 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:39:56,002 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:39:56,002 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:39:56,002 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:39:56,002 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:39:56,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:39:56,003 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:39:56,003 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:39:56,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:39:56,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:39:56,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:39:56,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:39:56,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:39:56,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:39:56,004 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:39:56,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:39:56,004 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:39:56,004 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:39:56,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:39:56,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:39:56,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:39:56,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:39:56,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:39:56,005 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:39:56,006 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:39:56,006 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 -> 66a6115d1da56800c2be9161dfbbac5b90c8a3d9 [2021-08-27 17:39:56,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:39:56,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:39:56,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:39:56,389 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:39:56,389 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:39:56,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2021-08-27 17:39:56,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a85a2551/dd2479d9c8564e89aee220dfbcc6c329/FLAGec3a37511 [2021-08-27 17:39:57,004 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:39:57,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2021-08-27 17:39:57,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a85a2551/dd2479d9c8564e89aee220dfbcc6c329/FLAGec3a37511 [2021-08-27 17:39:57,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a85a2551/dd2479d9c8564e89aee220dfbcc6c329 [2021-08-27 17:39:57,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:39:57,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:39:57,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:39:57,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:39:57,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:39:57,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:39:57" (1/1) ... [2021-08-27 17:39:57,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533ead80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:57, skipping insertion in model container [2021-08-27 17:39:57,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:39:57" (1/1) ... [2021-08-27 17:39:57,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:39:57,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:39:57,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:39:57,780 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:39:57,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:39:57,856 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:39:57,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:57 WrapperNode [2021-08-27 17:39:57,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:39:57,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:39:57,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:39:57,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:39:57,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:57" (1/1) ... [2021-08-27 17:39:57,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:57" (1/1) ... [2021-08-27 17:39:57,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:39:57,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:39:57,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:39:57,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:39:57,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:57" (1/1) ... [2021-08-27 17:39:57,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:57" (1/1) ... [2021-08-27 17:39:57,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:57" (1/1) ... [2021-08-27 17:39:57,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:57" (1/1) ... [2021-08-27 17:39:57,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:57" (1/1) ... [2021-08-27 17:39:57,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:57" (1/1) ... [2021-08-27 17:39:57,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:57" (1/1) ... [2021-08-27 17:39:57,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:39:57,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:39:57,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:39:57,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:39:57,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:57" (1/1) ... [2021-08-27 17:39:57,991 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:57,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:58,022 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-08-27 17:39:58,056 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-08-27 17:39:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 17:39:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 17:39:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:39:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 17:39:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 17:39:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 17:39:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:39:58,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:39:58,596 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:39:58,597 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-27 17:39:58,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:39:58 BoogieIcfgContainer [2021-08-27 17:39:58,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:39:58,600 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:39:58,600 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:39:58,602 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:39:58,603 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:39:58,603 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:39:57" (1/3) ... [2021-08-27 17:39:58,604 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26a45f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:39:58, skipping insertion in model container [2021-08-27 17:39:58,604 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:39:58,604 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:57" (2/3) ... [2021-08-27 17:39:58,604 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26a45f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:39:58, skipping insertion in model container [2021-08-27 17:39:58,604 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:39:58,604 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:39:58" (3/3) ... [2021-08-27 17:39:58,605 INFO L389 chiAutomizerObserver]: Analyzing ICFG tree_cnstr.i [2021-08-27 17:39:58,652 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:39:58,652 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:39:58,652 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:39:58,652 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:39:58,652 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:39:58,652 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:39:58,652 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:39:58,652 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:39:58,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 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-08-27 17:39:58,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-08-27 17:39:58,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:39:58,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:39:58,691 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:39:58,691 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:39:58,691 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:39:58,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 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-08-27 17:39:58,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-08-27 17:39:58,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:39:58,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:39:58,696 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:39:58,696 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:39:58,702 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 17#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 13#L545-2true [2021-08-27 17:39:58,702 INFO L793 eck$LassoCheckResult]: Loop: 13#L545-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; 15#L535-2true assume !true; 18#L534-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 19#L540true assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);havoc main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 21#L540-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 10#L545true assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 13#L545-2true [2021-08-27 17:39:58,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:58,708 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 17:39:58,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:58,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109551396] [2021-08-27 17:39:58,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:58,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:58,821 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:39:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:58,863 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:39:58,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:58,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-08-27 17:39:58,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:58,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365126728] [2021-08-27 17:39:58,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:58,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:39:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:39:58,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:39:58,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365126728] [2021-08-27 17:39:58,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365126728] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:39:58,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:39:58,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 17:39:58,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279959343] [2021-08-27 17:39:58,915 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:39:58,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:39:58,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 17:39:58,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 17:39:58,929 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 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) 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-08-27 17:39:58,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:39:58,935 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2021-08-27 17:39:58,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 17:39:58,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-08-27 17:39:58,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-08-27 17:39:58,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 31 transitions. [2021-08-27 17:39:58,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:39:58,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:39:58,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2021-08-27 17:39:58,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:39:58,943 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2021-08-27 17:39:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2021-08-27 17:39:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-08-27 17:39:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 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-08-27 17:39:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2021-08-27 17:39:58,964 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2021-08-27 17:39:58,964 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2021-08-27 17:39:58,964 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:39:58,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2021-08-27 17:39:58,965 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-08-27 17:39:58,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:39:58,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:39:58,966 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:39:58,966 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:39:58,972 INFO L791 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 61#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 66#L545-2 [2021-08-27 17:39:58,973 INFO L793 eck$LassoCheckResult]: Loop: 66#L545-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; 62#L535-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; 56#L534-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; 57#L534-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; 58#L534-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 70#L540 assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);havoc main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 71#L540-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 65#L545 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 66#L545-2 [2021-08-27 17:39:58,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:58,973 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-27 17:39:58,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:58,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231079449] [2021-08-27 17:39:58,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:58,974 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:58,989 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:39:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:59,006 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:39:59,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:59,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-08-27 17:39:59,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:59,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304562289] [2021-08-27 17:39:59,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:59,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:39:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:39:59,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:39:59,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304562289] [2021-08-27 17:39:59,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304562289] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:39:59,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:39:59,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 17:39:59,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256442903] [2021-08-27 17:39:59,181 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:39:59,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:39:59,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:39:59,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:39:59,182 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 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-08-27 17:39:59,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:39:59,373 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2021-08-27 17:39:59,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:39:59,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. [2021-08-27 17:39:59,376 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-08-27 17:39:59,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 41 transitions. [2021-08-27 17:39:59,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-08-27 17:39:59,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-08-27 17:39:59,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 41 transitions. [2021-08-27 17:39:59,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:39:59,379 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2021-08-27 17:39:59,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 41 transitions. [2021-08-27 17:39:59,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2021-08-27 17:39:59,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 states have internal predecessors, (35), 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-08-27 17:39:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2021-08-27 17:39:59,382 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2021-08-27 17:39:59,382 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2021-08-27 17:39:59,382 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:39:59,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2021-08-27 17:39:59,383 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-08-27 17:39:59,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:39:59,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:39:59,383 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:39:59,383 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:39:59,383 INFO L791 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 119#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 124#L545-2 [2021-08-27 17:39:59,383 INFO L793 eck$LassoCheckResult]: Loop: 124#L545-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; 120#L535-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; 113#L534-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; 114#L534-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; 135#L534-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 129#L540 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; 130#L540-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 123#L545 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 124#L545-2 [2021-08-27 17:39:59,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-27 17:39:59,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:59,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539937739] [2021-08-27 17:39:59,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:59,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:59,397 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:39:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:59,412 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:39:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-08-27 17:39:59,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:59,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653467661] [2021-08-27 17:39:59,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:59,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:59,421 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:39:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:59,430 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:39:59,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:59,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-08-27 17:39:59,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:59,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554565707] [2021-08-27 17:39:59,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:59,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:39:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:39:59,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:39:59,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554565707] [2021-08-27 17:39:59,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554565707] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:39:59,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:39:59,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 17:39:59,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643777388] [2021-08-27 17:39:59,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:39:59,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:39:59,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:39:59,966 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 14 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-08-27 17:40:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:00,236 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2021-08-27 17:40:00,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:40:00,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 80 transitions. [2021-08-27 17:40:00,238 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 44 [2021-08-27 17:40:00,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 80 transitions. [2021-08-27 17:40:00,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2021-08-27 17:40:00,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2021-08-27 17:40:00,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 80 transitions. [2021-08-27 17:40:00,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:00,240 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 80 transitions. [2021-08-27 17:40:00,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 80 transitions. [2021-08-27 17:40:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2021-08-27 17:40:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 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-08-27 17:40:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2021-08-27 17:40:00,243 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2021-08-27 17:40:00,243 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2021-08-27 17:40:00,243 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:40:00,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2021-08-27 17:40:00,244 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2021-08-27 17:40:00,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:00,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:00,244 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:40:00,244 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:00,245 INFO L791 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 209#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 215#L545-2 [2021-08-27 17:40:00,245 INFO L793 eck$LassoCheckResult]: Loop: 215#L545-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; 218#L535-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; 204#L534-1 assume !main_#t~short9; 205#L534-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; 234#L534-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 232#L540 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; 227#L540-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 214#L545 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 215#L545-2 [2021-08-27 17:40:00,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:00,245 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-27 17:40:00,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:00,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512846411] [2021-08-27 17:40:00,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:00,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:00,255 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:00,264 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:00,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:00,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-08-27 17:40:00,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:00,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382569675] [2021-08-27 17:40:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:00,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:00,272 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:00,279 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:00,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:00,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-08-27 17:40:00,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:00,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577355796] [2021-08-27 17:40:00,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:00,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:00,290 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:00,305 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:00,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 05:40:00 BoogieIcfgContainer [2021-08-27 17:40:00,980 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 17:40:00,986 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 17:40:00,986 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 17:40:00,987 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 17:40:00,987 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:39:58" (3/4) ... [2021-08-27 17:40:00,989 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 17:40:01,049 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 17:40:01,049 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 17:40:01,050 INFO L168 Benchmark]: Toolchain (without parser) took 3617.72 ms. Allocated memory was 58.7 MB in the beginning and 92.3 MB in the end (delta: 33.6 MB). Free memory was 36.2 MB in the beginning and 70.0 MB in the end (delta: -33.8 MB). Peak memory consumption was 40.9 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:01,051 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 58.7 MB. Free memory was 41.0 MB in the beginning and 40.9 MB in the end (delta: 42.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:40:01,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.09 ms. Allocated memory is still 58.7 MB. Free memory was 36.1 MB in the beginning and 35.6 MB in the end (delta: 452.6 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:01,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.27 ms. Allocated memory is still 58.7 MB. Free memory was 35.6 MB in the beginning and 33.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:01,059 INFO L168 Benchmark]: Boogie Preprocessor took 55.28 ms. Allocated memory is still 58.7 MB. Free memory was 33.5 MB in the beginning and 31.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:01,059 INFO L168 Benchmark]: RCFGBuilder took 615.57 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 31.7 MB in the beginning and 55.8 MB in the end (delta: -24.1 MB). Peak memory consumption was 15.0 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:01,060 INFO L168 Benchmark]: BuchiAutomizer took 2380.66 ms. Allocated memory was 75.5 MB in the beginning and 92.3 MB in the end (delta: 16.8 MB). Free memory was 55.8 MB in the beginning and 32.6 MB in the end (delta: 23.2 MB). Peak memory consumption was 44.6 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:01,060 INFO L168 Benchmark]: Witness Printer took 63.43 ms. Allocated memory is still 92.3 MB. Free memory was 32.6 MB in the beginning and 70.0 MB in the end (delta: -37.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:01,063 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 58.7 MB. Free memory was 41.0 MB in the beginning and 40.9 MB in the end (delta: 42.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 421.09 ms. Allocated memory is still 58.7 MB. Free memory was 36.1 MB in the beginning and 35.6 MB in the end (delta: 452.6 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.27 ms. Allocated memory is still 58.7 MB. Free memory was 35.6 MB in the beginning and 33.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.28 ms. Allocated memory is still 58.7 MB. Free memory was 33.5 MB in the beginning and 31.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 615.57 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 31.7 MB in the beginning and 55.8 MB in the end (delta: -24.1 MB). Peak memory consumption was 15.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2380.66 ms. Allocated memory was 75.5 MB in the beginning and 92.3 MB in the end (delta: 16.8 MB). Free memory was 55.8 MB in the beginning and 32.6 MB in the end (delta: 23.2 MB). Peak memory consumption was 44.6 MB. Max. memory is 16.1 GB. * Witness Printer took 63.43 ms. Allocated memory is still 92.3 MB. Free memory was 32.6 MB in the beginning and 70.0 MB in the end (delta: -37.4 MB). Peak memory consumption was 2.4 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 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 15.6ms AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 50 SDslu, 76 SDs, 0 SdLazy, 156 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 290.1ms 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: 532]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=31292} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e309ffb=0, NULL=0, NULL=31293, NULL=31292, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70d7a926=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@52ab3f41=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@799ba0ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@47f6a4b0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3132f32c=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51536f38=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@64f714e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e309ffb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@52ab3f41=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b77cc2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@150c04a0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45cef729=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3eb87dfd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@64f714e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@710216ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@766884c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5bcf75c4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@766884c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@47f6a4b0=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51536f38=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70d7a926=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4b156c8d=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f5bf849=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@9899113=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5bcf75c4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6e9effc3=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4637305e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@799ba0ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6a18b90f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e46628a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4b156c8d=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e46628a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1641f17a=26, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@150c04a0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3132f32c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@9899113=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4637305e=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@26ff289a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6a18b90f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@339f0504=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@710216ef=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6e9effc3=0, pred=0, NULL=31294, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f5bf849=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 532]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L529] struct TreeNode* root = malloc(sizeof(*root)), *n; [L529] struct TreeNode* root = malloc(sizeof(*root)), *n; [L530] root->left = ((void *)0) [L531] root->right = ((void *)0) Loop: [L532] COND TRUE __VERIFIER_nondet_int() [L533] n = root [L534] EXPR n->left [L534] n->left && n->right [L534] COND FALSE !(n->left && n->right) [L540] EXPR n->left [L540] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L545] EXPR n->right [L545] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-08-27 17:40:01,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...