./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_9.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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_9.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 5107685577f81a5867811396b2c0a05eb5630c95 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-8bd4bc6 [2020-07-29 01:45:11,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:45:11,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:45:11,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:45:11,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:45:11,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:45:11,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:45:11,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:45:11,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:45:11,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:45:11,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:45:11,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:45:11,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:45:11,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:45:11,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:45:11,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:45:11,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:45:11,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:45:11,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:45:11,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:45:11,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:45:11,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:45:11,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:45:11,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:45:11,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:45:11,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:45:11,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:45:11,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:45:11,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:45:11,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:45:11,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:45:11,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:45:11,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:45:11,927 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:45:11,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:45:11,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:45:11,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:45:11,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:45:11,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:45:11,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:45:11,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:45:11,932 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 01:45:11,949 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:45:11,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:45:11,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:45:11,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:45:11,951 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:45:11,951 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:45:11,951 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:45:11,951 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:45:11,952 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:45:11,952 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:45:11,952 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:45:11,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:45:11,953 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:45:11,953 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:45:11,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:45:11,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:45:11,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:45:11,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:45:11,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:45:11,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:45:11,954 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:45:11,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:45:11,955 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:45:11,955 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:45:11,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:45:11,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:45:11,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:45:11,956 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:45:11,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:45:11,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:45:11,956 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:45:11,957 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:45:11,958 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:45:11,958 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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2020-07-29 01:45:12,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:45:12,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:45:12,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:45:12,321 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:45:12,322 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:45:12,323 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2020-07-29 01:45:12,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89267aaeb/87d00636bb1041bb83532451382d2e3c/FLAGdd37a479c [2020-07-29 01:45:12,768 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:45:12,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2020-07-29 01:45:12,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89267aaeb/87d00636bb1041bb83532451382d2e3c/FLAGdd37a479c [2020-07-29 01:45:13,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89267aaeb/87d00636bb1041bb83532451382d2e3c [2020-07-29 01:45:13,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:45:13,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:45:13,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:45:13,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:45:13,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:45:13,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:45:13" (1/1) ... [2020-07-29 01:45:13,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3264ec97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:45:13, skipping insertion in model container [2020-07-29 01:45:13,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:45:13" (1/1) ... [2020-07-29 01:45:13,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:45:13,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:45:13,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:45:13,470 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:45:13,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:45:13,515 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:45:13,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:45:13 WrapperNode [2020-07-29 01:45:13,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:45:13,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:45:13,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:45:13,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:45:13,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:45:13" (1/1) ... [2020-07-29 01:45:13,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:45:13" (1/1) ... [2020-07-29 01:45:13,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:45:13,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:45:13,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:45:13,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:45:13,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:45:13" (1/1) ... [2020-07-29 01:45:13,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:45:13" (1/1) ... [2020-07-29 01:45:13,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:45:13" (1/1) ... [2020-07-29 01:45:13,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:45:13" (1/1) ... [2020-07-29 01:45:13,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:45:13" (1/1) ... [2020-07-29 01:45:13,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:45:13" (1/1) ... [2020-07-29 01:45:13,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:45:13" (1/1) ... [2020-07-29 01:45:13,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:45:13,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:45:13,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:45:13,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:45:13,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:45:13" (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 [2020-07-29 01:45:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:45:13,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:45:14,171 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:45:14,171 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:45:14,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:45:14 BoogieIcfgContainer [2020-07-29 01:45:14,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:45:14,179 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:45:14,180 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:45:14,183 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:45:14,184 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:45:14,184 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:45:13" (1/3) ... [2020-07-29 01:45:14,186 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7050e299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:45:14, skipping insertion in model container [2020-07-29 01:45:14,186 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:45:14,187 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:45:13" (2/3) ... [2020-07-29 01:45:14,188 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7050e299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:45:14, skipping insertion in model container [2020-07-29 01:45:14,188 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:45:14,188 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:45:14" (3/3) ... [2020-07-29 01:45:14,192 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_9.c [2020-07-29 01:45:14,245 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:45:14,246 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:45:14,246 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:45:14,246 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:45:14,246 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:45:14,246 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:45:14,246 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:45:14,246 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:45:14,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-07-29 01:45:14,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2020-07-29 01:45:14,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:45:14,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:45:14,302 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:45:14,303 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] [2020-07-29 01:45:14,303 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:45:14,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-07-29 01:45:14,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2020-07-29 01:45:14,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:45:14,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:45:14,311 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:45:14,312 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] [2020-07-29 01:45:14,319 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_~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_~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;havoc main_~cond~0; 31#L139-1true [2020-07-29 01:45:14,320 INFO L796 eck$LassoCheckResult]: Loop: 31#L139-1true assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 4#L38true 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; 27#L61true assume 0 != main_~p1~0;main_~lk1~0 := 1; 24#L61-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 11#L65-1true assume !(0 != main_~p3~0); 20#L69-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 8#L73-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 34#L77-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 23#L81-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 30#L85-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 17#L89-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 5#L93-1true assume !(0 != main_~p1~0); 35#L99-1true assume !(0 != main_~p2~0); 6#L104-1true assume !(0 != main_~p3~0); 14#L109-1true assume !(0 != main_~p4~0); 26#L114-1true assume !(0 != main_~p5~0); 33#L119-1true assume !(0 != main_~p6~0); 3#L124-1true assume !(0 != main_~p7~0); 12#L129-1true assume !(0 != main_~p8~0); 22#L134-1true assume !(0 != main_~p9~0); 31#L139-1true [2020-07-29 01:45:14,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:14,324 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:45:14,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:14,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748629660] [2020-07-29 01:45:14,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:14,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:14,403 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:14,424 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:14,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:14,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1889319211, now seen corresponding path program 1 times [2020-07-29 01:45:14,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:14,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240892983] [2020-07-29 01:45:14,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:45:14,539 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; {41#true} is VALID [2020-07-29 01:45:14,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} 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; {41#true} is VALID [2020-07-29 01:45:14,541 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#true} assume 0 != main_~p1~0;main_~lk1~0 := 1; {43#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:45:14,541 INFO L280 TraceCheckUtils]: 3: Hoare triple {43#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p2~0;main_~lk2~0 := 1; {43#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:45:14,542 INFO L280 TraceCheckUtils]: 4: Hoare triple {43#(not (= 0 ULTIMATE.start_main_~p1~0))} assume !(0 != main_~p3~0); {43#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:45:14,544 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p4~0;main_~lk4~0 := 1; {43#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:45:14,545 INFO L280 TraceCheckUtils]: 6: Hoare triple {43#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p5~0;main_~lk5~0 := 1; {43#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:45:14,546 INFO L280 TraceCheckUtils]: 7: Hoare triple {43#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p6~0;main_~lk6~0 := 1; {43#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:45:14,546 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p7~0;main_~lk7~0 := 1; {43#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:45:14,547 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {43#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:45:14,548 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {43#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:45:14,549 INFO L280 TraceCheckUtils]: 11: Hoare triple {43#(not (= 0 ULTIMATE.start_main_~p1~0))} assume !(0 != main_~p1~0); {42#false} is VALID [2020-07-29 01:45:14,550 INFO L280 TraceCheckUtils]: 12: Hoare triple {42#false} assume !(0 != main_~p2~0); {42#false} is VALID [2020-07-29 01:45:14,550 INFO L280 TraceCheckUtils]: 13: Hoare triple {42#false} assume !(0 != main_~p3~0); {42#false} is VALID [2020-07-29 01:45:14,551 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#false} assume !(0 != main_~p4~0); {42#false} is VALID [2020-07-29 01:45:14,551 INFO L280 TraceCheckUtils]: 15: Hoare triple {42#false} assume !(0 != main_~p5~0); {42#false} is VALID [2020-07-29 01:45:14,552 INFO L280 TraceCheckUtils]: 16: Hoare triple {42#false} assume !(0 != main_~p6~0); {42#false} is VALID [2020-07-29 01:45:14,552 INFO L280 TraceCheckUtils]: 17: Hoare triple {42#false} assume !(0 != main_~p7~0); {42#false} is VALID [2020-07-29 01:45:14,552 INFO L280 TraceCheckUtils]: 18: Hoare triple {42#false} assume !(0 != main_~p8~0); {42#false} is VALID [2020-07-29 01:45:14,553 INFO L280 TraceCheckUtils]: 19: Hoare triple {42#false} assume !(0 != main_~p9~0); {42#false} is VALID [2020-07-29 01:45:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:45:14,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240892983] [2020-07-29 01:45:14,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:45:14,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:45:14,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556622452] [2020-07-29 01:45:14,567 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:45:14,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:45:14,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:45:14,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:45:14,584 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-29 01:45:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:14,769 INFO L93 Difference]: Finished difference Result 68 states and 117 transitions. [2020-07-29 01:45:14,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:45:14,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:45:14,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:45:14,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 117 transitions. [2020-07-29 01:45:14,814 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2020-07-29 01:45:14,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 58 states and 92 transitions. [2020-07-29 01:45:14,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2020-07-29 01:45:14,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2020-07-29 01:45:14,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 92 transitions. [2020-07-29 01:45:14,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:45:14,825 INFO L688 BuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2020-07-29 01:45:14,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 92 transitions. [2020-07-29 01:45:14,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-07-29 01:45:14,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:45:14,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states and 92 transitions. Second operand 58 states. [2020-07-29 01:45:14,857 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states and 92 transitions. Second operand 58 states. [2020-07-29 01:45:14,858 INFO L87 Difference]: Start difference. First operand 58 states and 92 transitions. Second operand 58 states. [2020-07-29 01:45:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:14,863 INFO L93 Difference]: Finished difference Result 58 states and 92 transitions. [2020-07-29 01:45:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 92 transitions. [2020-07-29 01:45:14,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:14,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:14,866 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states and 92 transitions. [2020-07-29 01:45:14,866 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states and 92 transitions. [2020-07-29 01:45:14,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:14,871 INFO L93 Difference]: Finished difference Result 58 states and 92 transitions. [2020-07-29 01:45:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 92 transitions. [2020-07-29 01:45:14,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:14,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:14,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:45:14,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:45:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-29 01:45:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 92 transitions. [2020-07-29 01:45:14,878 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2020-07-29 01:45:14,878 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2020-07-29 01:45:14,879 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:45:14,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 92 transitions. [2020-07-29 01:45:14,880 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2020-07-29 01:45:14,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:45:14,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:45:14,882 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:45:14,882 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] [2020-07-29 01:45:14,882 INFO L794 eck$LassoCheckResult]: Stem: 143#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_~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_~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;havoc main_~cond~0; 144#L139-1 [2020-07-29 01:45:14,882 INFO L796 eck$LassoCheckResult]: Loop: 144#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 155#L38 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; 154#L61 assume !(0 != main_~p1~0); 139#L61-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 128#L65-1 assume !(0 != main_~p3~0); 129#L69-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 124#L73-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 125#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 150#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 149#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 148#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 147#L93-1 assume !(0 != main_~p1~0); 146#L99-1 assume !(0 != main_~p2~0); 119#L104-1 assume !(0 != main_~p3~0); 120#L109-1 assume !(0 != main_~p4~0); 127#L114-1 assume !(0 != main_~p5~0); 135#L119-1 assume !(0 != main_~p6~0); 112#L124-1 assume !(0 != main_~p7~0); 113#L129-1 assume !(0 != main_~p8~0); 157#L134-1 assume !(0 != main_~p9~0); 144#L139-1 [2020-07-29 01:45:14,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:14,883 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-07-29 01:45:14,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:14,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498865212] [2020-07-29 01:45:14,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:14,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:14,892 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:14,895 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:14,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:14,896 INFO L82 PathProgramCache]: Analyzing trace with hash 411503379, now seen corresponding path program 1 times [2020-07-29 01:45:14,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:14,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551300747] [2020-07-29 01:45:14,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:45:14,954 INFO L280 TraceCheckUtils]: 0: Hoare triple {291#true} assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; {291#true} is VALID [2020-07-29 01:45:14,954 INFO L280 TraceCheckUtils]: 1: Hoare triple {291#true} 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; {291#true} is VALID [2020-07-29 01:45:14,955 INFO L280 TraceCheckUtils]: 2: Hoare triple {291#true} assume !(0 != main_~p1~0); {291#true} is VALID [2020-07-29 01:45:14,955 INFO L280 TraceCheckUtils]: 3: Hoare triple {291#true} assume 0 != main_~p2~0;main_~lk2~0 := 1; {293#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:45:14,957 INFO L280 TraceCheckUtils]: 4: Hoare triple {293#(not (= 0 ULTIMATE.start_main_~p2~0))} assume !(0 != main_~p3~0); {293#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:45:14,959 INFO L280 TraceCheckUtils]: 5: Hoare triple {293#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p4~0;main_~lk4~0 := 1; {293#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:45:14,960 INFO L280 TraceCheckUtils]: 6: Hoare triple {293#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p5~0;main_~lk5~0 := 1; {293#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:45:14,961 INFO L280 TraceCheckUtils]: 7: Hoare triple {293#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p6~0;main_~lk6~0 := 1; {293#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:45:14,962 INFO L280 TraceCheckUtils]: 8: Hoare triple {293#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p7~0;main_~lk7~0 := 1; {293#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:45:14,963 INFO L280 TraceCheckUtils]: 9: Hoare triple {293#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {293#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:45:14,964 INFO L280 TraceCheckUtils]: 10: Hoare triple {293#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {293#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:45:14,964 INFO L280 TraceCheckUtils]: 11: Hoare triple {293#(not (= 0 ULTIMATE.start_main_~p2~0))} assume !(0 != main_~p1~0); {293#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:45:14,966 INFO L280 TraceCheckUtils]: 12: Hoare triple {293#(not (= 0 ULTIMATE.start_main_~p2~0))} assume !(0 != main_~p2~0); {292#false} is VALID [2020-07-29 01:45:14,967 INFO L280 TraceCheckUtils]: 13: Hoare triple {292#false} assume !(0 != main_~p3~0); {292#false} is VALID [2020-07-29 01:45:14,967 INFO L280 TraceCheckUtils]: 14: Hoare triple {292#false} assume !(0 != main_~p4~0); {292#false} is VALID [2020-07-29 01:45:14,967 INFO L280 TraceCheckUtils]: 15: Hoare triple {292#false} assume !(0 != main_~p5~0); {292#false} is VALID [2020-07-29 01:45:14,968 INFO L280 TraceCheckUtils]: 16: Hoare triple {292#false} assume !(0 != main_~p6~0); {292#false} is VALID [2020-07-29 01:45:14,968 INFO L280 TraceCheckUtils]: 17: Hoare triple {292#false} assume !(0 != main_~p7~0); {292#false} is VALID [2020-07-29 01:45:14,968 INFO L280 TraceCheckUtils]: 18: Hoare triple {292#false} assume !(0 != main_~p8~0); {292#false} is VALID [2020-07-29 01:45:14,969 INFO L280 TraceCheckUtils]: 19: Hoare triple {292#false} assume !(0 != main_~p9~0); {292#false} is VALID [2020-07-29 01:45:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:45:14,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551300747] [2020-07-29 01:45:14,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:45:14,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:45:14,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612261365] [2020-07-29 01:45:14,973 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:45:14,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:45:14,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:45:14,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:45:14,974 INFO L87 Difference]: Start difference. First operand 58 states and 92 transitions. cyclomatic complexity: 36 Second operand 3 states. [2020-07-29 01:45:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:15,096 INFO L93 Difference]: Finished difference Result 113 states and 177 transitions. [2020-07-29 01:45:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:45:15,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:45:15,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:45:15,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 177 transitions. [2020-07-29 01:45:15,135 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2020-07-29 01:45:15,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 113 states and 177 transitions. [2020-07-29 01:45:15,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2020-07-29 01:45:15,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2020-07-29 01:45:15,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 177 transitions. [2020-07-29 01:45:15,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:45:15,144 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2020-07-29 01:45:15,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 177 transitions. [2020-07-29 01:45:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-07-29 01:45:15,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:45:15,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states and 177 transitions. Second operand 113 states. [2020-07-29 01:45:15,154 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states and 177 transitions. Second operand 113 states. [2020-07-29 01:45:15,154 INFO L87 Difference]: Start difference. First operand 113 states and 177 transitions. Second operand 113 states. [2020-07-29 01:45:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:15,160 INFO L93 Difference]: Finished difference Result 113 states and 177 transitions. [2020-07-29 01:45:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 177 transitions. [2020-07-29 01:45:15,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:15,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:15,162 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 113 states and 177 transitions. [2020-07-29 01:45:15,163 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 113 states and 177 transitions. [2020-07-29 01:45:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:15,169 INFO L93 Difference]: Finished difference Result 113 states and 177 transitions. [2020-07-29 01:45:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 177 transitions. [2020-07-29 01:45:15,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:15,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:15,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:45:15,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:45:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-29 01:45:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 177 transitions. [2020-07-29 01:45:15,178 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2020-07-29 01:45:15,178 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2020-07-29 01:45:15,178 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:45:15,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 177 transitions. [2020-07-29 01:45:15,180 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2020-07-29 01:45:15,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:45:15,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:45:15,182 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:45:15,182 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] [2020-07-29 01:45:15,182 INFO L794 eck$LassoCheckResult]: Stem: 442#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_~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_~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;havoc main_~cond~0; 443#L139-1 [2020-07-29 01:45:15,183 INFO L796 eck$LassoCheckResult]: Loop: 443#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 410#L38 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; 411#L61 assume !(0 != main_~p1~0); 461#L61-2 assume !(0 != main_~p2~0); 519#L65-1 assume !(0 != main_~p3~0); 518#L69-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 517#L73-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 516#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 515#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 514#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 513#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 497#L93-1 assume !(0 != main_~p1~0); 494#L99-1 assume !(0 != main_~p2~0); 491#L104-1 assume !(0 != main_~p3~0); 488#L109-1 assume !(0 != main_~p4~0); 487#L114-1 assume !(0 != main_~p5~0); 485#L119-1 assume !(0 != main_~p6~0); 475#L124-1 assume !(0 != main_~p7~0); 470#L129-1 assume !(0 != main_~p8~0); 460#L134-1 assume !(0 != main_~p9~0); 443#L139-1 [2020-07-29 01:45:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:15,183 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2020-07-29 01:45:15,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:15,184 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700574141] [2020-07-29 01:45:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:15,189 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:15,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:15,195 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:15,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:15,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1176844523, now seen corresponding path program 1 times [2020-07-29 01:45:15,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:15,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147381521] [2020-07-29 01:45:15,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:45:15,239 INFO L280 TraceCheckUtils]: 0: Hoare triple {751#true} assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; {751#true} is VALID [2020-07-29 01:45:15,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {751#true} 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; {751#true} is VALID [2020-07-29 01:45:15,239 INFO L280 TraceCheckUtils]: 2: Hoare triple {751#true} assume !(0 != main_~p1~0); {751#true} is VALID [2020-07-29 01:45:15,240 INFO L280 TraceCheckUtils]: 3: Hoare triple {751#true} assume !(0 != main_~p2~0); {751#true} is VALID [2020-07-29 01:45:15,240 INFO L280 TraceCheckUtils]: 4: Hoare triple {751#true} assume !(0 != main_~p3~0); {751#true} is VALID [2020-07-29 01:45:15,241 INFO L280 TraceCheckUtils]: 5: Hoare triple {751#true} assume 0 != main_~p4~0;main_~lk4~0 := 1; {753#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:45:15,244 INFO L280 TraceCheckUtils]: 6: Hoare triple {753#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p5~0;main_~lk5~0 := 1; {753#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:45:15,245 INFO L280 TraceCheckUtils]: 7: Hoare triple {753#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p6~0;main_~lk6~0 := 1; {753#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:45:15,247 INFO L280 TraceCheckUtils]: 8: Hoare triple {753#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p7~0;main_~lk7~0 := 1; {753#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:45:15,250 INFO L280 TraceCheckUtils]: 9: Hoare triple {753#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {753#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:45:15,251 INFO L280 TraceCheckUtils]: 10: Hoare triple {753#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {753#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:45:15,252 INFO L280 TraceCheckUtils]: 11: Hoare triple {753#(not (= 0 ULTIMATE.start_main_~p4~0))} assume !(0 != main_~p1~0); {753#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:45:15,253 INFO L280 TraceCheckUtils]: 12: Hoare triple {753#(not (= 0 ULTIMATE.start_main_~p4~0))} assume !(0 != main_~p2~0); {753#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:45:15,254 INFO L280 TraceCheckUtils]: 13: Hoare triple {753#(not (= 0 ULTIMATE.start_main_~p4~0))} assume !(0 != main_~p3~0); {753#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:45:15,255 INFO L280 TraceCheckUtils]: 14: Hoare triple {753#(not (= 0 ULTIMATE.start_main_~p4~0))} assume !(0 != main_~p4~0); {752#false} is VALID [2020-07-29 01:45:15,256 INFO L280 TraceCheckUtils]: 15: Hoare triple {752#false} assume !(0 != main_~p5~0); {752#false} is VALID [2020-07-29 01:45:15,256 INFO L280 TraceCheckUtils]: 16: Hoare triple {752#false} assume !(0 != main_~p6~0); {752#false} is VALID [2020-07-29 01:45:15,256 INFO L280 TraceCheckUtils]: 17: Hoare triple {752#false} assume !(0 != main_~p7~0); {752#false} is VALID [2020-07-29 01:45:15,257 INFO L280 TraceCheckUtils]: 18: Hoare triple {752#false} assume !(0 != main_~p8~0); {752#false} is VALID [2020-07-29 01:45:15,257 INFO L280 TraceCheckUtils]: 19: Hoare triple {752#false} assume !(0 != main_~p9~0); {752#false} is VALID [2020-07-29 01:45:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:45:15,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147381521] [2020-07-29 01:45:15,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:45:15,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:45:15,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799898667] [2020-07-29 01:45:15,261 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:45:15,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:45:15,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:45:15,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:45:15,262 INFO L87 Difference]: Start difference. First operand 113 states and 177 transitions. cyclomatic complexity: 68 Second operand 3 states. [2020-07-29 01:45:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:15,375 INFO L93 Difference]: Finished difference Result 221 states and 341 transitions. [2020-07-29 01:45:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:45:15,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:45:15,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:45:15,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 341 transitions. [2020-07-29 01:45:15,416 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2020-07-29 01:45:15,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 221 states and 341 transitions. [2020-07-29 01:45:15,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2020-07-29 01:45:15,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2020-07-29 01:45:15,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 341 transitions. [2020-07-29 01:45:15,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:45:15,431 INFO L688 BuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2020-07-29 01:45:15,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 341 transitions. [2020-07-29 01:45:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2020-07-29 01:45:15,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:45:15,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states and 341 transitions. Second operand 221 states. [2020-07-29 01:45:15,445 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states and 341 transitions. Second operand 221 states. [2020-07-29 01:45:15,445 INFO L87 Difference]: Start difference. First operand 221 states and 341 transitions. Second operand 221 states. [2020-07-29 01:45:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:15,457 INFO L93 Difference]: Finished difference Result 221 states and 341 transitions. [2020-07-29 01:45:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 341 transitions. [2020-07-29 01:45:15,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:15,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:15,463 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand 221 states and 341 transitions. [2020-07-29 01:45:15,464 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 221 states and 341 transitions. [2020-07-29 01:45:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:15,475 INFO L93 Difference]: Finished difference Result 221 states and 341 transitions. [2020-07-29 01:45:15,475 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 341 transitions. [2020-07-29 01:45:15,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:15,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:15,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:45:15,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:45:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-07-29 01:45:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 341 transitions. [2020-07-29 01:45:15,486 INFO L711 BuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2020-07-29 01:45:15,486 INFO L591 BuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2020-07-29 01:45:15,486 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:45:15,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 341 transitions. [2020-07-29 01:45:15,488 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2020-07-29 01:45:15,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:45:15,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:45:15,489 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:45:15,490 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] [2020-07-29 01:45:15,490 INFO L794 eck$LassoCheckResult]: Stem: 1008#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_~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_~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;havoc main_~cond~0; 1009#L139-1 [2020-07-29 01:45:15,490 INFO L796 eck$LassoCheckResult]: Loop: 1009#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 1050#L38 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; 1048#L61 assume !(0 != main_~p1~0); 1044#L61-2 assume !(0 != main_~p2~0); 1042#L65-1 assume !(0 != main_~p3~0); 1038#L69-1 assume !(0 != main_~p4~0); 1036#L73-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1034#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1032#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1030#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1028#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1025#L93-1 assume !(0 != main_~p1~0); 1026#L99-1 assume !(0 != main_~p2~0); 1076#L104-1 assume !(0 != main_~p3~0); 1071#L109-1 assume !(0 != main_~p4~0); 1068#L114-1 assume !(0 != main_~p5~0); 1066#L119-1 assume !(0 != main_~p6~0); 1061#L124-1 assume !(0 != main_~p7~0); 1058#L129-1 assume !(0 != main_~p8~0); 1054#L134-1 assume !(0 != main_~p9~0); 1009#L139-1 [2020-07-29 01:45:15,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:15,491 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2020-07-29 01:45:15,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:15,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069015295] [2020-07-29 01:45:15,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:15,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:15,507 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:15,510 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:15,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:15,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1838259095, now seen corresponding path program 1 times [2020-07-29 01:45:15,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:15,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260581880] [2020-07-29 01:45:15,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:45:15,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {1643#true} assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; {1643#true} is VALID [2020-07-29 01:45:15,548 INFO L280 TraceCheckUtils]: 1: Hoare triple {1643#true} 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; {1643#true} is VALID [2020-07-29 01:45:15,548 INFO L280 TraceCheckUtils]: 2: Hoare triple {1643#true} assume !(0 != main_~p1~0); {1643#true} is VALID [2020-07-29 01:45:15,548 INFO L280 TraceCheckUtils]: 3: Hoare triple {1643#true} assume !(0 != main_~p2~0); {1643#true} is VALID [2020-07-29 01:45:15,549 INFO L280 TraceCheckUtils]: 4: Hoare triple {1643#true} assume !(0 != main_~p3~0); {1643#true} is VALID [2020-07-29 01:45:15,549 INFO L280 TraceCheckUtils]: 5: Hoare triple {1643#true} assume !(0 != main_~p4~0); {1643#true} is VALID [2020-07-29 01:45:15,550 INFO L280 TraceCheckUtils]: 6: Hoare triple {1643#true} assume 0 != main_~p5~0;main_~lk5~0 := 1; {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:45:15,551 INFO L280 TraceCheckUtils]: 7: Hoare triple {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} assume 0 != main_~p6~0;main_~lk6~0 := 1; {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:45:15,551 INFO L280 TraceCheckUtils]: 8: Hoare triple {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} assume 0 != main_~p7~0;main_~lk7~0 := 1; {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:45:15,552 INFO L280 TraceCheckUtils]: 9: Hoare triple {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:45:15,553 INFO L280 TraceCheckUtils]: 10: Hoare triple {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:45:15,554 INFO L280 TraceCheckUtils]: 11: Hoare triple {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p1~0); {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:45:15,555 INFO L280 TraceCheckUtils]: 12: Hoare triple {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p2~0); {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:45:15,556 INFO L280 TraceCheckUtils]: 13: Hoare triple {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p3~0); {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:45:15,556 INFO L280 TraceCheckUtils]: 14: Hoare triple {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p4~0); {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:45:15,557 INFO L280 TraceCheckUtils]: 15: Hoare triple {1645#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p5~0); {1644#false} is VALID [2020-07-29 01:45:15,558 INFO L280 TraceCheckUtils]: 16: Hoare triple {1644#false} assume !(0 != main_~p6~0); {1644#false} is VALID [2020-07-29 01:45:15,558 INFO L280 TraceCheckUtils]: 17: Hoare triple {1644#false} assume !(0 != main_~p7~0); {1644#false} is VALID [2020-07-29 01:45:15,558 INFO L280 TraceCheckUtils]: 18: Hoare triple {1644#false} assume !(0 != main_~p8~0); {1644#false} is VALID [2020-07-29 01:45:15,558 INFO L280 TraceCheckUtils]: 19: Hoare triple {1644#false} assume !(0 != main_~p9~0); {1644#false} is VALID [2020-07-29 01:45:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:45:15,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260581880] [2020-07-29 01:45:15,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:45:15,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:45:15,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364660972] [2020-07-29 01:45:15,561 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:45:15,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:45:15,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:45:15,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:45:15,562 INFO L87 Difference]: Start difference. First operand 221 states and 341 transitions. cyclomatic complexity: 128 Second operand 3 states. [2020-07-29 01:45:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:15,688 INFO L93 Difference]: Finished difference Result 433 states and 657 transitions. [2020-07-29 01:45:15,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:45:15,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:45:15,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:45:15,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 657 transitions. [2020-07-29 01:45:15,739 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2020-07-29 01:45:15,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 433 states and 657 transitions. [2020-07-29 01:45:15,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 433 [2020-07-29 01:45:15,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 433 [2020-07-29 01:45:15,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 657 transitions. [2020-07-29 01:45:15,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:45:15,760 INFO L688 BuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2020-07-29 01:45:15,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 657 transitions. [2020-07-29 01:45:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2020-07-29 01:45:15,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:45:15,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 433 states and 657 transitions. Second operand 433 states. [2020-07-29 01:45:15,773 INFO L74 IsIncluded]: Start isIncluded. First operand 433 states and 657 transitions. Second operand 433 states. [2020-07-29 01:45:15,773 INFO L87 Difference]: Start difference. First operand 433 states and 657 transitions. Second operand 433 states. [2020-07-29 01:45:15,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:15,816 INFO L93 Difference]: Finished difference Result 433 states and 657 transitions. [2020-07-29 01:45:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 657 transitions. [2020-07-29 01:45:15,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:15,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:15,817 INFO L74 IsIncluded]: Start isIncluded. First operand 433 states. Second operand 433 states and 657 transitions. [2020-07-29 01:45:15,818 INFO L87 Difference]: Start difference. First operand 433 states. Second operand 433 states and 657 transitions. [2020-07-29 01:45:15,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:15,865 INFO L93 Difference]: Finished difference Result 433 states and 657 transitions. [2020-07-29 01:45:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 657 transitions. [2020-07-29 01:45:15,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:15,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:15,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:45:15,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:45:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-07-29 01:45:15,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 657 transitions. [2020-07-29 01:45:15,883 INFO L711 BuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2020-07-29 01:45:15,883 INFO L591 BuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2020-07-29 01:45:15,883 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:45:15,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 433 states and 657 transitions. [2020-07-29 01:45:15,886 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2020-07-29 01:45:15,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:45:15,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:45:15,888 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:45:15,889 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] [2020-07-29 01:45:15,889 INFO L794 eck$LassoCheckResult]: Stem: 2114#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_~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_~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;havoc main_~cond~0; 2115#L139-1 [2020-07-29 01:45:15,889 INFO L796 eck$LassoCheckResult]: Loop: 2115#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 2163#L38 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; 2161#L61 assume !(0 != main_~p1~0); 2157#L61-2 assume !(0 != main_~p2~0); 2155#L65-1 assume !(0 != main_~p3~0); 2151#L69-1 assume !(0 != main_~p4~0); 2147#L73-1 assume !(0 != main_~p5~0); 2145#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2143#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2141#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2139#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2137#L93-1 assume !(0 != main_~p1~0); 2131#L99-1 assume !(0 != main_~p2~0); 2133#L104-1 assume !(0 != main_~p3~0); 2188#L109-1 assume !(0 != main_~p4~0); 2184#L114-1 assume !(0 != main_~p5~0); 2181#L119-1 assume !(0 != main_~p6~0); 2176#L124-1 assume !(0 != main_~p7~0); 2173#L129-1 assume !(0 != main_~p8~0); 2167#L134-1 assume !(0 != main_~p9~0); 2115#L139-1 [2020-07-29 01:45:15,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:15,889 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2020-07-29 01:45:15,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:15,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371323302] [2020-07-29 01:45:15,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:15,900 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:15,907 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:15,911 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:15,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:15,912 INFO L82 PathProgramCache]: Analyzing trace with hash 827141845, now seen corresponding path program 1 times [2020-07-29 01:45:15,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:15,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997791437] [2020-07-29 01:45:15,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:45:15,983 INFO L280 TraceCheckUtils]: 0: Hoare triple {3383#true} assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; {3383#true} is VALID [2020-07-29 01:45:15,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {3383#true} 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; {3383#true} is VALID [2020-07-29 01:45:15,983 INFO L280 TraceCheckUtils]: 2: Hoare triple {3383#true} assume !(0 != main_~p1~0); {3383#true} is VALID [2020-07-29 01:45:15,984 INFO L280 TraceCheckUtils]: 3: Hoare triple {3383#true} assume !(0 != main_~p2~0); {3383#true} is VALID [2020-07-29 01:45:15,984 INFO L280 TraceCheckUtils]: 4: Hoare triple {3383#true} assume !(0 != main_~p3~0); {3383#true} is VALID [2020-07-29 01:45:15,984 INFO L280 TraceCheckUtils]: 5: Hoare triple {3383#true} assume !(0 != main_~p4~0); {3383#true} is VALID [2020-07-29 01:45:15,985 INFO L280 TraceCheckUtils]: 6: Hoare triple {3383#true} assume !(0 != main_~p5~0); {3383#true} is VALID [2020-07-29 01:45:15,986 INFO L280 TraceCheckUtils]: 7: Hoare triple {3383#true} assume 0 != main_~p6~0;main_~lk6~0 := 1; {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:45:15,987 INFO L280 TraceCheckUtils]: 8: Hoare triple {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} assume 0 != main_~p7~0;main_~lk7~0 := 1; {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:45:15,988 INFO L280 TraceCheckUtils]: 9: Hoare triple {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:45:15,989 INFO L280 TraceCheckUtils]: 10: Hoare triple {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:45:15,990 INFO L280 TraceCheckUtils]: 11: Hoare triple {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p1~0); {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:45:15,991 INFO L280 TraceCheckUtils]: 12: Hoare triple {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p2~0); {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:45:15,994 INFO L280 TraceCheckUtils]: 13: Hoare triple {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p3~0); {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:45:15,994 INFO L280 TraceCheckUtils]: 14: Hoare triple {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p4~0); {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:45:15,995 INFO L280 TraceCheckUtils]: 15: Hoare triple {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p5~0); {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:45:15,996 INFO L280 TraceCheckUtils]: 16: Hoare triple {3385#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p6~0); {3384#false} is VALID [2020-07-29 01:45:15,996 INFO L280 TraceCheckUtils]: 17: Hoare triple {3384#false} assume !(0 != main_~p7~0); {3384#false} is VALID [2020-07-29 01:45:15,997 INFO L280 TraceCheckUtils]: 18: Hoare triple {3384#false} assume !(0 != main_~p8~0); {3384#false} is VALID [2020-07-29 01:45:15,997 INFO L280 TraceCheckUtils]: 19: Hoare triple {3384#false} assume !(0 != main_~p9~0); {3384#false} is VALID [2020-07-29 01:45:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:45:15,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997791437] [2020-07-29 01:45:16,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:45:16,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:45:16,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790532260] [2020-07-29 01:45:16,001 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:45:16,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:45:16,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:45:16,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:45:16,002 INFO L87 Difference]: Start difference. First operand 433 states and 657 transitions. cyclomatic complexity: 240 Second operand 3 states. [2020-07-29 01:45:16,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:16,155 INFO L93 Difference]: Finished difference Result 849 states and 1265 transitions. [2020-07-29 01:45:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:45:16,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:45:16,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:45:16,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 849 states and 1265 transitions. [2020-07-29 01:45:16,232 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2020-07-29 01:45:16,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 849 states to 849 states and 1265 transitions. [2020-07-29 01:45:16,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 849 [2020-07-29 01:45:16,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 849 [2020-07-29 01:45:16,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 849 states and 1265 transitions. [2020-07-29 01:45:16,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:45:16,287 INFO L688 BuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2020-07-29 01:45:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states and 1265 transitions. [2020-07-29 01:45:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2020-07-29 01:45:16,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:45:16,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 849 states and 1265 transitions. Second operand 849 states. [2020-07-29 01:45:16,307 INFO L74 IsIncluded]: Start isIncluded. First operand 849 states and 1265 transitions. Second operand 849 states. [2020-07-29 01:45:16,307 INFO L87 Difference]: Start difference. First operand 849 states and 1265 transitions. Second operand 849 states. [2020-07-29 01:45:16,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:16,358 INFO L93 Difference]: Finished difference Result 849 states and 1265 transitions. [2020-07-29 01:45:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1265 transitions. [2020-07-29 01:45:16,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:16,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:16,361 INFO L74 IsIncluded]: Start isIncluded. First operand 849 states. Second operand 849 states and 1265 transitions. [2020-07-29 01:45:16,361 INFO L87 Difference]: Start difference. First operand 849 states. Second operand 849 states and 1265 transitions. [2020-07-29 01:45:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:16,407 INFO L93 Difference]: Finished difference Result 849 states and 1265 transitions. [2020-07-29 01:45:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1265 transitions. [2020-07-29 01:45:16,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:16,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:16,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:45:16,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:45:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2020-07-29 01:45:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1265 transitions. [2020-07-29 01:45:16,456 INFO L711 BuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2020-07-29 01:45:16,456 INFO L591 BuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2020-07-29 01:45:16,456 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:45:16,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 849 states and 1265 transitions. [2020-07-29 01:45:16,464 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2020-07-29 01:45:16,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:45:16,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:45:16,465 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:45:16,465 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] [2020-07-29 01:45:16,465 INFO L794 eck$LassoCheckResult]: Stem: 4275#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_~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_~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;havoc main_~cond~0; 4276#L139-1 [2020-07-29 01:45:16,465 INFO L796 eck$LassoCheckResult]: Loop: 4276#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 4343#L38 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; 4336#L61 assume !(0 != main_~p1~0); 4328#L61-2 assume !(0 != main_~p2~0); 4323#L65-1 assume !(0 != main_~p3~0); 4316#L69-1 assume !(0 != main_~p4~0); 4309#L73-1 assume !(0 != main_~p5~0); 4310#L77-1 assume !(0 != main_~p6~0); 4388#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 4385#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4383#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4381#L93-1 assume !(0 != main_~p1~0); 4377#L99-1 assume !(0 != main_~p2~0); 4374#L104-1 assume !(0 != main_~p3~0); 4369#L109-1 assume !(0 != main_~p4~0); 4366#L114-1 assume !(0 != main_~p5~0); 4363#L119-1 assume !(0 != main_~p6~0); 4359#L124-1 assume !(0 != main_~p7~0); 4356#L129-1 assume !(0 != main_~p8~0); 4352#L134-1 assume !(0 != main_~p9~0); 4276#L139-1 [2020-07-29 01:45:16,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:16,466 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2020-07-29 01:45:16,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:16,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764599400] [2020-07-29 01:45:16,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:16,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:16,479 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:16,483 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:16,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:16,484 INFO L82 PathProgramCache]: Analyzing trace with hash 240335831, now seen corresponding path program 1 times [2020-07-29 01:45:16,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:16,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908504765] [2020-07-29 01:45:16,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:45:16,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {6787#true} assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; {6787#true} is VALID [2020-07-29 01:45:16,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {6787#true} 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; {6787#true} is VALID [2020-07-29 01:45:16,553 INFO L280 TraceCheckUtils]: 2: Hoare triple {6787#true} assume !(0 != main_~p1~0); {6787#true} is VALID [2020-07-29 01:45:16,553 INFO L280 TraceCheckUtils]: 3: Hoare triple {6787#true} assume !(0 != main_~p2~0); {6787#true} is VALID [2020-07-29 01:45:16,554 INFO L280 TraceCheckUtils]: 4: Hoare triple {6787#true} assume !(0 != main_~p3~0); {6787#true} is VALID [2020-07-29 01:45:16,554 INFO L280 TraceCheckUtils]: 5: Hoare triple {6787#true} assume !(0 != main_~p4~0); {6787#true} is VALID [2020-07-29 01:45:16,554 INFO L280 TraceCheckUtils]: 6: Hoare triple {6787#true} assume !(0 != main_~p5~0); {6787#true} is VALID [2020-07-29 01:45:16,555 INFO L280 TraceCheckUtils]: 7: Hoare triple {6787#true} assume !(0 != main_~p6~0); {6787#true} is VALID [2020-07-29 01:45:16,562 INFO L280 TraceCheckUtils]: 8: Hoare triple {6787#true} assume 0 != main_~p7~0;main_~lk7~0 := 1; {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:45:16,563 INFO L280 TraceCheckUtils]: 9: Hoare triple {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:45:16,563 INFO L280 TraceCheckUtils]: 10: Hoare triple {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:45:16,564 INFO L280 TraceCheckUtils]: 11: Hoare triple {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p1~0); {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:45:16,565 INFO L280 TraceCheckUtils]: 12: Hoare triple {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p2~0); {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:45:16,565 INFO L280 TraceCheckUtils]: 13: Hoare triple {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p3~0); {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:45:16,566 INFO L280 TraceCheckUtils]: 14: Hoare triple {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p4~0); {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:45:16,567 INFO L280 TraceCheckUtils]: 15: Hoare triple {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p5~0); {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:45:16,568 INFO L280 TraceCheckUtils]: 16: Hoare triple {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p6~0); {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:45:16,568 INFO L280 TraceCheckUtils]: 17: Hoare triple {6789#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p7~0); {6788#false} is VALID [2020-07-29 01:45:16,569 INFO L280 TraceCheckUtils]: 18: Hoare triple {6788#false} assume !(0 != main_~p8~0); {6788#false} is VALID [2020-07-29 01:45:16,569 INFO L280 TraceCheckUtils]: 19: Hoare triple {6788#false} assume !(0 != main_~p9~0); {6788#false} is VALID [2020-07-29 01:45:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:45:16,575 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908504765] [2020-07-29 01:45:16,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:45:16,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:45:16,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924177279] [2020-07-29 01:45:16,577 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:45:16,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:45:16,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:45:16,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:45:16,578 INFO L87 Difference]: Start difference. First operand 849 states and 1265 transitions. cyclomatic complexity: 448 Second operand 3 states. [2020-07-29 01:45:16,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:16,860 INFO L93 Difference]: Finished difference Result 1665 states and 2433 transitions. [2020-07-29 01:45:16,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:45:16,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:45:16,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:45:16,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1665 states and 2433 transitions. [2020-07-29 01:45:17,083 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2020-07-29 01:45:17,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1665 states to 1665 states and 2433 transitions. [2020-07-29 01:45:17,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1665 [2020-07-29 01:45:17,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1665 [2020-07-29 01:45:17,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1665 states and 2433 transitions. [2020-07-29 01:45:17,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:45:17,246 INFO L688 BuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2020-07-29 01:45:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states and 2433 transitions. [2020-07-29 01:45:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2020-07-29 01:45:17,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:45:17,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1665 states and 2433 transitions. Second operand 1665 states. [2020-07-29 01:45:17,291 INFO L74 IsIncluded]: Start isIncluded. First operand 1665 states and 2433 transitions. Second operand 1665 states. [2020-07-29 01:45:17,291 INFO L87 Difference]: Start difference. First operand 1665 states and 2433 transitions. Second operand 1665 states. [2020-07-29 01:45:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:17,443 INFO L93 Difference]: Finished difference Result 1665 states and 2433 transitions. [2020-07-29 01:45:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2433 transitions. [2020-07-29 01:45:17,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:17,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:17,448 INFO L74 IsIncluded]: Start isIncluded. First operand 1665 states. Second operand 1665 states and 2433 transitions. [2020-07-29 01:45:17,448 INFO L87 Difference]: Start difference. First operand 1665 states. Second operand 1665 states and 2433 transitions. [2020-07-29 01:45:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:17,613 INFO L93 Difference]: Finished difference Result 1665 states and 2433 transitions. [2020-07-29 01:45:17,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2433 transitions. [2020-07-29 01:45:17,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:17,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:17,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:45:17,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:45:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2020-07-29 01:45:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2433 transitions. [2020-07-29 01:45:17,765 INFO L711 BuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2020-07-29 01:45:17,765 INFO L591 BuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2020-07-29 01:45:17,765 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:45:17,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1665 states and 2433 transitions. [2020-07-29 01:45:17,795 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2020-07-29 01:45:17,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:45:17,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:45:17,797 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:45:17,797 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] [2020-07-29 01:45:17,797 INFO L794 eck$LassoCheckResult]: Stem: 8490#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_~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_~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;havoc main_~cond~0; 8491#L139-1 [2020-07-29 01:45:17,797 INFO L796 eck$LassoCheckResult]: Loop: 8491#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 8678#L38 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; 8676#L61 assume !(0 != main_~p1~0); 8674#L61-2 assume !(0 != main_~p2~0); 8673#L65-1 assume !(0 != main_~p3~0); 8670#L69-1 assume !(0 != main_~p4~0); 8666#L73-1 assume !(0 != main_~p5~0); 8662#L77-1 assume !(0 != main_~p6~0); 8663#L81-1 assume !(0 != main_~p7~0); 8641#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 8642#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8627#L93-1 assume !(0 != main_~p1~0); 8628#L99-1 assume !(0 != main_~p2~0); 8602#L104-1 assume !(0 != main_~p3~0); 8601#L109-1 assume !(0 != main_~p4~0); 8582#L114-1 assume !(0 != main_~p5~0); 8584#L119-1 assume !(0 != main_~p6~0); 8683#L124-1 assume !(0 != main_~p7~0); 8682#L129-1 assume !(0 != main_~p8~0); 8680#L134-1 assume !(0 != main_~p9~0); 8491#L139-1 [2020-07-29 01:45:17,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:17,798 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2020-07-29 01:45:17,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:17,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604514700] [2020-07-29 01:45:17,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:17,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:17,804 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:17,806 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:17,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:17,807 INFO L82 PathProgramCache]: Analyzing trace with hash 498501269, now seen corresponding path program 1 times [2020-07-29 01:45:17,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:17,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636331848] [2020-07-29 01:45:17,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:45:17,828 INFO L280 TraceCheckUtils]: 0: Hoare triple {13455#true} assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; {13455#true} is VALID [2020-07-29 01:45:17,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {13455#true} 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; {13455#true} is VALID [2020-07-29 01:45:17,829 INFO L280 TraceCheckUtils]: 2: Hoare triple {13455#true} assume !(0 != main_~p1~0); {13455#true} is VALID [2020-07-29 01:45:17,829 INFO L280 TraceCheckUtils]: 3: Hoare triple {13455#true} assume !(0 != main_~p2~0); {13455#true} is VALID [2020-07-29 01:45:17,829 INFO L280 TraceCheckUtils]: 4: Hoare triple {13455#true} assume !(0 != main_~p3~0); {13455#true} is VALID [2020-07-29 01:45:17,830 INFO L280 TraceCheckUtils]: 5: Hoare triple {13455#true} assume !(0 != main_~p4~0); {13455#true} is VALID [2020-07-29 01:45:17,830 INFO L280 TraceCheckUtils]: 6: Hoare triple {13455#true} assume !(0 != main_~p5~0); {13455#true} is VALID [2020-07-29 01:45:17,830 INFO L280 TraceCheckUtils]: 7: Hoare triple {13455#true} assume !(0 != main_~p6~0); {13455#true} is VALID [2020-07-29 01:45:17,830 INFO L280 TraceCheckUtils]: 8: Hoare triple {13455#true} assume !(0 != main_~p7~0); {13455#true} is VALID [2020-07-29 01:45:17,832 INFO L280 TraceCheckUtils]: 9: Hoare triple {13455#true} assume 0 != main_~p8~0;main_~lk8~0 := 1; {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:45:17,832 INFO L280 TraceCheckUtils]: 10: Hoare triple {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:45:17,833 INFO L280 TraceCheckUtils]: 11: Hoare triple {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p1~0); {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:45:17,834 INFO L280 TraceCheckUtils]: 12: Hoare triple {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p2~0); {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:45:17,835 INFO L280 TraceCheckUtils]: 13: Hoare triple {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p3~0); {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:45:17,835 INFO L280 TraceCheckUtils]: 14: Hoare triple {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p4~0); {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:45:17,836 INFO L280 TraceCheckUtils]: 15: Hoare triple {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p5~0); {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:45:17,836 INFO L280 TraceCheckUtils]: 16: Hoare triple {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p6~0); {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:45:17,837 INFO L280 TraceCheckUtils]: 17: Hoare triple {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p7~0); {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:45:17,838 INFO L280 TraceCheckUtils]: 18: Hoare triple {13457#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p8~0); {13456#false} is VALID [2020-07-29 01:45:17,838 INFO L280 TraceCheckUtils]: 19: Hoare triple {13456#false} assume !(0 != main_~p9~0); {13456#false} is VALID [2020-07-29 01:45:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:45:17,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636331848] [2020-07-29 01:45:17,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:45:17,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:45:17,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584704019] [2020-07-29 01:45:17,840 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:45:17,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:45:17,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:45:17,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:45:17,841 INFO L87 Difference]: Start difference. First operand 1665 states and 2433 transitions. cyclomatic complexity: 832 Second operand 3 states. [2020-07-29 01:45:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:18,417 INFO L93 Difference]: Finished difference Result 3265 states and 4673 transitions. [2020-07-29 01:45:18,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:45:18,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:45:18,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:45:18,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3265 states and 4673 transitions. [2020-07-29 01:45:18,962 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2020-07-29 01:45:19,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3265 states to 3265 states and 4673 transitions. [2020-07-29 01:45:19,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3265 [2020-07-29 01:45:19,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3265 [2020-07-29 01:45:19,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3265 states and 4673 transitions. [2020-07-29 01:45:19,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:45:19,451 INFO L688 BuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2020-07-29 01:45:19,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states and 4673 transitions. [2020-07-29 01:45:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3265. [2020-07-29 01:45:19,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:45:19,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3265 states and 4673 transitions. Second operand 3265 states. [2020-07-29 01:45:19,507 INFO L74 IsIncluded]: Start isIncluded. First operand 3265 states and 4673 transitions. Second operand 3265 states. [2020-07-29 01:45:19,507 INFO L87 Difference]: Start difference. First operand 3265 states and 4673 transitions. Second operand 3265 states. [2020-07-29 01:45:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:19,819 INFO L93 Difference]: Finished difference Result 3265 states and 4673 transitions. [2020-07-29 01:45:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3265 states and 4673 transitions. [2020-07-29 01:45:19,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:19,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:19,826 INFO L74 IsIncluded]: Start isIncluded. First operand 3265 states. Second operand 3265 states and 4673 transitions. [2020-07-29 01:45:19,826 INFO L87 Difference]: Start difference. First operand 3265 states. Second operand 3265 states and 4673 transitions. [2020-07-29 01:45:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:20,141 INFO L93 Difference]: Finished difference Result 3265 states and 4673 transitions. [2020-07-29 01:45:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3265 states and 4673 transitions. [2020-07-29 01:45:20,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:20,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:20,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:45:20,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:45:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3265 states. [2020-07-29 01:45:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3265 states to 3265 states and 4673 transitions. [2020-07-29 01:45:20,472 INFO L711 BuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2020-07-29 01:45:20,473 INFO L591 BuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2020-07-29 01:45:20,473 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:45:20,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3265 states and 4673 transitions. [2020-07-29 01:45:20,489 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2020-07-29 01:45:20,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:45:20,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:45:20,491 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:45:20,491 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] [2020-07-29 01:45:20,491 INFO L794 eck$LassoCheckResult]: Stem: 16763#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_~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_~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;havoc main_~cond~0; 16764#L139-1 [2020-07-29 01:45:20,491 INFO L796 eck$LassoCheckResult]: Loop: 16764#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 17024#L38 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; 17022#L61 assume !(0 != main_~p1~0); 17020#L61-2 assume !(0 != main_~p2~0); 17017#L65-1 assume !(0 != main_~p3~0); 17014#L69-1 assume !(0 != main_~p4~0); 17010#L73-1 assume !(0 != main_~p5~0); 17006#L77-1 assume !(0 != main_~p6~0); 17007#L81-1 assume !(0 != main_~p7~0); 16988#L85-1 assume !(0 != main_~p8~0); 16990#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 16974#L93-1 assume !(0 != main_~p1~0); 16976#L99-1 assume !(0 != main_~p2~0); 16932#L104-1 assume !(0 != main_~p3~0); 16931#L109-1 assume !(0 != main_~p4~0); 16915#L114-1 assume !(0 != main_~p5~0); 16917#L119-1 assume !(0 != main_~p6~0); 17030#L124-1 assume !(0 != main_~p7~0); 17028#L129-1 assume !(0 != main_~p8~0); 17027#L134-1 assume !(0 != main_~p9~0); 16764#L139-1 [2020-07-29 01:45:20,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:20,492 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2020-07-29 01:45:20,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:20,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131555137] [2020-07-29 01:45:20,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:20,504 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:20,506 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:20,508 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1199565847, now seen corresponding path program 1 times [2020-07-29 01:45:20,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:20,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894704301] [2020-07-29 01:45:20,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:45:20,538 INFO L280 TraceCheckUtils]: 0: Hoare triple {26523#true} assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; {26523#true} is VALID [2020-07-29 01:45:20,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {26523#true} 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; {26523#true} is VALID [2020-07-29 01:45:20,539 INFO L280 TraceCheckUtils]: 2: Hoare triple {26523#true} assume !(0 != main_~p1~0); {26523#true} is VALID [2020-07-29 01:45:20,539 INFO L280 TraceCheckUtils]: 3: Hoare triple {26523#true} assume !(0 != main_~p2~0); {26523#true} is VALID [2020-07-29 01:45:20,539 INFO L280 TraceCheckUtils]: 4: Hoare triple {26523#true} assume !(0 != main_~p3~0); {26523#true} is VALID [2020-07-29 01:45:20,540 INFO L280 TraceCheckUtils]: 5: Hoare triple {26523#true} assume !(0 != main_~p4~0); {26523#true} is VALID [2020-07-29 01:45:20,540 INFO L280 TraceCheckUtils]: 6: Hoare triple {26523#true} assume !(0 != main_~p5~0); {26523#true} is VALID [2020-07-29 01:45:20,540 INFO L280 TraceCheckUtils]: 7: Hoare triple {26523#true} assume !(0 != main_~p6~0); {26523#true} is VALID [2020-07-29 01:45:20,541 INFO L280 TraceCheckUtils]: 8: Hoare triple {26523#true} assume !(0 != main_~p7~0); {26523#true} is VALID [2020-07-29 01:45:20,541 INFO L280 TraceCheckUtils]: 9: Hoare triple {26523#true} assume !(0 != main_~p8~0); {26523#true} is VALID [2020-07-29 01:45:20,542 INFO L280 TraceCheckUtils]: 10: Hoare triple {26523#true} assume 0 != main_~p9~0;main_~lk9~0 := 1; {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:45:20,542 INFO L280 TraceCheckUtils]: 11: Hoare triple {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p1~0); {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:45:20,543 INFO L280 TraceCheckUtils]: 12: Hoare triple {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p2~0); {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:45:20,544 INFO L280 TraceCheckUtils]: 13: Hoare triple {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p3~0); {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:45:20,545 INFO L280 TraceCheckUtils]: 14: Hoare triple {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p4~0); {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:45:20,546 INFO L280 TraceCheckUtils]: 15: Hoare triple {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p5~0); {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:45:20,547 INFO L280 TraceCheckUtils]: 16: Hoare triple {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p6~0); {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:45:20,548 INFO L280 TraceCheckUtils]: 17: Hoare triple {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p7~0); {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:45:20,548 INFO L280 TraceCheckUtils]: 18: Hoare triple {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p8~0); {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:45:20,549 INFO L280 TraceCheckUtils]: 19: Hoare triple {26525#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p9~0); {26524#false} is VALID [2020-07-29 01:45:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:45:20,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894704301] [2020-07-29 01:45:20,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:45:20,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:45:20,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302543037] [2020-07-29 01:45:20,552 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:45:20,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:45:20,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:45:20,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:45:20,552 INFO L87 Difference]: Start difference. First operand 3265 states and 4673 transitions. cyclomatic complexity: 1536 Second operand 3 states. [2020-07-29 01:45:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:21,784 INFO L93 Difference]: Finished difference Result 6401 states and 8961 transitions. [2020-07-29 01:45:21,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:45:21,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:45:21,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:45:21,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6401 states and 8961 transitions. [2020-07-29 01:45:22,996 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2020-07-29 01:45:24,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6401 states to 6401 states and 8961 transitions. [2020-07-29 01:45:24,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6401 [2020-07-29 01:45:24,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6401 [2020-07-29 01:45:24,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6401 states and 8961 transitions. [2020-07-29 01:45:24,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:45:24,284 INFO L688 BuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2020-07-29 01:45:24,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6401 states and 8961 transitions. [2020-07-29 01:45:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6401 to 6401. [2020-07-29 01:45:24,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:45:24,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6401 states and 8961 transitions. Second operand 6401 states. [2020-07-29 01:45:24,391 INFO L74 IsIncluded]: Start isIncluded. First operand 6401 states and 8961 transitions. Second operand 6401 states. [2020-07-29 01:45:24,391 INFO L87 Difference]: Start difference. First operand 6401 states and 8961 transitions. Second operand 6401 states. [2020-07-29 01:45:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:25,838 INFO L93 Difference]: Finished difference Result 6401 states and 8961 transitions. [2020-07-29 01:45:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 6401 states and 8961 transitions. [2020-07-29 01:45:25,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:25,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:25,851 INFO L74 IsIncluded]: Start isIncluded. First operand 6401 states. Second operand 6401 states and 8961 transitions. [2020-07-29 01:45:25,851 INFO L87 Difference]: Start difference. First operand 6401 states. Second operand 6401 states and 8961 transitions. [2020-07-29 01:45:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:27,029 INFO L93 Difference]: Finished difference Result 6401 states and 8961 transitions. [2020-07-29 01:45:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 6401 states and 8961 transitions. [2020-07-29 01:45:27,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:27,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:27,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:45:27,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:45:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6401 states. [2020-07-29 01:45:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6401 states to 6401 states and 8961 transitions. [2020-07-29 01:45:28,308 INFO L711 BuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2020-07-29 01:45:28,308 INFO L591 BuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2020-07-29 01:45:28,308 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:45:28,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6401 states and 8961 transitions. [2020-07-29 01:45:28,328 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2020-07-29 01:45:28,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:45:28,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:45:28,330 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:45:28,330 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] [2020-07-29 01:45:28,330 INFO L794 eck$LassoCheckResult]: Stem: 32969#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_~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_~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;havoc main_~cond~0; 32970#L139-1 [2020-07-29 01:45:28,330 INFO L796 eck$LassoCheckResult]: Loop: 32970#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 33307#L38 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; 33305#L61 assume !(0 != main_~p1~0); 33303#L61-2 assume !(0 != main_~p2~0); 33302#L65-1 assume !(0 != main_~p3~0); 33300#L69-1 assume !(0 != main_~p4~0); 33298#L73-1 assume !(0 != main_~p5~0); 33297#L77-1 assume !(0 != main_~p6~0); 33295#L81-1 assume !(0 != main_~p7~0); 33291#L85-1 assume !(0 != main_~p8~0); 33288#L89-1 assume !(0 != main_~p9~0); 33289#L93-1 assume !(0 != main_~p1~0); 33256#L99-1 assume !(0 != main_~p2~0); 33258#L104-1 assume !(0 != main_~p3~0); 33219#L109-1 assume !(0 != main_~p4~0); 33220#L114-1 assume !(0 != main_~p5~0); 33170#L119-1 assume !(0 != main_~p6~0); 33171#L124-1 assume !(0 != main_~p7~0); 33142#L129-1 assume !(0 != main_~p8~0); 33144#L134-1 assume !(0 != main_~p9~0); 32970#L139-1 [2020-07-29 01:45:28,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:28,331 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2020-07-29 01:45:28,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:28,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034410018] [2020-07-29 01:45:28,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:28,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:28,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:28,348 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:28,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:28,350 INFO L82 PathProgramCache]: Analyzing trace with hash 806538837, now seen corresponding path program 1 times [2020-07-29 01:45:28,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:28,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669768283] [2020-07-29 01:45:28,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:28,360 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:28,368 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:28,375 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:28,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:28,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1231517452, now seen corresponding path program 1 times [2020-07-29 01:45:28,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:28,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42013281] [2020-07-29 01:45:28,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:28,392 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:28,400 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:28,406 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:28,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:45:28 BoogieIcfgContainer [2020-07-29 01:45:28,724 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:45:28,725 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:45:28,725 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:45:28,725 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:45:28,726 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:45:14" (3/4) ... [2020-07-29 01:45:28,729 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 01:45:28,800 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:45:28,801 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:45:28,808 INFO L168 Benchmark]: Toolchain (without parser) took 15653.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 956.2 MB in the beginning and 855.6 MB in the end (delta: 100.6 MB). Peak memory consumption was 303.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:45:28,809 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:45:28,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.33 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:45:28,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:45:28,810 INFO L168 Benchmark]: Boogie Preprocessor took 30.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:45:28,811 INFO L168 Benchmark]: RCFGBuilder took 532.11 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:45:28,812 INFO L168 Benchmark]: BuchiAutomizer took 14544.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 855.6 MB in the end (delta: 240.3 MB). Peak memory consumption was 311.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:45:28,812 INFO L168 Benchmark]: Witness Printer took 76.30 ms. Allocated memory is still 1.2 GB. Free memory is still 855.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:45:28,817 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.33 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 532.11 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14544.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 855.6 MB in the end (delta: 240.3 MB). Peak memory consumption was 311.6 MB. Max. memory is 11.5 GB. * Witness Printer took 76.30 ms. Allocated memory is still 1.2 GB. Free memory is still 855.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 6401 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.4s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 2.9s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 5.9s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 3.9s Buchi closure took 0.0s. Biggest automaton had 6401 states and ocurred in iteration 8. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 575 SDtfs, 301 SDslu, 348 SDs, 0 SdLazy, 40 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI8 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: 36]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28237ee0=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b166f86=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5681bc83=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@427fb009=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b050260=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12c9e07f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17636bfd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ebef1af=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22277e49=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@675c4e7d=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: 36]: 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; [L34] int cond; Loop: [L36] COND TRUE 1 [L37] cond = __VERIFIER_nondet_int() [L38] COND FALSE !(cond == 0) [L41] lk1 = 0 [L43] lk2 = 0 [L45] lk3 = 0 [L47] lk4 = 0 [L49] lk5 = 0 [L51] lk6 = 0 [L53] lk7 = 0 [L55] lk8 = 0 [L57] lk9 = 0 [L61] COND FALSE !(p1 != 0) [L65] COND FALSE !(p2 != 0) [L69] COND FALSE !(p3 != 0) [L73] COND FALSE !(p4 != 0) [L77] COND FALSE !(p5 != 0) [L81] COND FALSE !(p6 != 0) [L85] COND FALSE !(p7 != 0) [L89] COND FALSE !(p8 != 0) [L93] COND FALSE !(p9 != 0) [L99] COND FALSE !(p1 != 0) [L104] COND FALSE !(p2 != 0) [L109] COND FALSE !(p3 != 0) [L114] COND FALSE !(p4 != 0) [L119] COND FALSE !(p5 != 0) [L124] COND FALSE !(p6 != 0) [L129] COND FALSE !(p7 != 0) [L134] COND FALSE !(p8 != 0) [L139] COND FALSE !(p9 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...