./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_10.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 0f7b0b589689413087c164ce10eb80c902ee4046 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-11-28 20:39:07,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:39:07,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:39:07,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:39:07,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:39:07,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:39:07,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:39:07,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:39:07,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:39:07,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:39:07,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:39:07,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:39:07,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:39:07,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:39:07,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:39:07,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:39:07,164 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:39:07,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:39:07,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:39:07,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:39:07,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:39:07,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:39:07,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:39:07,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:39:07,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:39:07,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:39:07,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:39:07,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:39:07,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:39:07,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:39:07,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:39:07,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:39:07,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:39:07,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:39:07,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:39:07,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:39:07,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:39:07,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:39:07,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:39:07,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:39:07,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:39:07,200 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:39:07,216 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:39:07,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:39:07,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:39:07,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:39:07,219 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:39:07,219 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:39:07,219 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:39:07,220 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:39:07,220 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:39:07,220 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:39:07,221 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:39:07,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:39:07,221 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:39:07,221 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:39:07,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:39:07,222 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:39:07,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:39:07,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:39:07,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:39:07,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:39:07,223 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:39:07,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:39:07,224 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:39:07,224 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:39:07,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:39:07,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:39:07,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:39:07,225 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:39:07,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:39:07,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:39:07,226 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:39:07,227 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:39:07,228 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:39:07,228 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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2019-11-28 20:39:07,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:39:07,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:39:07,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:39:07,568 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:39:07,568 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:39:07,569 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2019-11-28 20:39:07,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2dabcb6/52bb0c47bf454e309409d29b9ed3f5c2/FLAG43eb92b89 [2019-11-28 20:39:08,115 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:39:08,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2019-11-28 20:39:08,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2dabcb6/52bb0c47bf454e309409d29b9ed3f5c2/FLAG43eb92b89 [2019-11-28 20:39:08,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2dabcb6/52bb0c47bf454e309409d29b9ed3f5c2 [2019-11-28 20:39:08,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:39:08,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:39:08,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:39:08,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:39:08,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:39:08,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:39:08" (1/1) ... [2019-11-28 20:39:08,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550f4497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:08, skipping insertion in model container [2019-11-28 20:39:08,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:39:08" (1/1) ... [2019-11-28 20:39:08,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:39:08,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:39:08,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:39:08,749 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:39:08,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:39:08,786 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:39:08,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:08 WrapperNode [2019-11-28 20:39:08,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:39:08,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:39:08,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:39:08,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:39:08,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:08" (1/1) ... [2019-11-28 20:39:08,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:08" (1/1) ... [2019-11-28 20:39:08,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:39:08,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:39:08,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:39:08,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:39:08,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:08" (1/1) ... [2019-11-28 20:39:08,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:08" (1/1) ... [2019-11-28 20:39:08,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:08" (1/1) ... [2019-11-28 20:39:08,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:08" (1/1) ... [2019-11-28 20:39:08,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:08" (1/1) ... [2019-11-28 20:39:08,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:08" (1/1) ... [2019-11-28 20:39:08,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:08" (1/1) ... [2019-11-28 20:39:08,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:39:08,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:39:08,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:39:08,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:39:08,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:39:08,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:39:08,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:39:09,288 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:39:09,288 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 20:39:09,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:09 BoogieIcfgContainer [2019-11-28 20:39:09,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:39:09,291 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:39:09,291 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:39:09,295 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:39:09,297 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:39:09,297 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:39:08" (1/3) ... [2019-11-28 20:39:09,298 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ed558e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:39:09, skipping insertion in model container [2019-11-28 20:39:09,299 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:39:09,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:08" (2/3) ... [2019-11-28 20:39:09,299 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ed558e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:39:09, skipping insertion in model container [2019-11-28 20:39:09,299 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:39:09,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:09" (3/3) ... [2019-11-28 20:39:09,302 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_10.c [2019-11-28 20:39:09,345 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:39:09,346 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:39:09,346 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:39:09,346 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:39:09,346 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:39:09,346 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:39:09,346 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:39:09,346 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:39:09,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states. [2019-11-28 20:39:09,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2019-11-28 20:39:09,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:09,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:09,391 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:09,391 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:09,391 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:39:09,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states. [2019-11-28 20:39:09,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2019-11-28 20:39:09,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:09,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:09,396 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:09,396 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:09,405 INFO L794 eck$LassoCheckResult]: Stem: 32#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_#t~nondet9, main_#t~nondet10, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~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;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 17#L153-1true [2019-11-28 20:39:09,406 INFO L796 eck$LassoCheckResult]: Loop: 17#L153-1true assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 26#L41true 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;main_~lk9~0 := 0;main_~lk10~0 := 0; 37#L66true assume 0 != main_~p1~0;main_~lk1~0 := 1; 33#L66-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 22#L70-1true assume !(0 != main_~p3~0); 27#L74-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 15#L78-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 6#L82-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 31#L86-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 39#L90-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 25#L94-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 11#L98-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 3#L102-1true assume !(0 != main_~p1~0); 34#L108-1true assume !(0 != main_~p2~0); 4#L113-1true assume !(0 != main_~p3~0); 9#L118-1true assume !(0 != main_~p4~0); 20#L123-1true assume !(0 != main_~p5~0); 30#L128-1true assume !(0 != main_~p6~0); 19#L133-1true assume !(0 != main_~p7~0); 28#L138-1true assume !(0 != main_~p8~0); 38#L143-1true assume !(0 != main_~p9~0); 8#L148-1true assume !(0 != main_~p10~0); 17#L153-1true [2019-11-28 20:39:09,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:09,413 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 20:39:09,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:09,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988050012] [2019-11-28 20:39:09,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:09,523 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:09,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:09,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1844487545, now seen corresponding path program 1 times [2019-11-28 20:39:09,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:09,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352225827] [2019-11-28 20:39:09,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:09,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352225827] [2019-11-28 20:39:09,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:09,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:09,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045627932] [2019-11-28 20:39:09,624 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:09,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:09,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:09,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:09,642 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-11-28 20:39:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:09,692 INFO L93 Difference]: Finished difference Result 74 states and 129 transitions. [2019-11-28 20:39:09,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:09,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 129 transitions. [2019-11-28 20:39:09,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2019-11-28 20:39:09,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 64 states and 102 transitions. [2019-11-28 20:39:09,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2019-11-28 20:39:09,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2019-11-28 20:39:09,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 102 transitions. [2019-11-28 20:39:09,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:09,710 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 102 transitions. [2019-11-28 20:39:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 102 transitions. [2019-11-28 20:39:09,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-28 20:39:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 20:39:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 102 transitions. [2019-11-28 20:39:09,751 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 102 transitions. [2019-11-28 20:39:09,751 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 102 transitions. [2019-11-28 20:39:09,751 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:39:09,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 102 transitions. [2019-11-28 20:39:09,754 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2019-11-28 20:39:09,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:09,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:09,755 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:09,755 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:09,756 INFO L794 eck$LassoCheckResult]: Stem: 154#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_#t~nondet9, main_#t~nondet10, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~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;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 155#L153-1 [2019-11-28 20:39:09,756 INFO L796 eck$LassoCheckResult]: Loop: 155#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 161#L41 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;main_~lk9~0 := 0;main_~lk10~0 := 0; 160#L66 assume !(0 != main_~p1~0); 156#L66-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 147#L70-1 assume !(0 != main_~p3~0); 148#L74-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 140#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 128#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 129#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 153#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 151#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 136#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 137#L102-1 assume !(0 != main_~p1~0); 159#L108-1 assume !(0 != main_~p2~0); 183#L113-1 assume !(0 != main_~p3~0); 181#L118-1 assume !(0 != main_~p4~0); 146#L123-1 assume !(0 != main_~p5~0); 139#L128-1 assume !(0 != main_~p6~0); 143#L133-1 assume !(0 != main_~p7~0); 145#L138-1 assume !(0 != main_~p8~0); 127#L143-1 assume !(0 != main_~p9~0); 163#L148-1 assume !(0 != main_~p10~0); 155#L153-1 [2019-11-28 20:39:09,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:09,757 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 20:39:09,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:09,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038226801] [2019-11-28 20:39:09,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:09,771 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:09,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:09,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1026839095, now seen corresponding path program 1 times [2019-11-28 20:39:09,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:09,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902768646] [2019-11-28 20:39:09,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:09,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902768646] [2019-11-28 20:39:09,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:09,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:09,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250902430] [2019-11-28 20:39:09,829 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:09,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:09,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:09,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:09,831 INFO L87 Difference]: Start difference. First operand 64 states and 102 transitions. cyclomatic complexity: 40 Second operand 3 states. [2019-11-28 20:39:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:09,894 INFO L93 Difference]: Finished difference Result 125 states and 197 transitions. [2019-11-28 20:39:09,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:09,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 197 transitions. [2019-11-28 20:39:09,903 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2019-11-28 20:39:09,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 197 transitions. [2019-11-28 20:39:09,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2019-11-28 20:39:09,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2019-11-28 20:39:09,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 197 transitions. [2019-11-28 20:39:09,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:09,914 INFO L688 BuchiCegarLoop]: Abstraction has 125 states and 197 transitions. [2019-11-28 20:39:09,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 197 transitions. [2019-11-28 20:39:09,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-11-28 20:39:09,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-28 20:39:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 197 transitions. [2019-11-28 20:39:09,936 INFO L711 BuchiCegarLoop]: Abstraction has 125 states and 197 transitions. [2019-11-28 20:39:09,936 INFO L591 BuchiCegarLoop]: Abstraction has 125 states and 197 transitions. [2019-11-28 20:39:09,936 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:39:09,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 197 transitions. [2019-11-28 20:39:09,943 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2019-11-28 20:39:09,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:09,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:09,944 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:09,944 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:09,945 INFO L794 eck$LassoCheckResult]: Stem: 351#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_#t~nondet9, main_#t~nondet10, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~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;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 352#L153-1 [2019-11-28 20:39:09,945 INFO L796 eck$LassoCheckResult]: Loop: 352#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 371#L41 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;main_~lk9~0 := 0;main_~lk10~0 := 0; 370#L66 assume !(0 != main_~p1~0); 369#L66-2 assume !(0 != main_~p2~0); 366#L70-1 assume !(0 != main_~p3~0); 365#L74-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 364#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 363#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 362#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 361#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 360#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 358#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 359#L102-1 assume !(0 != main_~p1~0); 388#L108-1 assume !(0 != main_~p2~0); 387#L113-1 assume !(0 != main_~p3~0); 385#L118-1 assume !(0 != main_~p4~0); 382#L123-1 assume !(0 != main_~p5~0); 381#L128-1 assume !(0 != main_~p6~0); 379#L133-1 assume !(0 != main_~p7~0); 377#L138-1 assume !(0 != main_~p8~0); 375#L143-1 assume !(0 != main_~p9~0); 373#L148-1 assume !(0 != main_~p10~0); 352#L153-1 [2019-11-28 20:39:09,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:09,945 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-28 20:39:09,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:09,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139928221] [2019-11-28 20:39:09,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:09,972 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:09,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:09,973 INFO L82 PathProgramCache]: Analyzing trace with hash -662104647, now seen corresponding path program 1 times [2019-11-28 20:39:09,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:09,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706867597] [2019-11-28 20:39:09,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:10,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706867597] [2019-11-28 20:39:10,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:10,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:10,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704716078] [2019-11-28 20:39:10,033 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:10,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:10,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:10,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:10,035 INFO L87 Difference]: Start difference. First operand 125 states and 197 transitions. cyclomatic complexity: 76 Second operand 3 states. [2019-11-28 20:39:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:10,079 INFO L93 Difference]: Finished difference Result 245 states and 381 transitions. [2019-11-28 20:39:10,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:10,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 381 transitions. [2019-11-28 20:39:10,084 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2019-11-28 20:39:10,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 245 states and 381 transitions. [2019-11-28 20:39:10,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2019-11-28 20:39:10,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2019-11-28 20:39:10,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 381 transitions. [2019-11-28 20:39:10,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:10,100 INFO L688 BuchiCegarLoop]: Abstraction has 245 states and 381 transitions. [2019-11-28 20:39:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 381 transitions. [2019-11-28 20:39:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-11-28 20:39:10,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-28 20:39:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 381 transitions. [2019-11-28 20:39:10,130 INFO L711 BuchiCegarLoop]: Abstraction has 245 states and 381 transitions. [2019-11-28 20:39:10,130 INFO L591 BuchiCegarLoop]: Abstraction has 245 states and 381 transitions. [2019-11-28 20:39:10,130 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:39:10,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 381 transitions. [2019-11-28 20:39:10,134 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2019-11-28 20:39:10,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:10,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:10,135 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:10,135 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:10,139 INFO L794 eck$LassoCheckResult]: Stem: 727#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_#t~nondet9, main_#t~nondet10, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~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;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 728#L153-1 [2019-11-28 20:39:10,139 INFO L796 eck$LassoCheckResult]: Loop: 728#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 765#L41 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;main_~lk9~0 := 0;main_~lk10~0 := 0; 760#L66 assume !(0 != main_~p1~0); 753#L66-2 assume !(0 != main_~p2~0); 754#L70-1 assume !(0 != main_~p3~0); 854#L74-1 assume !(0 != main_~p4~0); 853#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 851#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 849#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 847#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 845#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 843#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 838#L102-1 assume !(0 != main_~p1~0); 834#L108-1 assume !(0 != main_~p2~0); 831#L113-1 assume !(0 != main_~p3~0); 822#L118-1 assume !(0 != main_~p4~0); 819#L123-1 assume !(0 != main_~p5~0); 816#L128-1 assume !(0 != main_~p6~0); 812#L133-1 assume !(0 != main_~p7~0); 808#L138-1 assume !(0 != main_~p8~0); 804#L143-1 assume !(0 != main_~p9~0); 800#L148-1 assume !(0 != main_~p10~0); 728#L153-1 [2019-11-28 20:39:10,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:10,139 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-28 20:39:10,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:10,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186443644] [2019-11-28 20:39:10,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:10,155 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:10,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2044514747, now seen corresponding path program 1 times [2019-11-28 20:39:10,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:10,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291969771] [2019-11-28 20:39:10,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:10,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291969771] [2019-11-28 20:39:10,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:10,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:10,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892763868] [2019-11-28 20:39:10,200 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:10,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:10,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:10,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:10,201 INFO L87 Difference]: Start difference. First operand 245 states and 381 transitions. cyclomatic complexity: 144 Second operand 3 states. [2019-11-28 20:39:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:10,228 INFO L93 Difference]: Finished difference Result 481 states and 737 transitions. [2019-11-28 20:39:10,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:10,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 481 states and 737 transitions. [2019-11-28 20:39:10,235 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2019-11-28 20:39:10,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 481 states to 481 states and 737 transitions. [2019-11-28 20:39:10,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 481 [2019-11-28 20:39:10,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 481 [2019-11-28 20:39:10,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 481 states and 737 transitions. [2019-11-28 20:39:10,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:10,244 INFO L688 BuchiCegarLoop]: Abstraction has 481 states and 737 transitions. [2019-11-28 20:39:10,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states and 737 transitions. [2019-11-28 20:39:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2019-11-28 20:39:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-11-28 20:39:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 737 transitions. [2019-11-28 20:39:10,262 INFO L711 BuchiCegarLoop]: Abstraction has 481 states and 737 transitions. [2019-11-28 20:39:10,262 INFO L591 BuchiCegarLoop]: Abstraction has 481 states and 737 transitions. [2019-11-28 20:39:10,262 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:39:10,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 481 states and 737 transitions. [2019-11-28 20:39:10,266 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2019-11-28 20:39:10,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:10,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:10,267 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:10,267 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:10,267 INFO L794 eck$LassoCheckResult]: Stem: 1461#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_#t~nondet9, main_#t~nondet10, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~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;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 1462#L153-1 [2019-11-28 20:39:10,267 INFO L796 eck$LassoCheckResult]: Loop: 1462#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 1635#L41 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;main_~lk9~0 := 0;main_~lk10~0 := 0; 1631#L66 assume !(0 != main_~p1~0); 1577#L66-2 assume !(0 != main_~p2~0); 1491#L70-1 assume !(0 != main_~p3~0); 1492#L74-1 assume !(0 != main_~p4~0); 1566#L78-1 assume !(0 != main_~p5~0); 1567#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1560#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1561#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1554#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1555#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1546#L102-1 assume !(0 != main_~p1~0); 1547#L108-1 assume !(0 != main_~p2~0); 1537#L113-1 assume !(0 != main_~p3~0); 1536#L118-1 assume !(0 != main_~p4~0); 1609#L123-1 assume !(0 != main_~p5~0); 1683#L128-1 assume !(0 != main_~p6~0); 1680#L133-1 assume !(0 != main_~p7~0); 1677#L138-1 assume !(0 != main_~p8~0); 1673#L143-1 assume !(0 != main_~p9~0); 1647#L148-1 assume !(0 != main_~p10~0); 1462#L153-1 [2019-11-28 20:39:10,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:10,268 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-28 20:39:10,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:10,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973099477] [2019-11-28 20:39:10,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:10,277 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:10,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:10,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1023446393, now seen corresponding path program 1 times [2019-11-28 20:39:10,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:10,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633707545] [2019-11-28 20:39:10,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:10,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633707545] [2019-11-28 20:39:10,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:10,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:10,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848069404] [2019-11-28 20:39:10,322 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:10,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:10,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:10,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:10,324 INFO L87 Difference]: Start difference. First operand 481 states and 737 transitions. cyclomatic complexity: 272 Second operand 3 states. [2019-11-28 20:39:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:10,344 INFO L93 Difference]: Finished difference Result 945 states and 1425 transitions. [2019-11-28 20:39:10,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:10,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 945 states and 1425 transitions. [2019-11-28 20:39:10,352 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2019-11-28 20:39:10,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 945 states to 945 states and 1425 transitions. [2019-11-28 20:39:10,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 945 [2019-11-28 20:39:10,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 945 [2019-11-28 20:39:10,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 945 states and 1425 transitions. [2019-11-28 20:39:10,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:10,364 INFO L688 BuchiCegarLoop]: Abstraction has 945 states and 1425 transitions. [2019-11-28 20:39:10,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states and 1425 transitions. [2019-11-28 20:39:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2019-11-28 20:39:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-11-28 20:39:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1425 transitions. [2019-11-28 20:39:10,386 INFO L711 BuchiCegarLoop]: Abstraction has 945 states and 1425 transitions. [2019-11-28 20:39:10,386 INFO L591 BuchiCegarLoop]: Abstraction has 945 states and 1425 transitions. [2019-11-28 20:39:10,387 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:39:10,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 945 states and 1425 transitions. [2019-11-28 20:39:10,392 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2019-11-28 20:39:10,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:10,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:10,393 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:10,394 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:10,394 INFO L794 eck$LassoCheckResult]: Stem: 2900#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_#t~nondet9, main_#t~nondet10, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~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;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 2901#L153-1 [2019-11-28 20:39:10,394 INFO L796 eck$LassoCheckResult]: Loop: 2901#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 3094#L41 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;main_~lk9~0 := 0;main_~lk10~0 := 0; 3092#L66 assume !(0 != main_~p1~0); 3090#L66-2 assume !(0 != main_~p2~0); 3089#L70-1 assume !(0 != main_~p3~0); 3087#L74-1 assume !(0 != main_~p4~0); 3085#L78-1 assume !(0 != main_~p5~0); 3082#L82-1 assume !(0 != main_~p6~0); 3073#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3074#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3059#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3060#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3043#L102-1 assume !(0 != main_~p1~0); 3044#L108-1 assume !(0 != main_~p2~0); 3026#L113-1 assume !(0 != main_~p3~0); 3025#L118-1 assume !(0 != main_~p4~0); 3003#L123-1 assume !(0 != main_~p5~0); 3004#L128-1 assume !(0 != main_~p6~0); 3102#L133-1 assume !(0 != main_~p7~0); 3100#L138-1 assume !(0 != main_~p8~0); 3098#L143-1 assume !(0 != main_~p9~0); 3096#L148-1 assume !(0 != main_~p10~0); 2901#L153-1 [2019-11-28 20:39:10,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:10,395 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-28 20:39:10,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:10,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437358236] [2019-11-28 20:39:10,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:10,403 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:10,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:10,404 INFO L82 PathProgramCache]: Analyzing trace with hash -256417285, now seen corresponding path program 1 times [2019-11-28 20:39:10,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:10,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682028368] [2019-11-28 20:39:10,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:10,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682028368] [2019-11-28 20:39:10,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:10,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:10,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481959419] [2019-11-28 20:39:10,431 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:10,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:10,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:10,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:10,432 INFO L87 Difference]: Start difference. First operand 945 states and 1425 transitions. cyclomatic complexity: 512 Second operand 3 states. [2019-11-28 20:39:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:10,457 INFO L93 Difference]: Finished difference Result 1857 states and 2753 transitions. [2019-11-28 20:39:10,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:10,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1857 states and 2753 transitions. [2019-11-28 20:39:10,478 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2019-11-28 20:39:10,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1857 states to 1857 states and 2753 transitions. [2019-11-28 20:39:10,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1857 [2019-11-28 20:39:10,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1857 [2019-11-28 20:39:10,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1857 states and 2753 transitions. [2019-11-28 20:39:10,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:10,498 INFO L688 BuchiCegarLoop]: Abstraction has 1857 states and 2753 transitions. [2019-11-28 20:39:10,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states and 2753 transitions. [2019-11-28 20:39:10,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1857. [2019-11-28 20:39:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1857 states. [2019-11-28 20:39:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2753 transitions. [2019-11-28 20:39:10,544 INFO L711 BuchiCegarLoop]: Abstraction has 1857 states and 2753 transitions. [2019-11-28 20:39:10,544 INFO L591 BuchiCegarLoop]: Abstraction has 1857 states and 2753 transitions. [2019-11-28 20:39:10,544 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:39:10,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1857 states and 2753 transitions. [2019-11-28 20:39:10,555 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2019-11-28 20:39:10,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:10,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:10,556 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:10,556 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:10,557 INFO L794 eck$LassoCheckResult]: Stem: 5707#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_#t~nondet9, main_#t~nondet10, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~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;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 5708#L153-1 [2019-11-28 20:39:10,557 INFO L796 eck$LassoCheckResult]: Loop: 5708#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 5792#L41 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;main_~lk9~0 := 0;main_~lk10~0 := 0; 5789#L66 assume !(0 != main_~p1~0); 5787#L66-2 assume !(0 != main_~p2~0); 5784#L70-1 assume !(0 != main_~p3~0); 5780#L74-1 assume !(0 != main_~p4~0); 5776#L78-1 assume !(0 != main_~p5~0); 5772#L82-1 assume !(0 != main_~p6~0); 5769#L86-1 assume !(0 != main_~p7~0); 5767#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 5765#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5762#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 5759#L102-1 assume !(0 != main_~p1~0); 5756#L108-1 assume !(0 != main_~p2~0); 5752#L113-1 assume !(0 != main_~p3~0); 5751#L118-1 assume !(0 != main_~p4~0); 5815#L123-1 assume !(0 != main_~p5~0); 5811#L128-1 assume !(0 != main_~p6~0); 5807#L133-1 assume !(0 != main_~p7~0); 5804#L138-1 assume !(0 != main_~p8~0); 5800#L143-1 assume !(0 != main_~p9~0); 5797#L148-1 assume !(0 != main_~p10~0); 5708#L153-1 [2019-11-28 20:39:10,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:10,558 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-28 20:39:10,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:10,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481348466] [2019-11-28 20:39:10,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:10,566 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:10,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:10,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1267534535, now seen corresponding path program 1 times [2019-11-28 20:39:10,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:10,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603150175] [2019-11-28 20:39:10,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:10,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603150175] [2019-11-28 20:39:10,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:10,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:10,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257928569] [2019-11-28 20:39:10,591 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:10,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:10,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:10,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:10,592 INFO L87 Difference]: Start difference. First operand 1857 states and 2753 transitions. cyclomatic complexity: 960 Second operand 3 states. [2019-11-28 20:39:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:10,633 INFO L93 Difference]: Finished difference Result 3649 states and 5313 transitions. [2019-11-28 20:39:10,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:10,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3649 states and 5313 transitions. [2019-11-28 20:39:10,670 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2019-11-28 20:39:10,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3649 states to 3649 states and 5313 transitions. [2019-11-28 20:39:10,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3649 [2019-11-28 20:39:10,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3649 [2019-11-28 20:39:10,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3649 states and 5313 transitions. [2019-11-28 20:39:10,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:10,707 INFO L688 BuchiCegarLoop]: Abstraction has 3649 states and 5313 transitions. [2019-11-28 20:39:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states and 5313 transitions. [2019-11-28 20:39:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 3649. [2019-11-28 20:39:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2019-11-28 20:39:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 5313 transitions. [2019-11-28 20:39:10,797 INFO L711 BuchiCegarLoop]: Abstraction has 3649 states and 5313 transitions. [2019-11-28 20:39:10,798 INFO L591 BuchiCegarLoop]: Abstraction has 3649 states and 5313 transitions. [2019-11-28 20:39:10,798 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:39:10,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3649 states and 5313 transitions. [2019-11-28 20:39:10,818 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2019-11-28 20:39:10,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:10,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:10,822 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:10,822 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:10,828 INFO L794 eck$LassoCheckResult]: Stem: 11215#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_#t~nondet9, main_#t~nondet10, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~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;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 11216#L153-1 [2019-11-28 20:39:10,828 INFO L796 eck$LassoCheckResult]: Loop: 11216#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 11415#L41 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;main_~lk9~0 := 0;main_~lk10~0 := 0; 11362#L66 assume !(0 != main_~p1~0); 11364#L66-2 assume !(0 != main_~p2~0); 11381#L70-1 assume !(0 != main_~p3~0); 11382#L74-1 assume !(0 != main_~p4~0); 11490#L78-1 assume !(0 != main_~p5~0); 11483#L82-1 assume !(0 != main_~p6~0); 11485#L86-1 assume !(0 != main_~p7~0); 11476#L90-1 assume !(0 != main_~p8~0); 11478#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 11470#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 11471#L102-1 assume !(0 != main_~p1~0); 11519#L108-1 assume !(0 != main_~p2~0); 11517#L113-1 assume !(0 != main_~p3~0); 11512#L118-1 assume !(0 != main_~p4~0); 11513#L123-1 assume !(0 != main_~p5~0); 11532#L128-1 assume !(0 != main_~p6~0); 11530#L133-1 assume !(0 != main_~p7~0); 11529#L138-1 assume !(0 != main_~p8~0); 11426#L143-1 assume !(0 != main_~p9~0); 11425#L148-1 assume !(0 != main_~p10~0); 11216#L153-1 [2019-11-28 20:39:10,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:10,829 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-28 20:39:10,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:10,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9496821] [2019-11-28 20:39:10,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:10,840 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:10,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:10,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1854340549, now seen corresponding path program 1 times [2019-11-28 20:39:10,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:10,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744606378] [2019-11-28 20:39:10,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:10,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744606378] [2019-11-28 20:39:10,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:10,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:10,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756685620] [2019-11-28 20:39:10,882 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:10,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:10,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:10,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:10,883 INFO L87 Difference]: Start difference. First operand 3649 states and 5313 transitions. cyclomatic complexity: 1792 Second operand 3 states. [2019-11-28 20:39:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:10,932 INFO L93 Difference]: Finished difference Result 7169 states and 10241 transitions. [2019-11-28 20:39:10,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:10,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7169 states and 10241 transitions. [2019-11-28 20:39:10,991 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2019-11-28 20:39:11,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7169 states to 7169 states and 10241 transitions. [2019-11-28 20:39:11,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7169 [2019-11-28 20:39:11,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7169 [2019-11-28 20:39:11,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7169 states and 10241 transitions. [2019-11-28 20:39:11,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:11,061 INFO L688 BuchiCegarLoop]: Abstraction has 7169 states and 10241 transitions. [2019-11-28 20:39:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states and 10241 transitions. [2019-11-28 20:39:11,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 7169. [2019-11-28 20:39:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7169 states. [2019-11-28 20:39:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7169 states to 7169 states and 10241 transitions. [2019-11-28 20:39:11,219 INFO L711 BuchiCegarLoop]: Abstraction has 7169 states and 10241 transitions. [2019-11-28 20:39:11,219 INFO L591 BuchiCegarLoop]: Abstraction has 7169 states and 10241 transitions. [2019-11-28 20:39:11,219 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 20:39:11,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7169 states and 10241 transitions. [2019-11-28 20:39:11,251 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2019-11-28 20:39:11,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:11,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:11,252 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:11,252 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:11,252 INFO L794 eck$LassoCheckResult]: Stem: 22045#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_#t~nondet9, main_#t~nondet10, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~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;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 22046#L153-1 [2019-11-28 20:39:11,252 INFO L796 eck$LassoCheckResult]: Loop: 22046#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 22320#L41 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;main_~lk9~0 := 0;main_~lk10~0 := 0; 22315#L66 assume !(0 != main_~p1~0); 22316#L66-2 assume !(0 != main_~p2~0); 22303#L70-1 assume !(0 != main_~p3~0); 22304#L74-1 assume !(0 != main_~p4~0); 22412#L78-1 assume !(0 != main_~p5~0); 22408#L82-1 assume !(0 != main_~p6~0); 22404#L86-1 assume !(0 != main_~p7~0); 22398#L90-1 assume !(0 != main_~p8~0); 22392#L94-1 assume !(0 != main_~p9~0); 22389#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 22384#L102-1 assume !(0 != main_~p1~0); 22378#L108-1 assume !(0 != main_~p2~0); 22373#L113-1 assume !(0 != main_~p3~0); 22365#L118-1 assume !(0 != main_~p4~0); 22361#L123-1 assume !(0 != main_~p5~0); 22358#L128-1 assume !(0 != main_~p6~0); 22354#L133-1 assume !(0 != main_~p7~0); 22348#L138-1 assume !(0 != main_~p8~0); 22342#L143-1 assume !(0 != main_~p9~0); 22331#L148-1 assume !(0 != main_~p10~0); 22046#L153-1 [2019-11-28 20:39:11,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:11,253 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-11-28 20:39:11,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:11,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523518098] [2019-11-28 20:39:11,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:11,259 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:11,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:11,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1596175111, now seen corresponding path program 1 times [2019-11-28 20:39:11,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:11,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390751507] [2019-11-28 20:39:11,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:11,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390751507] [2019-11-28 20:39:11,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:11,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:39:11,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386812620] [2019-11-28 20:39:11,280 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:11,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:11,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:11,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:11,281 INFO L87 Difference]: Start difference. First operand 7169 states and 10241 transitions. cyclomatic complexity: 3328 Second operand 3 states. [2019-11-28 20:39:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:11,352 INFO L93 Difference]: Finished difference Result 14081 states and 19713 transitions. [2019-11-28 20:39:11,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:11,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14081 states and 19713 transitions. [2019-11-28 20:39:11,443 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2019-11-28 20:39:11,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14081 states to 14081 states and 19713 transitions. [2019-11-28 20:39:11,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14081 [2019-11-28 20:39:11,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14081 [2019-11-28 20:39:11,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14081 states and 19713 transitions. [2019-11-28 20:39:11,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:11,665 INFO L688 BuchiCegarLoop]: Abstraction has 14081 states and 19713 transitions. [2019-11-28 20:39:11,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14081 states and 19713 transitions. [2019-11-28 20:39:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14081 to 14081. [2019-11-28 20:39:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14081 states. [2019-11-28 20:39:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14081 states to 14081 states and 19713 transitions. [2019-11-28 20:39:11,892 INFO L711 BuchiCegarLoop]: Abstraction has 14081 states and 19713 transitions. [2019-11-28 20:39:11,892 INFO L591 BuchiCegarLoop]: Abstraction has 14081 states and 19713 transitions. [2019-11-28 20:39:11,892 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 20:39:11,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14081 states and 19713 transitions. [2019-11-28 20:39:11,941 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2019-11-28 20:39:11,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:11,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:11,942 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:11,943 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:11,943 INFO L794 eck$LassoCheckResult]: Stem: 43300#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_#t~nondet9, main_#t~nondet10, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~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;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 43301#L153-1 [2019-11-28 20:39:11,943 INFO L796 eck$LassoCheckResult]: Loop: 43301#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 43624#L41 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;main_~lk9~0 := 0;main_~lk10~0 := 0; 43621#L66 assume !(0 != main_~p1~0); 43617#L66-2 assume !(0 != main_~p2~0); 43614#L70-1 assume !(0 != main_~p3~0); 43611#L74-1 assume !(0 != main_~p4~0); 43607#L78-1 assume !(0 != main_~p5~0); 43604#L82-1 assume !(0 != main_~p6~0); 43600#L86-1 assume !(0 != main_~p7~0); 43601#L90-1 assume !(0 != main_~p8~0); 43649#L94-1 assume !(0 != main_~p9~0); 43748#L98-1 assume !(0 != main_~p10~0); 43750#L102-1 assume !(0 != main_~p1~0); 43657#L108-1 assume !(0 != main_~p2~0); 43654#L113-1 assume !(0 != main_~p3~0); 43650#L118-1 assume !(0 != main_~p4~0); 43645#L123-1 assume !(0 != main_~p5~0); 43460#L128-1 assume !(0 != main_~p6~0); 43462#L133-1 assume !(0 != main_~p7~0); 43634#L138-1 assume !(0 != main_~p8~0); 43630#L143-1 assume !(0 != main_~p9~0); 43627#L148-1 assume !(0 != main_~p10~0); 43301#L153-1 [2019-11-28 20:39:11,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:11,944 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-11-28 20:39:11,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:11,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587202765] [2019-11-28 20:39:11,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:11,956 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:11,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash -895110533, now seen corresponding path program 1 times [2019-11-28 20:39:11,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:11,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676252255] [2019-11-28 20:39:11,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:11,990 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:11,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:11,991 INFO L82 PathProgramCache]: Analyzing trace with hash -962117286, now seen corresponding path program 1 times [2019-11-28 20:39:11,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:11,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633447973] [2019-11-28 20:39:11,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:12,015 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:12,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:39:12 BoogieIcfgContainer [2019-11-28 20:39:12,256 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:39:12,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:39:12,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:39:12,260 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:39:12,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:09" (3/4) ... [2019-11-28 20:39:12,265 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 20:39:12,360 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:39:12,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:39:12,363 INFO L168 Benchmark]: Toolchain (without parser) took 3850.83 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -145.7 MB). Peak memory consumption was 137.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:12,364 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:39:12,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.29 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 945.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:12,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:12,365 INFO L168 Benchmark]: Boogie Preprocessor took 38.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:12,365 INFO L168 Benchmark]: RCFGBuilder took 358.01 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.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:12,366 INFO L168 Benchmark]: BuchiAutomizer took 2966.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.3 MB). Peak memory consumption was 150.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:12,366 INFO L168 Benchmark]: Witness Printer took 101.87 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:39:12,368 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.29 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 945.6 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 104.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 358.01 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.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2966.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.3 MB). Peak memory consumption was 150.0 MB. Max. memory is 11.5 GB. * Witness Printer took 101.87 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 14081 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had 14081 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 713 SDtfs, 374 SDslu, 436 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI9 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: 39]: 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, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f441e85=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6330cf5e=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c5f297f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c7d7d8c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@381e84cf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@102981ad=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6311923d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@872931a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@256a3fab=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@347df524=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b220540=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 39]: 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; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L37] int cond; Loop: [L39] COND TRUE 1 [L40] cond = __VERIFIER_nondet_int() [L41] COND FALSE !(cond == 0) [L44] lk1 = 0 [L46] lk2 = 0 [L48] lk3 = 0 [L50] lk4 = 0 [L52] lk5 = 0 [L54] lk6 = 0 [L56] lk7 = 0 [L58] lk8 = 0 [L60] lk9 = 0 [L62] lk10 = 0 [L66] COND FALSE !(p1 != 0) [L70] COND FALSE !(p2 != 0) [L74] COND FALSE !(p3 != 0) [L78] COND FALSE !(p4 != 0) [L82] COND FALSE !(p5 != 0) [L86] COND FALSE !(p6 != 0) [L90] COND FALSE !(p7 != 0) [L94] COND FALSE !(p8 != 0) [L98] COND FALSE !(p9 != 0) [L102] COND FALSE !(p10 != 0) [L108] COND FALSE !(p1 != 0) [L113] COND FALSE !(p2 != 0) [L118] COND FALSE !(p3 != 0) [L123] COND FALSE !(p4 != 0) [L128] COND FALSE !(p5 != 0) [L133] COND FALSE !(p6 != 0) [L138] COND FALSE !(p7 != 0) [L143] COND FALSE !(p8 != 0) [L148] COND FALSE !(p9 != 0) [L153] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...