./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_8.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_8.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 f2cbbf56a13532141372a32a461d64a9d1351c0e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:06:54,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:06:54,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:06:54,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:06:54,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:06:54,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:06:54,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:06:54,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:06:54,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:06:54,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:06:54,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:06:54,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:06:54,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:06:54,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:06:54,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:06:54,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:06:54,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:06:54,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:06:54,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:06:55,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:06:55,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:06:55,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:06:55,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:06:55,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:06:55,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:06:55,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:06:55,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:06:55,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:06:55,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:06:55,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:06:55,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:06:55,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:06:55,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:06:55,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:06:55,019 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:06:55,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:06:55,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:06:55,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:06:55,023 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:06:55,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:06:55,025 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:55,048 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:06:55,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:06:55,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:06:55,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:06:55,052 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:06:55,052 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:06:55,052 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:06:55,052 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:06:55,053 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:06:55,053 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:06:55,054 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:06:55,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:06:55,054 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:06:55,055 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:06:55,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:06:55,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:06:55,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:06:55,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:06:55,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:06:55,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:06:55,056 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:06:55,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:06:55,056 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:06:55,057 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:06:55,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:06:55,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:06:55,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:06:55,057 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:06:55,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:06:55,058 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:06:55,058 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:06:55,060 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:06:55,060 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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2019-11-28 03:06:55,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:06:55,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:06:55,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:06:55,375 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:06:55,376 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:06:55,377 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2019-11-28 03:06:55,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc800745/ab7993bcc5ec46af9a05442b048b8065/FLAG8b22257de [2019-11-28 03:06:55,875 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:06:55,876 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2019-11-28 03:06:55,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc800745/ab7993bcc5ec46af9a05442b048b8065/FLAG8b22257de [2019-11-28 03:06:56,262 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc800745/ab7993bcc5ec46af9a05442b048b8065 [2019-11-28 03:06:56,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:06:56,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:06:56,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:06:56,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:06:56,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:06:56,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:06:56" (1/1) ... [2019-11-28 03:06:56,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bceba86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:56, skipping insertion in model container [2019-11-28 03:06:56,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:06:56" (1/1) ... [2019-11-28 03:06:56,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:06:56,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:06:56,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:06:56,558 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:06:56,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:06:56,675 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:06:56,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:56 WrapperNode [2019-11-28 03:06:56,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:06:56,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:06:56,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:06:56,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:06:56,689 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:56" (1/1) ... [2019-11-28 03:06:56,695 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:56" (1/1) ... [2019-11-28 03:06:56,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:06:56,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:06:56,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:06:56,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:06:56,727 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:56" (1/1) ... [2019-11-28 03:06:56,727 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:56" (1/1) ... [2019-11-28 03:06:56,728 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:56" (1/1) ... [2019-11-28 03:06:56,728 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:56" (1/1) ... [2019-11-28 03:06:56,731 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:56" (1/1) ... [2019-11-28 03:06:56,740 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:56" (1/1) ... [2019-11-28 03:06:56,744 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:56" (1/1) ... [2019-11-28 03:06:56,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:06:56,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:06:56,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:06:56,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:06:56,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:56" (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:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:06:56,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:06:57,101 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:06:57,102 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 03:06:57,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:06:57 BoogieIcfgContainer [2019-11-28 03:06:57,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:06:57,104 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:06:57,104 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:06:57,107 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:06:57,108 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:06:57,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:06:56" (1/3) ... [2019-11-28 03:06:57,110 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78afd0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:06:57, skipping insertion in model container [2019-11-28 03:06:57,110 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:06:57,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:56" (2/3) ... [2019-11-28 03:06:57,111 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78afd0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:06:57, skipping insertion in model container [2019-11-28 03:06:57,111 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:06:57,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:06:57" (3/3) ... [2019-11-28 03:06:57,112 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2019-11-28 03:06:57,160 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:06:57,160 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:06:57,161 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:06:57,161 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:06:57,161 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:06:57,161 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:06:57,162 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:06:57,162 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:06:57,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2019-11-28 03:06:57,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2019-11-28 03:06:57,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:57,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:57,213 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:57,213 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:57,213 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:06:57,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2019-11-28 03:06:57,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2019-11-28 03:06:57,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:57,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:57,217 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:57,217 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:57,223 INFO L794 eck$LassoCheckResult]: Stem: 29#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 23#L125-1true [2019-11-28 03:06:57,224 INFO L796 eck$LassoCheckResult]: Loop: 23#L125-1true assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 31#L35true 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 17#L56true assume 0 != main_~p1~0;main_~lk1~0 := 1; 14#L56-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 5#L60-1true assume !(0 != main_~p3~0); 27#L64-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 32#L68-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 24#L72-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 13#L76-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 3#L80-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 9#L84-1true assume !(0 != main_~p1~0); 33#L90-1true assume !(0 != main_~p2~0); 10#L95-1true assume !(0 != main_~p3~0); 20#L100-1true assume !(0 != main_~p4~0); 25#L105-1true assume !(0 != main_~p5~0); 30#L110-1true assume !(0 != main_~p6~0); 7#L115-1true assume !(0 != main_~p7~0); 16#L120-1true assume !(0 != main_~p8~0); 23#L125-1true [2019-11-28 03:06:57,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,230 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 03:06:57,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712489680] [2019-11-28 03:06:57,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,307 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,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1556343304, 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 [229595262] [2019-11-28 03:06:57,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:57,412 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,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229595262] [2019-11-28 03:06:57,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:57,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:57,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056622658] [2019-11-28 03:06:57,419 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:57,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:57,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:57,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:57,437 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-11-28 03:06:57,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:57,475 INFO L93 Difference]: Finished difference Result 62 states and 105 transitions. [2019-11-28 03:06:57,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:57,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 105 transitions. [2019-11-28 03:06:57,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-11-28 03:06:57,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 52 states and 82 transitions. [2019-11-28 03:06:57,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-11-28 03:06:57,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-11-28 03:06:57,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 82 transitions. [2019-11-28 03:06:57,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:57,491 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 82 transitions. [2019-11-28 03:06:57,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 82 transitions. [2019-11-28 03:06:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-28 03:06:57,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 03:06:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 82 transitions. [2019-11-28 03:06:57,524 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 82 transitions. [2019-11-28 03:06:57,524 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 82 transitions. [2019-11-28 03:06:57,524 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:06:57,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 82 transitions. [2019-11-28 03:06:57,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-11-28 03:06:57,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:57,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:57,529 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:57,529 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:57,529 INFO L794 eck$LassoCheckResult]: Stem: 131#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 118#L125-1 [2019-11-28 03:06:57,530 INFO L796 eck$LassoCheckResult]: Loop: 118#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 126#L35 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 136#L56 assume !(0 != main_~p1~0); 137#L56-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 154#L60-1 assume !(0 != main_~p3~0); 153#L64-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 152#L68-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 151#L72-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 150#L76-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 148#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 134#L84-1 assume !(0 != main_~p1~0); 135#L90-1 assume !(0 != main_~p2~0); 147#L95-1 assume !(0 != main_~p3~0); 145#L100-1 assume !(0 != main_~p4~0); 128#L105-1 assume !(0 != main_~p5~0); 106#L110-1 assume !(0 != main_~p6~0); 141#L115-1 assume !(0 != main_~p7~0); 122#L120-1 assume !(0 != main_~p8~0); 118#L125-1 [2019-11-28 03:06:57,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,530 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 03:06:57,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838893731] [2019-11-28 03:06:57,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,554 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:57,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,557 INFO L82 PathProgramCache]: Analyzing trace with hash 535274950, now seen corresponding path program 1 times [2019-11-28 03:06:57,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106593312] [2019-11-28 03:06:57,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:57,618 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,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106593312] [2019-11-28 03:06:57,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:57,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:57,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917637241] [2019-11-28 03:06:57,619 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:57,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:57,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:57,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:57,620 INFO L87 Difference]: Start difference. First operand 52 states and 82 transitions. cyclomatic complexity: 32 Second operand 3 states. [2019-11-28 03:06:57,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:57,663 INFO L93 Difference]: Finished difference Result 101 states and 157 transitions. [2019-11-28 03:06:57,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:57,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 157 transitions. [2019-11-28 03:06:57,672 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2019-11-28 03:06:57,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 157 transitions. [2019-11-28 03:06:57,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2019-11-28 03:06:57,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2019-11-28 03:06:57,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 157 transitions. [2019-11-28 03:06:57,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:57,680 INFO L688 BuchiCegarLoop]: Abstraction has 101 states and 157 transitions. [2019-11-28 03:06:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 157 transitions. [2019-11-28 03:06:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-11-28 03:06:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 03:06:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 157 transitions. [2019-11-28 03:06:57,706 INFO L711 BuchiCegarLoop]: Abstraction has 101 states and 157 transitions. [2019-11-28 03:06:57,706 INFO L591 BuchiCegarLoop]: Abstraction has 101 states and 157 transitions. [2019-11-28 03:06:57,706 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:06:57,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 157 transitions. [2019-11-28 03:06:57,709 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2019-11-28 03:06:57,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:57,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:57,712 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:57,713 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:57,713 INFO L794 eck$LassoCheckResult]: Stem: 292#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 293#L125-1 [2019-11-28 03:06:57,713 INFO L796 eck$LassoCheckResult]: Loop: 293#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 335#L35 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 334#L56 assume !(0 != main_~p1~0); 333#L56-2 assume !(0 != main_~p2~0); 332#L60-1 assume !(0 != main_~p3~0); 323#L64-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 324#L68-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 313#L72-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 314#L76-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 307#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 308#L84-1 assume !(0 != main_~p1~0); 331#L90-1 assume !(0 != main_~p2~0); 327#L95-1 assume !(0 != main_~p3~0); 326#L100-1 assume !(0 != main_~p4~0); 317#L105-1 assume !(0 != main_~p5~0); 316#L110-1 assume !(0 != main_~p6~0); 339#L115-1 assume !(0 != main_~p7~0); 337#L120-1 assume !(0 != main_~p8~0); 293#L125-1 [2019-11-28 03:06:57,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,713 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-28 03:06:57,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770733717] [2019-11-28 03:06:57,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,735 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:57,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,735 INFO L82 PathProgramCache]: Analyzing trace with hash -744588728, now seen corresponding path program 1 times [2019-11-28 03:06:57,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627823046] [2019-11-28 03:06:57,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:57,760 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,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627823046] [2019-11-28 03:06:57,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:57,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:57,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857005691] [2019-11-28 03:06:57,762 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:57,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:57,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:57,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:57,763 INFO L87 Difference]: Start difference. First operand 101 states and 157 transitions. cyclomatic complexity: 60 Second operand 3 states. [2019-11-28 03:06:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:57,793 INFO L93 Difference]: Finished difference Result 197 states and 301 transitions. [2019-11-28 03:06:57,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:57,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 301 transitions. [2019-11-28 03:06:57,797 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2019-11-28 03:06:57,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 197 states and 301 transitions. [2019-11-28 03:06:57,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2019-11-28 03:06:57,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2019-11-28 03:06:57,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 301 transitions. [2019-11-28 03:06:57,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:57,807 INFO L688 BuchiCegarLoop]: Abstraction has 197 states and 301 transitions. [2019-11-28 03:06:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 301 transitions. [2019-11-28 03:06:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-11-28 03:06:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-28 03:06:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 301 transitions. [2019-11-28 03:06:57,823 INFO L711 BuchiCegarLoop]: Abstraction has 197 states and 301 transitions. [2019-11-28 03:06:57,823 INFO L591 BuchiCegarLoop]: Abstraction has 197 states and 301 transitions. [2019-11-28 03:06:57,823 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:06:57,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 197 states and 301 transitions. [2019-11-28 03:06:57,826 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2019-11-28 03:06:57,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:57,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:57,827 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:57,827 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:57,827 INFO L794 eck$LassoCheckResult]: Stem: 599#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 600#L125-1 [2019-11-28 03:06:57,827 INFO L796 eck$LassoCheckResult]: Loop: 600#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 628#L35 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 625#L56 assume !(0 != main_~p1~0); 626#L56-2 assume !(0 != main_~p2~0); 673#L60-1 assume !(0 != main_~p3~0); 670#L64-1 assume !(0 != main_~p4~0); 668#L68-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 666#L72-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 664#L76-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 662#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 660#L84-1 assume !(0 != main_~p1~0); 657#L90-1 assume !(0 != main_~p2~0); 654#L95-1 assume !(0 != main_~p3~0); 649#L100-1 assume !(0 != main_~p4~0); 646#L105-1 assume !(0 != main_~p5~0); 641#L110-1 assume !(0 != main_~p6~0); 638#L115-1 assume !(0 != main_~p7~0); 632#L120-1 assume !(0 != main_~p8~0); 600#L125-1 [2019-11-28 03:06:57,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,828 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-28 03:06:57,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713236764] [2019-11-28 03:06:57,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,837 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:57,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1331394742, now seen corresponding path program 1 times [2019-11-28 03:06:57,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44426179] [2019-11-28 03:06:57,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:57,894 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,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44426179] [2019-11-28 03:06:57,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:57,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:57,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225459505] [2019-11-28 03:06:57,897 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:57,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:57,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:57,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:57,898 INFO L87 Difference]: Start difference. First operand 197 states and 301 transitions. cyclomatic complexity: 112 Second operand 3 states. [2019-11-28 03:06:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:57,919 INFO L93 Difference]: Finished difference Result 385 states and 577 transitions. [2019-11-28 03:06:57,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:57,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 385 states and 577 transitions. [2019-11-28 03:06:57,923 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2019-11-28 03:06:57,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 385 states to 385 states and 577 transitions. [2019-11-28 03:06:57,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 385 [2019-11-28 03:06:57,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 385 [2019-11-28 03:06:57,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 385 states and 577 transitions. [2019-11-28 03:06:57,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:57,930 INFO L688 BuchiCegarLoop]: Abstraction has 385 states and 577 transitions. [2019-11-28 03:06:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states and 577 transitions. [2019-11-28 03:06:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2019-11-28 03:06:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-11-28 03:06:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 577 transitions. [2019-11-28 03:06:57,948 INFO L711 BuchiCegarLoop]: Abstraction has 385 states and 577 transitions. [2019-11-28 03:06:57,948 INFO L591 BuchiCegarLoop]: Abstraction has 385 states and 577 transitions. [2019-11-28 03:06:57,948 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:06:57,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 385 states and 577 transitions. [2019-11-28 03:06:57,951 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2019-11-28 03:06:57,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:57,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:57,952 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:57,952 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:57,952 INFO L794 eck$LassoCheckResult]: Stem: 1186#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 1187#L125-1 [2019-11-28 03:06:57,953 INFO L796 eck$LassoCheckResult]: Loop: 1187#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 1232#L35 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 1230#L56 assume !(0 != main_~p1~0); 1226#L56-2 assume !(0 != main_~p2~0); 1224#L60-1 assume !(0 != main_~p3~0); 1220#L64-1 assume !(0 != main_~p4~0); 1216#L68-1 assume !(0 != main_~p5~0); 1214#L72-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1212#L76-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1210#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1207#L84-1 assume !(0 != main_~p1~0); 1208#L90-1 assume !(0 != main_~p2~0); 1256#L95-1 assume !(0 != main_~p3~0); 1251#L100-1 assume !(0 != main_~p4~0); 1247#L105-1 assume !(0 != main_~p5~0); 1243#L110-1 assume !(0 != main_~p6~0); 1240#L115-1 assume !(0 != main_~p7~0); 1236#L120-1 assume !(0 != main_~p8~0); 1187#L125-1 [2019-11-28 03:06:57,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,953 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-28 03:06:57,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447241253] [2019-11-28 03:06:57,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:57,961 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:57,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:57,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1073229304, now seen corresponding path program 1 times [2019-11-28 03:06:57,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:57,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171413432] [2019-11-28 03:06:57,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:57,983 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,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171413432] [2019-11-28 03:06:57,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:57,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:57,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776974731] [2019-11-28 03:06:57,985 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:57,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:57,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:57,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:57,986 INFO L87 Difference]: Start difference. First operand 385 states and 577 transitions. cyclomatic complexity: 208 Second operand 3 states. [2019-11-28 03:06:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:58,024 INFO L93 Difference]: Finished difference Result 753 states and 1105 transitions. [2019-11-28 03:06:58,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:58,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 753 states and 1105 transitions. [2019-11-28 03:06:58,036 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2019-11-28 03:06:58,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 753 states to 753 states and 1105 transitions. [2019-11-28 03:06:58,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 753 [2019-11-28 03:06:58,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 753 [2019-11-28 03:06:58,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 753 states and 1105 transitions. [2019-11-28 03:06:58,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:58,046 INFO L688 BuchiCegarLoop]: Abstraction has 753 states and 1105 transitions. [2019-11-28 03:06:58,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states and 1105 transitions. [2019-11-28 03:06:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 753. [2019-11-28 03:06:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-11-28 03:06:58,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1105 transitions. [2019-11-28 03:06:58,082 INFO L711 BuchiCegarLoop]: Abstraction has 753 states and 1105 transitions. [2019-11-28 03:06:58,083 INFO L591 BuchiCegarLoop]: Abstraction has 753 states and 1105 transitions. [2019-11-28 03:06:58,083 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:06:58,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 753 states and 1105 transitions. [2019-11-28 03:06:58,088 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2019-11-28 03:06:58,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:58,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:58,089 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:58,090 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:58,090 INFO L794 eck$LassoCheckResult]: Stem: 2335#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 2336#L125-1 [2019-11-28 03:06:58,090 INFO L796 eck$LassoCheckResult]: Loop: 2336#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 2400#L35 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 2398#L56 assume !(0 != main_~p1~0); 2394#L56-2 assume !(0 != main_~p2~0); 2392#L60-1 assume !(0 != main_~p3~0); 2388#L64-1 assume !(0 != main_~p4~0); 2384#L68-1 assume !(0 != main_~p5~0); 2380#L72-1 assume !(0 != main_~p6~0); 2378#L76-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2376#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2373#L84-1 assume !(0 != main_~p1~0); 2374#L90-1 assume !(0 != main_~p2~0); 2424#L95-1 assume !(0 != main_~p3~0); 2419#L100-1 assume !(0 != main_~p4~0); 2415#L105-1 assume !(0 != main_~p5~0); 2411#L110-1 assume !(0 != main_~p6~0); 2408#L115-1 assume !(0 != main_~p7~0); 2404#L120-1 assume !(0 != main_~p8~0); 2336#L125-1 [2019-11-28 03:06:58,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:58,091 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-28 03:06:58,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:58,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933245767] [2019-11-28 03:06:58,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:58,100 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:58,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:58,101 INFO L82 PathProgramCache]: Analyzing trace with hash -372164726, now seen corresponding path program 1 times [2019-11-28 03:06:58,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:58,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487575934] [2019-11-28 03:06:58,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:58,124 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:58,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487575934] [2019-11-28 03:06:58,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:58,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:58,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459311086] [2019-11-28 03:06:58,127 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:58,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:58,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:58,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:58,128 INFO L87 Difference]: Start difference. First operand 753 states and 1105 transitions. cyclomatic complexity: 384 Second operand 3 states. [2019-11-28 03:06:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:58,163 INFO L93 Difference]: Finished difference Result 1473 states and 2113 transitions. [2019-11-28 03:06:58,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:58,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1473 states and 2113 transitions. [2019-11-28 03:06:58,185 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2019-11-28 03:06:58,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1473 states to 1473 states and 2113 transitions. [2019-11-28 03:06:58,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1473 [2019-11-28 03:06:58,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1473 [2019-11-28 03:06:58,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1473 states and 2113 transitions. [2019-11-28 03:06:58,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:58,203 INFO L688 BuchiCegarLoop]: Abstraction has 1473 states and 2113 transitions. [2019-11-28 03:06:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states and 2113 transitions. [2019-11-28 03:06:58,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1473. [2019-11-28 03:06:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2019-11-28 03:06:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2113 transitions. [2019-11-28 03:06:58,239 INFO L711 BuchiCegarLoop]: Abstraction has 1473 states and 2113 transitions. [2019-11-28 03:06:58,239 INFO L591 BuchiCegarLoop]: Abstraction has 1473 states and 2113 transitions. [2019-11-28 03:06:58,239 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:06:58,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1473 states and 2113 transitions. [2019-11-28 03:06:58,248 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2019-11-28 03:06:58,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:58,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:58,249 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:58,249 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:58,250 INFO L794 eck$LassoCheckResult]: Stem: 4563#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 4564#L125-1 [2019-11-28 03:06:58,250 INFO L796 eck$LassoCheckResult]: Loop: 4564#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 4910#L35 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 4907#L56 assume !(0 != main_~p1~0); 4903#L56-2 assume !(0 != main_~p2~0); 4900#L60-1 assume !(0 != main_~p3~0); 4897#L64-1 assume !(0 != main_~p4~0); 4898#L68-1 assume !(0 != main_~p5~0); 4889#L72-1 assume !(0 != main_~p6~0); 4891#L76-1 assume !(0 != main_~p7~0); 4929#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4927#L84-1 assume !(0 != main_~p1~0); 4926#L90-1 assume !(0 != main_~p2~0); 4925#L95-1 assume !(0 != main_~p3~0); 4923#L100-1 assume !(0 != main_~p4~0); 4922#L105-1 assume !(0 != main_~p5~0); 4920#L110-1 assume !(0 != main_~p6~0); 4917#L115-1 assume !(0 != main_~p7~0); 4915#L120-1 assume !(0 != main_~p8~0); 4564#L125-1 [2019-11-28 03:06:58,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:58,251 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-28 03:06:58,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:58,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418121397] [2019-11-28 03:06:58,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:58,265 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:58,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash -765191736, now seen corresponding path program 1 times [2019-11-28 03:06:58,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:58,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108281398] [2019-11-28 03:06:58,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:58,302 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:58,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108281398] [2019-11-28 03:06:58,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:58,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:06:58,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451859640] [2019-11-28 03:06:58,304 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:58,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:58,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:58,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:58,305 INFO L87 Difference]: Start difference. First operand 1473 states and 2113 transitions. cyclomatic complexity: 704 Second operand 3 states. [2019-11-28 03:06:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:58,339 INFO L93 Difference]: Finished difference Result 2881 states and 4033 transitions. [2019-11-28 03:06:58,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:58,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2881 states and 4033 transitions. [2019-11-28 03:06:58,365 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2019-11-28 03:06:58,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2881 states to 2881 states and 4033 transitions. [2019-11-28 03:06:58,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2881 [2019-11-28 03:06:58,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2881 [2019-11-28 03:06:58,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2881 states and 4033 transitions. [2019-11-28 03:06:58,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:58,393 INFO L688 BuchiCegarLoop]: Abstraction has 2881 states and 4033 transitions. [2019-11-28 03:06:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states and 4033 transitions. [2019-11-28 03:06:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2881. [2019-11-28 03:06:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2881 states. [2019-11-28 03:06:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 4033 transitions. [2019-11-28 03:06:58,457 INFO L711 BuchiCegarLoop]: Abstraction has 2881 states and 4033 transitions. [2019-11-28 03:06:58,457 INFO L591 BuchiCegarLoop]: Abstraction has 2881 states and 4033 transitions. [2019-11-28 03:06:58,457 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:06:58,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2881 states and 4033 transitions. [2019-11-28 03:06:58,473 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2019-11-28 03:06:58,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:58,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:58,475 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:58,475 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:58,475 INFO L794 eck$LassoCheckResult]: Stem: 8923#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 8924#L125-1 [2019-11-28 03:06:58,478 INFO L796 eck$LassoCheckResult]: Loop: 8924#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 9159#L35 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 9153#L56 assume !(0 != main_~p1~0); 9149#L56-2 assume !(0 != main_~p2~0); 9148#L60-1 assume !(0 != main_~p3~0); 9145#L64-1 assume !(0 != main_~p4~0); 9144#L68-1 assume !(0 != main_~p5~0); 8965#L72-1 assume !(0 != main_~p6~0); 8966#L76-1 assume !(0 != main_~p7~0); 9113#L80-1 assume !(0 != main_~p8~0); 9109#L84-1 assume !(0 != main_~p1~0); 9084#L90-1 assume !(0 != main_~p2~0); 9082#L95-1 assume !(0 != main_~p3~0); 9077#L100-1 assume !(0 != main_~p4~0); 9074#L105-1 assume !(0 != main_~p5~0); 9070#L110-1 assume !(0 != main_~p6~0); 9034#L115-1 assume !(0 != main_~p7~0); 9036#L120-1 assume !(0 != main_~p8~0); 8924#L125-1 [2019-11-28 03:06:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:58,479 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-28 03:06:58,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:58,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19405487] [2019-11-28 03:06:58,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:58,493 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:58,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:58,494 INFO L82 PathProgramCache]: Analyzing trace with hash -85133366, now seen corresponding path program 1 times [2019-11-28 03:06:58,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:58,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427564154] [2019-11-28 03:06:58,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:58,530 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:58,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:58,532 INFO L82 PathProgramCache]: Analyzing trace with hash -493957591, now seen corresponding path program 1 times [2019-11-28 03:06:58,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:58,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892416423] [2019-11-28 03:06:58,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:58,548 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:58,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:06:58 BoogieIcfgContainer [2019-11-28 03:06:58,768 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:06:58,769 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:06:58,769 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:06:58,769 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:06:58,770 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:57" (3/4) ... [2019-11-28 03:06:58,773 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 03:06:58,826 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 03:06:58,826 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:06:58,829 INFO L168 Benchmark]: Toolchain (without parser) took 2561.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 963.1 MB in the beginning and 958.1 MB in the end (delta: 4.9 MB). Peak memory consumption was 149.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:06:58,829 INFO L168 Benchmark]: CDTParser took 0.50 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:58,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 963.1 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:06:58,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.47 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:58,831 INFO L168 Benchmark]: Boogie Preprocessor took 28.16 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:58,831 INFO L168 Benchmark]: RCFGBuilder took 356.94 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: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:06:58,832 INFO L168 Benchmark]: BuchiAutomizer took 1664.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 958.1 MB in the end (delta: 156.6 MB). Peak memory consumption was 156.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:06:58,833 INFO L168 Benchmark]: Witness Printer took 57.22 ms. Allocated memory is still 1.2 GB. Free memory is still 958.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:06:58,836 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.50 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 410.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 963.1 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.47 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 28.16 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 356.94 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: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1664.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 958.1 MB in the end (delta: 156.6 MB). Peak memory consumption was 156.6 MB. Max. memory is 11.5 GB. * Witness Printer took 57.22 ms. Allocated memory is still 1.2 GB. Free memory is still 958.1 MB. 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2881 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 2881 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 452 SDtfs, 236 SDslu, 270 SDs, 0 SdLazy, 35 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI7 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: 33]: 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, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@495ba35e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72a96454=1, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@215b2788=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a703726=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@145e6231=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31c4b589=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16d1ac21=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e541a9b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c2922d9=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 33]: 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; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L31] int cond; Loop: [L33] COND TRUE 1 [L34] cond = __VERIFIER_nondet_int() [L35] COND FALSE !(cond == 0) [L38] lk1 = 0 [L40] lk2 = 0 [L42] lk3 = 0 [L44] lk4 = 0 [L46] lk5 = 0 [L48] lk6 = 0 [L50] lk7 = 0 [L52] lk8 = 0 [L56] COND FALSE !(p1 != 0) [L60] COND FALSE !(p2 != 0) [L64] COND FALSE !(p3 != 0) [L68] COND FALSE !(p4 != 0) [L72] COND FALSE !(p5 != 0) [L76] COND FALSE !(p6 != 0) [L80] COND FALSE !(p7 != 0) [L84] COND FALSE !(p8 != 0) [L90] COND FALSE !(p1 != 0) [L95] COND FALSE !(p2 != 0) [L100] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L110] COND FALSE !(p5 != 0) [L115] COND FALSE !(p6 != 0) [L120] COND FALSE !(p7 != 0) [L125] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...