./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/termination-memory-alloca/java_Nested-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 6441f2629f7ca5357ff69069fc5c217332d52665 ................................................................................................................................................................................................................................................................................................................................................................................................................... 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*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@7a50fa5c --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:34:28,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:34:28,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:34:28,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:34:28,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:34:28,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:34:28,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:34:28,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:34:28,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:34:28,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:34:28,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:34:28,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:34:28,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:34:28,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:34:28,151 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:34:28,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:34:28,155 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:34:28,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:34:28,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:34:28,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:34:28,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:34:28,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:34:28,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:34:28,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:34:28,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:34:28,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:34:28,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:34:28,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:34:28,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:34:28,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:34:28,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:34:28,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:34:28,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:34:28,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:34:28,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:34:28,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:34:28,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:34:28,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:34:28,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:34:28,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:34:28,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:34:28,193 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:34:28,229 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:34:28,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:34:28,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:34:28,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:34:28,237 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:34:28,237 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:34:28,237 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:34:28,238 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:34:28,238 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:34:28,238 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:34:28,239 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:34:28,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:34:28,240 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:34:28,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:34:28,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:34:28,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:34:28,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:34:28,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:34:28,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:34:28,242 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:34:28,242 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:34:28,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:34:28,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:34:28,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:34:28,243 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:34:28,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:34:28,244 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:34:28,244 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:34:28,245 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:34:28,246 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:34:28,246 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6441f2629f7ca5357ff69069fc5c217332d52665 [2019-11-28 20:34:28,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:34:28,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:34:28,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:34:28,576 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:34:28,577 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:34:28,578 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2019-11-28 20:34:28,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee81db4f/73c24f1e9ea0451abd0ed4e39de31378/FLAGdcb86e454 [2019-11-28 20:34:29,245 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:34:29,247 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2019-11-28 20:34:29,266 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee81db4f/73c24f1e9ea0451abd0ed4e39de31378/FLAGdcb86e454 [2019-11-28 20:34:29,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee81db4f/73c24f1e9ea0451abd0ed4e39de31378 [2019-11-28 20:34:29,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:34:29,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:34:29,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:34:29,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:34:29,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:34:29,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:34:29" (1/1) ... [2019-11-28 20:34:29,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc06011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:29, skipping insertion in model container [2019-11-28 20:34:29,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:34:29" (1/1) ... [2019-11-28 20:34:29,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:34:29,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:34:30,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:34:30,014 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:34:30,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:34:30,139 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:34:30,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:30 WrapperNode [2019-11-28 20:34:30,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:34:30,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:34:30,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:34:30,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:34:30,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:30" (1/1) ... [2019-11-28 20:34:30,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:30" (1/1) ... [2019-11-28 20:34:30,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:34:30,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:34:30,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:34:30,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:34:30,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:30" (1/1) ... [2019-11-28 20:34:30,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:30" (1/1) ... [2019-11-28 20:34:30,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:30" (1/1) ... [2019-11-28 20:34:30,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:30" (1/1) ... [2019-11-28 20:34:30,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:30" (1/1) ... [2019-11-28 20:34:30,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:30" (1/1) ... [2019-11-28 20:34:30,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:30" (1/1) ... [2019-11-28 20:34:30,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:34:30,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:34:30,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:34:30,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:34:30,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:34:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:34:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:34:30,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:34:30,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:34:30,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:34:30,589 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:34:30,590 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 20:34:30,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:30 BoogieIcfgContainer [2019-11-28 20:34:30,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:34:30,592 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:34:30,592 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:34:30,596 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:34:30,597 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:30,597 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:34:29" (1/3) ... [2019-11-28 20:34:30,599 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63134cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:34:30, skipping insertion in model container [2019-11-28 20:34:30,599 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:30,599 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:30" (2/3) ... [2019-11-28 20:34:30,600 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63134cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:34:30, skipping insertion in model container [2019-11-28 20:34:30,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:30,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:30" (3/3) ... [2019-11-28 20:34:30,602 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i [2019-11-28 20:34:30,644 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:34:30,644 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:34:30,645 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:34:30,645 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:34:30,646 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:34:30,646 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:34:30,646 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:34:30,647 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:34:30,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-28 20:34:30,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:34:30,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:30,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:30,687 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:34:30,688 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:34:30,688 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:34:30,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-28 20:34:30,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:34:30,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:30,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:30,691 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:34:30,691 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:34:30,697 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 4#L552-4true [2019-11-28 20:34:30,698 INFO L796 eck$LassoCheckResult]: Loop: 4#L552-4true call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 9#L552-1true assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 13#L553-4true assume !true; 14#L552-3true call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 4#L552-4true [2019-11-28 20:34:30,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:30,707 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 20:34:30,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:30,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001393085] [2019-11-28 20:34:30,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:30,896 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:30,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1113608, now seen corresponding path program 1 times [2019-11-28 20:34:30,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:30,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369988995] [2019-11-28 20:34:30,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:30,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369988995] [2019-11-28 20:34:30,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:34:30,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:34:30,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448227884] [2019-11-28 20:34:30,952 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:34:30,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:30,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:34:30,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:34:30,974 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-11-28 20:34:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:34:30,980 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-11-28 20:34:30,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:34:30,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-11-28 20:34:30,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:34:30,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2019-11-28 20:34:30,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:34:30,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 20:34:30,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2019-11-28 20:34:30,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:34:30,989 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 20:34:31,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2019-11-28 20:34:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-28 20:34:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:34:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-11-28 20:34:31,012 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 20:34:31,012 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 20:34:31,012 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:34:31,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2019-11-28 20:34:31,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:34:31,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:31,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:31,014 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:34:31,014 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:31,014 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 32#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 33#L552-4 [2019-11-28 20:34:31,015 INFO L796 eck$LassoCheckResult]: Loop: 33#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 34#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 39#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 36#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 37#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 33#L552-4 [2019-11-28 20:34:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 20:34:31,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:31,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675920303] [2019-11-28 20:34:31,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:31,069 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:31,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:31,071 INFO L82 PathProgramCache]: Analyzing trace with hash 34512977, now seen corresponding path program 1 times [2019-11-28 20:34:31,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:31,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700406721] [2019-11-28 20:34:31,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:31,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700406721] [2019-11-28 20:34:31,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:34:31,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:34:31,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915481058] [2019-11-28 20:34:31,137 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:34:31,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:31,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:34:31,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:34:31,138 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-11-28 20:34:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:34:31,184 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-11-28 20:34:31,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:34:31,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-11-28 20:34:31,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:34:31,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-11-28 20:34:31,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:34:31,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:34:31,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-28 20:34:31,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:34:31,188 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 20:34:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-28 20:34:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-28 20:34:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 20:34:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-11-28 20:34:31,190 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 20:34:31,190 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 20:34:31,190 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:34:31,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2019-11-28 20:34:31,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:34:31,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:31,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:31,192 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:34:31,192 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-28 20:34:31,193 INFO L794 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 59#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 60#L552-4 [2019-11-28 20:34:31,193 INFO L796 eck$LassoCheckResult]: Loop: 60#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 61#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 65#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 63#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 64#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 66#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 68#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 67#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 60#L552-4 [2019-11-28 20:34:31,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:31,193 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-28 20:34:31,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:31,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706186415] [2019-11-28 20:34:31,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:31,228 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:31,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:31,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1680656940, now seen corresponding path program 1 times [2019-11-28 20:34:31,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:31,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076403327] [2019-11-28 20:34:31,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:31,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076403327] [2019-11-28 20:34:31,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239061642] [2019-11-28 20:34:31,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:34:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:31,516 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:34:31,519 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:31,589 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:34:31,594 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:31,601 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:31,601 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:34:31,601 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-28 20:34:31,702 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:31,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 124 [2019-11-28 20:34:31,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:31,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:31,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:31,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:31,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:31,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:31,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:31,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:31,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:31,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:31,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:31,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:31,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:31,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:31,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:31,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:31,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:31,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:31,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:31,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:31,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:31,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:31,794 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@7a50fa5c [2019-11-28 20:34:31,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:34:31,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-11-28 20:34:31,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650114867] [2019-11-28 20:34:31,795 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:34:31,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:31,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:34:31,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:34:31,797 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 7 states. [2019-11-28 20:34:31,798 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@7a50fa5c at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 20:34:31,803 INFO L168 Benchmark]: Toolchain (without parser) took 2288.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -69.3 MB). Peak memory consumption was 81.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:31,804 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:31,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:31,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:31,807 INFO L168 Benchmark]: Boogie Preprocessor took 25.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:31,808 INFO L168 Benchmark]: RCFGBuilder took 374.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:31,809 INFO L168 Benchmark]: BuchiAutomizer took 1209.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.6 MB). Peak memory consumption was 77.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:31,813 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 620.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 374.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1209.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.6 MB). Peak memory consumption was 77.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@7a50fa5c de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@7a50fa5c: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...