./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 5fbdf5bf 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 a0142cb115f7d1e16772bca3adcba9f1aba5ac12 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 05:21:15,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 05:21:15,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 05:21:16,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 05:21:16,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 05:21:16,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 05:21:16,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 05:21:16,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 05:21:16,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 05:21:16,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 05:21:16,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 05:21:16,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 05:21:16,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 05:21:16,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 05:21:16,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 05:21:16,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 05:21:16,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 05:21:16,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 05:21:16,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 05:21:16,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 05:21:16,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 05:21:16,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 05:21:16,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 05:21:16,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 05:21:16,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 05:21:16,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 05:21:16,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 05:21:16,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 05:21:16,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 05:21:16,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 05:21:16,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 05:21:16,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 05:21:16,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 05:21:16,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 05:21:16,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 05:21:16,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 05:21:16,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 05:21:16,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 05:21:16,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 05:21:16,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 05:21:16,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 05:21:16,077 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 05:21:16,097 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 05:21:16,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 05:21:16,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 05:21:16,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 05:21:16,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 05:21:16,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 05:21:16,099 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 05:21:16,099 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 05:21:16,099 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 05:21:16,099 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 05:21:16,099 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 05:21:16,100 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 05:21:16,100 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 05:21:16,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 05:21:16,100 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 05:21:16,100 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 05:21:16,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 05:21:16,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 05:21:16,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 05:21:16,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 05:21:16,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 05:21:16,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 05:21:16,108 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 05:21:16,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 05:21:16,109 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 05:21:16,109 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 05:21:16,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 05:21:16,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 05:21:16,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 05:21:16,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 05:21:16,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 05:21:16,114 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 05:21:16,115 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 05:21:16,115 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 -> a0142cb115f7d1e16772bca3adcba9f1aba5ac12 [2021-08-31 05:21:16,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 05:21:16,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 05:21:16,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 05:21:16,470 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 05:21:16,473 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 05:21:16,474 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-08-31 05:21:16,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7cf442e7/f959cc064e594a568299b7b5b06263ad/FLAGcf53b6a5f [2021-08-31 05:21:17,045 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 05:21:17,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2021-08-31 05:21:17,058 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7cf442e7/f959cc064e594a568299b7b5b06263ad/FLAGcf53b6a5f [2021-08-31 05:21:17,360 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7cf442e7/f959cc064e594a568299b7b5b06263ad [2021-08-31 05:21:17,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 05:21:17,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 05:21:17,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 05:21:17,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 05:21:17,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 05:21:17,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 05:21:17" (1/1) ... [2021-08-31 05:21:17,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c8e3a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:17, skipping insertion in model container [2021-08-31 05:21:17,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 05:21:17" (1/1) ... [2021-08-31 05:21:17,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 05:21:17,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 05:21:17,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 05:21:17,656 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 05:21:17,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 05:21:17,724 INFO L208 MainTranslator]: Completed translation [2021-08-31 05:21:17,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:17 WrapperNode [2021-08-31 05:21:17,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 05:21:17,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 05:21:17,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 05:21:17,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 05:21:17,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:17" (1/1) ... [2021-08-31 05:21:17,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:17" (1/1) ... [2021-08-31 05:21:17,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 05:21:17,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 05:21:17,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 05:21:17,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 05:21:17,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:17" (1/1) ... [2021-08-31 05:21:17,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:17" (1/1) ... [2021-08-31 05:21:17,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:17" (1/1) ... [2021-08-31 05:21:17,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:17" (1/1) ... [2021-08-31 05:21:17,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:17" (1/1) ... [2021-08-31 05:21:17,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:17" (1/1) ... [2021-08-31 05:21:17,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:17" (1/1) ... [2021-08-31 05:21:17,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 05:21:17,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 05:21:17,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 05:21:17,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 05:21:17,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:17" (1/1) ... [2021-08-31 05:21:17,836 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:17,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:17,858 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-31 05:21:17,879 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-31 05:21:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-31 05:21:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-31 05:21:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 05:21:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-31 05:21:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-31 05:21:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 05:21:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 05:21:17,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 05:21:18,305 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 05:21:18,306 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-31 05:21:18,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 05:21:18 BoogieIcfgContainer [2021-08-31 05:21:18,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 05:21:18,308 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 05:21:18,308 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 05:21:18,321 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 05:21:18,321 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:21:18,322 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 05:21:17" (1/3) ... [2021-08-31 05:21:18,323 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b9d6779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 05:21:18, skipping insertion in model container [2021-08-31 05:21:18,323 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:21:18,323 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:17" (2/3) ... [2021-08-31 05:21:18,324 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b9d6779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 05:21:18, skipping insertion in model container [2021-08-31 05:21:18,324 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:21:18,324 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 05:21:18" (3/3) ... [2021-08-31 05:21:18,325 INFO L389 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2021-08-31 05:21:18,372 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 05:21:18,372 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 05:21:18,372 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 05:21:18,372 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 05:21:18,372 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 05:21:18,372 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 05:21:18,373 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 05:21:18,373 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 05:21:18,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-08-31 05:21:18,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-08-31 05:21:18,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:18,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:18,411 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:21:18,412 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-31 05:21:18,412 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 05:21:18,412 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-08-31 05:21:18,416 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-08-31 05:21:18,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:18,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:18,416 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:21:18,417 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-31 05:21:18,422 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 12#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 16#L549-2true [2021-08-31 05:21:18,423 INFO L793 eck$LassoCheckResult]: Loop: 16#L549-2true assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 21#L539-2true assume !true; 14#L538-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 10#L544true assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);havoc main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 7#L544-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 20#L549true assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 16#L549-2true [2021-08-31 05:21:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:18,430 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-31 05:21:18,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:18,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291971523] [2021-08-31 05:21:18,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:18,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:18,552 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:18,607 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:18,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:18,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-08-31 05:21:18,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:18,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31445779] [2021-08-31 05:21:18,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:18,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:18,692 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-31 05:21:18,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:18,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31445779] [2021-08-31 05:21:18,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31445779] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:21:18,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:21:18,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 05:21:18,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359303716] [2021-08-31 05:21:18,698 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 05:21:18,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:21:18,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-31 05:21:18,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-31 05:21:18,725 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-08-31 05:21:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:21:18,790 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2021-08-31 05:21:18,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-31 05:21:18,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2021-08-31 05:21:18,800 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-08-31 05:21:18,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2021-08-31 05:21:18,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-31 05:21:18,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-31 05:21:18,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2021-08-31 05:21:18,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:21:18,808 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-08-31 05:21:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2021-08-31 05:21:18,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-08-31 05:21:18,830 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-08-31 05:21:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2021-08-31 05:21:18,832 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-08-31 05:21:18,832 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-08-31 05:21:18,833 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 05:21:18,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2021-08-31 05:21:18,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-08-31 05:21:18,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:18,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:18,837 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:21:18,837 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:21:18,837 INFO L791 eck$LassoCheckResult]: Stem: 56#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 57#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 63#L549-2 [2021-08-31 05:21:18,838 INFO L793 eck$LassoCheckResult]: Loop: 63#L549-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 53#L539-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 64#L538-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 50#L538-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 51#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 62#L544 assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);havoc main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 54#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 55#L549 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 63#L549-2 [2021-08-31 05:21:18,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:18,840 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-31 05:21:18,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:18,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688950949] [2021-08-31 05:21:18,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:18,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:18,881 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:18,903 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:18,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:18,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-08-31 05:21:18,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:18,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717306983] [2021-08-31 05:21:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:18,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:19,055 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-31 05:21:19,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:19,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717306983] [2021-08-31 05:21:19,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717306983] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:21:19,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:21:19,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 05:21:19,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090019537] [2021-08-31 05:21:19,060 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 05:21:19,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:21:19,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 05:21:19,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-31 05:21:19,066 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-08-31 05:21:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:21:19,214 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2021-08-31 05:21:19,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 05:21:19,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-08-31 05:21:19,217 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-08-31 05:21:19,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2021-08-31 05:21:19,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-08-31 05:21:19,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-08-31 05:21:19,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2021-08-31 05:21:19,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:21:19,223 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2021-08-31 05:21:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2021-08-31 05:21:19,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2021-08-31 05:21:19,226 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-08-31 05:21:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-08-31 05:21:19,227 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-08-31 05:21:19,227 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-08-31 05:21:19,228 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 05:21:19,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2021-08-31 05:21:19,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-08-31 05:21:19,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:19,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:19,230 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:21:19,230 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:21:19,230 INFO L791 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 108#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 114#L549-2 [2021-08-31 05:21:19,230 INFO L793 eck$LassoCheckResult]: Loop: 114#L549-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 104#L539-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 115#L538-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 116#L538-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 120#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 113#L544 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 105#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 106#L549 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 114#L549-2 [2021-08-31 05:21:19,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:19,231 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-31 05:21:19,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:19,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340987733] [2021-08-31 05:21:19,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:19,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:19,257 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:19,285 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:19,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:19,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-08-31 05:21:19,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:19,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697634524] [2021-08-31 05:21:19,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:19,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:19,292 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:19,298 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:19,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-08-31 05:21:19,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:19,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006079106] [2021-08-31 05:21:19,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:19,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:19,359 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-31 05:21:19,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:19,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006079106] [2021-08-31 05:21:19,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006079106] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:21:19,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:21:19,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 05:21:19,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921577901] [2021-08-31 05:21:19,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:21:19,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 05:21:19,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-31 05:21:19,607 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-08-31 05:21:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:21:19,806 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2021-08-31 05:21:19,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-31 05:21:19,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2021-08-31 05:21:19,808 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-08-31 05:21:19,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2021-08-31 05:21:19,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-08-31 05:21:19,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-08-31 05:21:19,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2021-08-31 05:21:19,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:21:19,810 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2021-08-31 05:21:19,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2021-08-31 05:21:19,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2021-08-31 05:21:19,811 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-08-31 05:21:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2021-08-31 05:21:19,812 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-08-31 05:21:19,812 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-08-31 05:21:19,812 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 05:21:19,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2021-08-31 05:21:19,815 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-08-31 05:21:19,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:19,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:19,816 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:21:19,816 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:21:19,816 INFO L791 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 173#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 181#L549-2 [2021-08-31 05:21:19,816 INFO L793 eck$LassoCheckResult]: Loop: 181#L549-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 185#L539-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 182#L538-1 assume !main_#t~short9; 183#L538-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 194#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 193#L544 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 192#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 191#L549 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 181#L549-2 [2021-08-31 05:21:19,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:19,817 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-31 05:21:19,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:19,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146219766] [2021-08-31 05:21:19,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:19,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:19,834 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:19,853 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:19,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:19,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-08-31 05:21:19,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:19,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206451814] [2021-08-31 05:21:19,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:19,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:19,865 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:19,882 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:19,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-08-31 05:21:19,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:19,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190120257] [2021-08-31 05:21:19,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:19,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:19,905 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:19,922 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:20,553 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 05:21:20,555 INFO L158 Benchmark]: Toolchain (without parser) took 3191.85ms. Allocated memory was 56.6MB in the beginning and 94.4MB in the end (delta: 37.7MB). Free memory was 34.3MB in the beginning and 41.8MB in the end (delta: -7.6MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2021-08-31 05:21:20,556 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 38.9MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 05:21:20,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.77ms. Allocated memory is still 56.6MB. Free memory was 34.1MB in the beginning and 33.0MB in the end (delta: 1.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-31 05:21:20,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.14ms. Allocated memory is still 56.6MB. Free memory was 33.0MB in the beginning and 30.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 05:21:20,557 INFO L158 Benchmark]: Boogie Preprocessor took 52.50ms. Allocated memory is still 56.6MB. Free memory was 30.9MB in the beginning and 29.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 05:21:20,558 INFO L158 Benchmark]: RCFGBuilder took 487.36ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 29.2MB in the beginning and 46.3MB in the end (delta: -17.1MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2021-08-31 05:21:20,558 INFO L158 Benchmark]: BuchiAutomizer took 2246.75ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 46.3MB in the beginning and 41.8MB in the end (delta: 4.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-08-31 05:21:20,575 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.22ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 38.9MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.77ms. Allocated memory is still 56.6MB. Free memory was 34.1MB in the beginning and 33.0MB in the end (delta: 1.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.14ms. Allocated memory is still 56.6MB. Free memory was 33.0MB in the beginning and 30.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.50ms. Allocated memory is still 56.6MB. Free memory was 30.9MB in the beginning and 29.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 487.36ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 29.2MB in the beginning and 46.3MB in the end (delta: -17.1MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 2246.75ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 46.3MB in the beginning and 41.8MB in the end (delta: 4.5MB). Peak memory consumption was 23.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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 05:21:20,636 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...