./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab 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/locks/test_locks_6.c -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 fc492c809d432e4c3053fa8c39191c1c15ea4eea ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:06:54,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:06:54,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:06:54,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:06:54,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:06:54,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:06:54,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:06:54,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:06:54,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:06:54,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:06:54,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:06:54,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:06:54,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:06:54,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:06:54,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:06:54,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:06:54,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:06:54,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:06:54,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:06:54,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:06:54,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:06:54,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:06:54,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:06:54,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:06:54,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:06:54,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:06:54,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:06:54,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:06:54,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:06:54,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:06:54,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:06:54,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:06:54,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:06:54,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:06:54,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:06:54,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:06:54,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:06:54,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:06:54,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:06:54,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:06:54,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:06:54,247 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:06:54,268 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:06:54,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:06:54,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:06:54,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:06:54,271 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:06:54,271 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:06:54,272 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:06:54,272 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:06:54,272 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:06:54,273 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:06:54,274 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:06:54,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:06:54,274 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:06:54,274 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:06:54,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:06:54,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:06:54,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:06:54,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:06:54,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:06:54,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:06:54,276 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:06:54,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:06:54,277 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:06:54,277 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:06:54,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:06:54,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:06:54,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:06:54,278 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:06:54,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:06:54,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:06:54,279 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:06:54,280 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:06:54,281 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2019-11-28 03:06:54,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:06:54,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:06:54,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:06:54,592 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:06:54,592 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:06:54,593 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2019-11-28 03:06:54,650 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4e7dc2e1/4e5cbf744dab4fff832cd383e59b570c/FLAGbaf338c23 [2019-11-28 03:06:55,148 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:06:55,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2019-11-28 03:06:55,158 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4e7dc2e1/4e5cbf744dab4fff832cd383e59b570c/FLAGbaf338c23 [2019-11-28 03:06:55,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4e7dc2e1/4e5cbf744dab4fff832cd383e59b570c [2019-11-28 03:06:55,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:06:55,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:06:55,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:06:55,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:06:55,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:06:55,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:06:55" (1/1) ... [2019-11-28 03:06:55,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@195f55ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:55, skipping insertion in model container [2019-11-28 03:06:55,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:06:55" (1/1) ... [2019-11-28 03:06:55,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:06:55,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:06:55,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:06:55,723 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:06:55,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:06:55,756 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:06:55,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:55 WrapperNode [2019-11-28 03:06:55,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:06:55,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:06:55,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:06:55,758 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:06:55,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:55" (1/1) ... [2019-11-28 03:06:55,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:55" (1/1) ... [2019-11-28 03:06:55,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:06:55,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:06:55,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:06:55,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:06:55,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:55" (1/1) ... [2019-11-28 03:06:55,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:55" (1/1) ... [2019-11-28 03:06:55,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:55" (1/1) ... [2019-11-28 03:06:55,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:55" (1/1) ... [2019-11-28 03:06:55,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:55" (1/1) ... [2019-11-28 03:06:55,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:55" (1/1) ... [2019-11-28 03:06:55,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:55" (1/1) ... [2019-11-28 03:06:55,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:06:55,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:06:55,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:06:55,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:06:55,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:55" (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 03:06:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:06:55,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:06:56,202 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:06:56,202 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 03:06:56,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:06:56 BoogieIcfgContainer [2019-11-28 03:06:56,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:06:56,205 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:06:56,205 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:06:56,212 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:06:56,213 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:06:56,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:06:55" (1/3) ... [2019-11-28 03:06:56,215 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63b886d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:06:56, skipping insertion in model container [2019-11-28 03:06:56,216 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:06:56,216 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:55" (2/3) ... [2019-11-28 03:06:56,216 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63b886d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:06:56, skipping insertion in model container [2019-11-28 03:06:56,216 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:06:56,216 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:06:56" (3/3) ... [2019-11-28 03:06:56,218 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_6.c [2019-11-28 03:06:56,279 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:06:56,279 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:06:56,280 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:06:56,280 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:06:56,280 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:06:56,280 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:06:56,280 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:06:56,281 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:06:56,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-11-28 03:06:56,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-11-28 03:06:56,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:56,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:56,323 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:56,323 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:56,324 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:06:56,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-11-28 03:06:56,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-11-28 03:06:56,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:56,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:56,328 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:56,328 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:56,334 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 23#L97-1true [2019-11-28 03:06:56,335 INFO L796 eck$LassoCheckResult]: Loop: 23#L97-1true assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 4#L29true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 28#L46true assume 0 != main_~p1~0;main_~lk1~0 := 1; 25#L46-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 17#L50-1true assume !(0 != main_~p3~0); 8#L54-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 15#L58-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 5#L62-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 24#L66-1true assume !(0 != main_~p1~0); 19#L72-1true assume !(0 != main_~p2~0); 26#L77-1true assume !(0 != main_~p3~0); 3#L82-1true assume !(0 != main_~p4~0); 9#L87-1true assume !(0 != main_~p5~0); 16#L92-1true assume !(0 != main_~p6~0); 23#L97-1true [2019-11-28 03:06:56,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:56,340 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 03:06:56,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:56,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014733898] [2019-11-28 03:06:56,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:56,440 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:56,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:56,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1799400087, now seen corresponding path program 1 times [2019-11-28 03:06:56,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:56,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752265511] [2019-11-28 03:06:56,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:56,542 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 03:06:56,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752265511] [2019-11-28 03:06:56,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:56,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:56,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137675742] [2019-11-28 03:06:56,557 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:56,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:56,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:56,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:56,582 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2019-11-28 03:06:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:56,672 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2019-11-28 03:06:56,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:56,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 81 transitions. [2019-11-28 03:06:56,681 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2019-11-28 03:06:56,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 40 states and 62 transitions. [2019-11-28 03:06:56,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-11-28 03:06:56,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-28 03:06:56,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 62 transitions. [2019-11-28 03:06:56,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:56,704 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 62 transitions. [2019-11-28 03:06:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 62 transitions. [2019-11-28 03:06:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-28 03:06:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 03:06:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 62 transitions. [2019-11-28 03:06:56,753 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 62 transitions. [2019-11-28 03:06:56,754 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 62 transitions. [2019-11-28 03:06:56,754 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:06:56,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 62 transitions. [2019-11-28 03:06:56,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2019-11-28 03:06:56,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:56,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:56,761 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:56,761 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:56,762 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 86#L97-1 [2019-11-28 03:06:56,762 INFO L796 eck$LassoCheckResult]: Loop: 86#L97-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 98#L29 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 99#L46 assume !(0 != main_~p1~0); 108#L46-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 124#L50-1 assume !(0 != main_~p3~0); 123#L54-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 122#L58-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 121#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 120#L66-1 assume !(0 != main_~p1~0); 119#L72-1 assume !(0 != main_~p2~0); 117#L77-1 assume !(0 != main_~p3~0); 115#L82-1 assume !(0 != main_~p4~0); 113#L87-1 assume !(0 != main_~p5~0); 85#L92-1 assume !(0 != main_~p6~0); 86#L97-1 [2019-11-28 03:06:56,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:56,764 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 03:06:56,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:56,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833628347] [2019-11-28 03:06:56,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:56,804 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:56,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:56,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2057565525, now seen corresponding path program 1 times [2019-11-28 03:06:56,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:56,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413071121] [2019-11-28 03:06:56,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:56,844 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 03:06:56,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413071121] [2019-11-28 03:06:56,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:56,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:56,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302043561] [2019-11-28 03:06:56,846 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:56,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:56,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:56,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:56,847 INFO L87 Difference]: Start difference. First operand 40 states and 62 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-11-28 03:06:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:56,876 INFO L93 Difference]: Finished difference Result 77 states and 117 transitions. [2019-11-28 03:06:56,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:56,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 117 transitions. [2019-11-28 03:06:56,883 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2019-11-28 03:06:56,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 117 transitions. [2019-11-28 03:06:56,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2019-11-28 03:06:56,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2019-11-28 03:06:56,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 117 transitions. [2019-11-28 03:06:56,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:56,887 INFO L688 BuchiCegarLoop]: Abstraction has 77 states and 117 transitions. [2019-11-28 03:06:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 117 transitions. [2019-11-28 03:06:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-28 03:06:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 03:06:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2019-11-28 03:06:56,896 INFO L711 BuchiCegarLoop]: Abstraction has 77 states and 117 transitions. [2019-11-28 03:06:56,896 INFO L591 BuchiCegarLoop]: Abstraction has 77 states and 117 transitions. [2019-11-28 03:06:56,896 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:06:56,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 117 transitions. [2019-11-28 03:06:56,899 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2019-11-28 03:06:56,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:56,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:56,900 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:56,900 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:56,900 INFO L794 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 228#L97-1 [2019-11-28 03:06:56,901 INFO L796 eck$LassoCheckResult]: Loop: 228#L97-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 248#L29 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 246#L46 assume !(0 != main_~p1~0); 245#L46-2 assume !(0 != main_~p2~0); 244#L50-1 assume !(0 != main_~p3~0); 243#L54-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 242#L58-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 241#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 238#L66-1 assume !(0 != main_~p1~0); 239#L72-1 assume !(0 != main_~p2~0); 256#L77-1 assume !(0 != main_~p3~0); 254#L82-1 assume !(0 != main_~p4~0); 252#L87-1 assume !(0 != main_~p5~0); 250#L92-1 assume !(0 != main_~p6~0); 228#L97-1 [2019-11-28 03:06:56,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:56,901 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-28 03:06:56,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:56,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509474888] [2019-11-28 03:06:56,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:56,921 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:56,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:56,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1536337193, now seen corresponding path program 1 times [2019-11-28 03:06:56,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:56,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972662941] [2019-11-28 03:06:56,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:56,951 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 03:06:56,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972662941] [2019-11-28 03:06:56,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:56,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:56,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768123271] [2019-11-28 03:06:56,953 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:56,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:56,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:56,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:56,954 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. cyclomatic complexity: 44 Second operand 3 states. [2019-11-28 03:06:56,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:56,975 INFO L93 Difference]: Finished difference Result 149 states and 221 transitions. [2019-11-28 03:06:56,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:56,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 221 transitions. [2019-11-28 03:06:56,980 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2019-11-28 03:06:56,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 149 states and 221 transitions. [2019-11-28 03:06:56,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2019-11-28 03:06:56,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2019-11-28 03:06:56,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 221 transitions. [2019-11-28 03:06:56,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:56,985 INFO L688 BuchiCegarLoop]: Abstraction has 149 states and 221 transitions. [2019-11-28 03:06:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 221 transitions. [2019-11-28 03:06:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-28 03:06:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-28 03:06:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 221 transitions. [2019-11-28 03:06:57,007 INFO L711 BuchiCegarLoop]: Abstraction has 149 states and 221 transitions. [2019-11-28 03:06:57,007 INFO L591 BuchiCegarLoop]: Abstraction has 149 states and 221 transitions. [2019-11-28 03:06:57,007 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:06:57,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 221 transitions. [2019-11-28 03:06:57,010 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2019-11-28 03:06:57,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:57,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:57,017 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:57,017 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:57,018 INFO L794 eck$LassoCheckResult]: Stem: 459#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 460#L97-1 [2019-11-28 03:06:57,018 INFO L796 eck$LassoCheckResult]: Loop: 460#L97-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 493#L29 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 494#L46 assume !(0 != main_~p1~0); 506#L46-2 assume !(0 != main_~p2~0); 507#L50-1 assume !(0 != main_~p3~0); 476#L54-1 assume !(0 != main_~p4~0); 478#L58-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 544#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 541#L66-1 assume !(0 != main_~p1~0); 537#L72-1 assume !(0 != main_~p2~0); 533#L77-1 assume !(0 != main_~p3~0); 531#L82-1 assume !(0 != main_~p4~0); 525#L87-1 assume !(0 != main_~p5~0); 503#L92-1 assume !(0 != main_~p6~0); 460#L97-1 [2019-11-28 03:06:57,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,019 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-28 03:06:57,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41417445] [2019-11-28 03:06:57,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,036 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:57,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,040 INFO L82 PathProgramCache]: Analyzing trace with hash -856278823, now seen corresponding path program 1 times [2019-11-28 03:06:57,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12941852] [2019-11-28 03:06:57,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:57,087 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 03:06:57,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12941852] [2019-11-28 03:06:57,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:57,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:57,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570727933] [2019-11-28 03:06:57,090 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:57,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:57,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:57,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:57,091 INFO L87 Difference]: Start difference. First operand 149 states and 221 transitions. cyclomatic complexity: 80 Second operand 3 states. [2019-11-28 03:06:57,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:57,127 INFO L93 Difference]: Finished difference Result 289 states and 417 transitions. [2019-11-28 03:06:57,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:57,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 289 states and 417 transitions. [2019-11-28 03:06:57,133 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2019-11-28 03:06:57,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 289 states to 289 states and 417 transitions. [2019-11-28 03:06:57,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2019-11-28 03:06:57,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2019-11-28 03:06:57,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 417 transitions. [2019-11-28 03:06:57,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:57,151 INFO L688 BuchiCegarLoop]: Abstraction has 289 states and 417 transitions. [2019-11-28 03:06:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 417 transitions. [2019-11-28 03:06:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2019-11-28 03:06:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-28 03:06:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 417 transitions. [2019-11-28 03:06:57,188 INFO L711 BuchiCegarLoop]: Abstraction has 289 states and 417 transitions. [2019-11-28 03:06:57,188 INFO L591 BuchiCegarLoop]: Abstraction has 289 states and 417 transitions. [2019-11-28 03:06:57,188 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:06:57,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 289 states and 417 transitions. [2019-11-28 03:06:57,191 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2019-11-28 03:06:57,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:57,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:57,192 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:57,192 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:57,192 INFO L794 eck$LassoCheckResult]: Stem: 902#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 903#L97-1 [2019-11-28 03:06:57,193 INFO L796 eck$LassoCheckResult]: Loop: 903#L97-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 952#L29 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 947#L46 assume !(0 != main_~p1~0); 939#L46-2 assume !(0 != main_~p2~0); 934#L50-1 assume !(0 != main_~p3~0); 929#L54-1 assume !(0 != main_~p4~0); 930#L58-1 assume !(0 != main_~p5~0); 985#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 982#L66-1 assume !(0 != main_~p1~0); 980#L72-1 assume !(0 != main_~p2~0); 977#L77-1 assume !(0 != main_~p3~0); 972#L82-1 assume !(0 != main_~p4~0); 968#L87-1 assume !(0 != main_~p5~0); 963#L92-1 assume !(0 != main_~p6~0); 903#L97-1 [2019-11-28 03:06:57,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,193 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-28 03:06:57,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729392298] [2019-11-28 03:06:57,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,204 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:57,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1665625449, now seen corresponding path program 1 times [2019-11-28 03:06:57,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047969630] [2019-11-28 03:06:57,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:57,230 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 03:06:57,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047969630] [2019-11-28 03:06:57,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:57,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:06:57,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934932581] [2019-11-28 03:06:57,231 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:57,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:57,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:57,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:57,232 INFO L87 Difference]: Start difference. First operand 289 states and 417 transitions. cyclomatic complexity: 144 Second operand 3 states. [2019-11-28 03:06:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:57,259 INFO L93 Difference]: Finished difference Result 561 states and 785 transitions. [2019-11-28 03:06:57,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:57,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 785 transitions. [2019-11-28 03:06:57,265 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2019-11-28 03:06:57,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 561 states and 785 transitions. [2019-11-28 03:06:57,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 561 [2019-11-28 03:06:57,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 561 [2019-11-28 03:06:57,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 561 states and 785 transitions. [2019-11-28 03:06:57,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:57,273 INFO L688 BuchiCegarLoop]: Abstraction has 561 states and 785 transitions. [2019-11-28 03:06:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states and 785 transitions. [2019-11-28 03:06:57,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-11-28 03:06:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-11-28 03:06:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 785 transitions. [2019-11-28 03:06:57,292 INFO L711 BuchiCegarLoop]: Abstraction has 561 states and 785 transitions. [2019-11-28 03:06:57,292 INFO L591 BuchiCegarLoop]: Abstraction has 561 states and 785 transitions. [2019-11-28 03:06:57,292 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:06:57,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 561 states and 785 transitions. [2019-11-28 03:06:57,296 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2019-11-28 03:06:57,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:57,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:57,297 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:57,297 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:57,297 INFO L794 eck$LassoCheckResult]: Stem: 1759#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 1760#L97-1 [2019-11-28 03:06:57,298 INFO L796 eck$LassoCheckResult]: Loop: 1760#L97-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 1896#L29 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 1891#L46 assume !(0 != main_~p1~0); 1883#L46-2 assume !(0 != main_~p2~0); 1882#L50-1 assume !(0 != main_~p3~0); 1880#L54-1 assume !(0 != main_~p4~0); 1877#L58-1 assume !(0 != main_~p5~0); 1874#L62-1 assume !(0 != main_~p6~0); 1870#L66-1 assume !(0 != main_~p1~0); 1868#L72-1 assume !(0 != main_~p2~0); 1867#L77-1 assume !(0 != main_~p3~0); 1835#L82-1 assume !(0 != main_~p4~0); 1837#L87-1 assume !(0 != main_~p5~0); 1858#L92-1 assume !(0 != main_~p6~0); 1760#L97-1 [2019-11-28 03:06:57,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,298 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-28 03:06:57,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884788006] [2019-11-28 03:06:57,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,306 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:57,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,307 INFO L82 PathProgramCache]: Analyzing trace with hash 109381913, now seen corresponding path program 1 times [2019-11-28 03:06:57,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532836635] [2019-11-28 03:06:57,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,326 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,328 INFO L82 PathProgramCache]: Analyzing trace with hash -401152264, now seen corresponding path program 1 times [2019-11-28 03:06:57,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216539329] [2019-11-28 03:06:57,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,343 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:57,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:06:57 BoogieIcfgContainer [2019-11-28 03:06:57,521 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:06:57,522 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:06:57,522 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:06:57,522 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:06:57,523 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:06:56" (3/4) ... [2019-11-28 03:06:57,527 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 03:06:57,605 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 03:06:57,605 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:06:57,608 INFO L168 Benchmark]: Toolchain (without parser) took 2120.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -64.6 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:06:57,608 INFO L168 Benchmark]: CDTParser took 0.25 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 03:06:57,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.83 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 944.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:06:57,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:06:57,613 INFO L168 Benchmark]: Boogie Preprocessor took 21.74 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 03:06:57,619 INFO L168 Benchmark]: RCFGBuilder took 326.62 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:06:57,620 INFO L168 Benchmark]: BuchiAutomizer took 1316.67 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: 80.9 MB). Peak memory consumption was 80.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:06:57,620 INFO L168 Benchmark]: Witness Printer took 83.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:06:57,626 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.25 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 269.83 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 944.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.74 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. * RCFGBuilder took 326.62 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1316.67 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: 80.9 MB). Peak memory consumption was 80.9 MB. Max. memory is 11.5 GB. * Witness Printer took 83.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 561 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 561 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 251 SDtfs, 130 SDslu, 144 SDs, 0 SdLazy, 25 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 27]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f9f0980=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45d5254d=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2bb1fdb4=0, lk5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@323be824=1, lk6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5faabd5b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a1a9219=0, lk1=0, lk2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7cccbbf5=0, cond=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 27]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L25] int cond; Loop: [L27] COND TRUE 1 [L28] cond = __VERIFIER_nondet_int() [L29] COND FALSE !(cond == 0) [L32] lk1 = 0 [L34] lk2 = 0 [L36] lk3 = 0 [L38] lk4 = 0 [L40] lk5 = 0 [L42] lk6 = 0 [L46] COND FALSE !(p1 != 0) [L50] COND FALSE !(p2 != 0) [L54] COND FALSE !(p3 != 0) [L58] COND FALSE !(p4 != 0) [L62] COND FALSE !(p5 != 0) [L66] COND FALSE !(p6 != 0) [L72] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L82] COND FALSE !(p3 != 0) [L87] COND FALSE !(p4 != 0) [L92] COND FALSE !(p5 != 0) [L97] COND FALSE !(p6 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...