/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 17:19:29,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 17:19:29,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 17:19:29,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 17:19:29,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 17:19:29,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 17:19:29,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 17:19:29,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 17:19:29,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 17:19:29,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 17:19:29,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 17:19:29,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 17:19:29,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 17:19:29,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 17:19:29,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 17:19:29,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 17:19:29,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 17:19:29,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 17:19:29,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 17:19:29,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 17:19:29,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 17:19:29,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 17:19:29,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 17:19:29,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 17:19:29,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 17:19:29,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 17:19:29,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 17:19:29,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 17:19:29,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 17:19:29,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 17:19:29,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 17:19:29,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 17:19:29,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 17:19:29,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 17:19:29,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 17:19:29,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 17:19:29,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 17:19:29,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 17:19:29,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 17:19:29,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 17:19:29,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 17:19:29,714 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 17:19:29,744 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 17:19:29,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 17:19:29,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 17:19:29,750 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 17:19:29,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 17:19:29,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 17:19:29,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 17:19:29,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 17:19:29,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 17:19:29,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 17:19:29,751 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 17:19:29,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 17:19:29,754 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 17:19:29,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 17:19:29,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 17:19:29,755 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 17:19:29,755 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 17:19:29,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 17:19:29,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:19:29,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 17:19:29,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 17:19:29,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 17:19:29,757 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-17 17:19:30,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 17:19:30,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 17:19:30,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 17:19:30,116 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 17:19:30,117 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 17:19:30,118 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2020-07-17 17:19:30,205 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff2004fe/7412a71ddc234e488a5aa6745cbc4e69/FLAGfcfd6ee8b [2020-07-17 17:19:30,700 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 17:19:30,700 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2020-07-17 17:19:30,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff2004fe/7412a71ddc234e488a5aa6745cbc4e69/FLAGfcfd6ee8b [2020-07-17 17:19:31,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff2004fe/7412a71ddc234e488a5aa6745cbc4e69 [2020-07-17 17:19:31,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 17:19:31,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 17:19:31,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 17:19:31,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 17:19:31,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 17:19:31,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:19:31" (1/1) ... [2020-07-17 17:19:31,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b09f6d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:19:31, skipping insertion in model container [2020-07-17 17:19:31,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:19:31" (1/1) ... [2020-07-17 17:19:31,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 17:19:31,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 17:19:31,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:19:31,441 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 17:19:31,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:19:31,473 INFO L208 MainTranslator]: Completed translation [2020-07-17 17:19:31,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:19:31 WrapperNode [2020-07-17 17:19:31,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 17:19:31,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 17:19:31,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 17:19:31,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 17:19:31,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:19:31" (1/1) ... [2020-07-17 17:19:31,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:19:31" (1/1) ... [2020-07-17 17:19:31,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:19:31" (1/1) ... [2020-07-17 17:19:31,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:19:31" (1/1) ... [2020-07-17 17:19:31,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:19:31" (1/1) ... [2020-07-17 17:19:31,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:19:31" (1/1) ... [2020-07-17 17:19:31,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:19:31" (1/1) ... [2020-07-17 17:19:31,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 17:19:31,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 17:19:31,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 17:19:31,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 17:19:31,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:19:31" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:19:31,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 17:19:31,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 17:19:31,657 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-17 17:19:31,657 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-17 17:19:31,657 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 17:19:31,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 17:19:31,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 17:19:31,657 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-17 17:19:31,657 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-17 17:19:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 17:19:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 17:19:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 17:19:31,888 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 17:19:31,888 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 17:19:31,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:19:31 BoogieIcfgContainer [2020-07-17 17:19:31,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 17:19:31,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 17:19:31,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 17:19:31,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 17:19:31,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 05:19:31" (1/3) ... [2020-07-17 17:19:31,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315e0e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:19:31, skipping insertion in model container [2020-07-17 17:19:31,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:19:31" (2/3) ... [2020-07-17 17:19:31,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315e0e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:19:31, skipping insertion in model container [2020-07-17 17:19:31,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:19:31" (3/3) ... [2020-07-17 17:19:31,903 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-1.c [2020-07-17 17:19:31,915 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 17:19:31,925 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 17:19:31,947 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 17:19:31,979 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 17:19:31,979 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 17:19:31,979 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-17 17:19:31,980 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 17:19:31,980 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 17:19:31,980 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 17:19:31,980 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 17:19:31,981 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 17:19:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-17 17:19:32,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 17:19:32,015 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:32,016 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:32,017 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:32,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:32,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-07-17 17:19:32,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:32,038 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1118705882] [2020-07-17 17:19:32,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:32,255 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-17 17:19:32,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1118705882] [2020-07-17 17:19:32,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:19:32,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:19:32,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897082058] [2020-07-17 17:19:32,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:19:32,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:32,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:19:32,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:19:32,287 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-07-17 17:19:32,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:32,469 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-17 17:19:32,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:19:32,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-17 17:19:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:32,494 INFO L225 Difference]: With dead ends: 58 [2020-07-17 17:19:32,495 INFO L226 Difference]: Without dead ends: 42 [2020-07-17 17:19:32,503 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:19:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-17 17:19:32,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-17 17:19:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 17:19:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-17 17:19:32,602 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-07-17 17:19:32,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:32,603 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-17 17:19:32,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:19:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-17 17:19:32,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 17:19:32,609 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:32,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:32,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 17:19:32,612 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:32,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:32,613 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-07-17 17:19:32,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:32,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [315845275] [2020-07-17 17:19:32,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:32,708 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-17 17:19:32,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [315845275] [2020-07-17 17:19:32,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:19:32,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:19:32,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225687251] [2020-07-17 17:19:32,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:19:32,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:32,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:19:32,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:19:32,713 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-07-17 17:19:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:32,790 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-17 17:19:32,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:19:32,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-17 17:19:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:32,793 INFO L225 Difference]: With dead ends: 50 [2020-07-17 17:19:32,793 INFO L226 Difference]: Without dead ends: 44 [2020-07-17 17:19:32,795 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:19:32,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-17 17:19:32,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-17 17:19:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 17:19:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-17 17:19:32,808 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-07-17 17:19:32,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:32,809 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-17 17:19:32,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:19:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-17 17:19:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 17:19:32,811 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:32,811 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:32,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 17:19:32,812 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:32,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:32,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-07-17 17:19:32,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:32,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1042495799] [2020-07-17 17:19:32,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 17:19:32,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1042495799] [2020-07-17 17:19:32,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:32,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:19:32,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747749919] [2020-07-17 17:19:32,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:19:32,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:32,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:19:32,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:19:32,971 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-07-17 17:19:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:33,067 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-07-17 17:19:33,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 17:19:33,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-17 17:19:33,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:33,070 INFO L225 Difference]: With dead ends: 82 [2020-07-17 17:19:33,070 INFO L226 Difference]: Without dead ends: 46 [2020-07-17 17:19:33,072 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:19:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-17 17:19:33,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-07-17 17:19:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-17 17:19:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-07-17 17:19:33,087 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-07-17 17:19:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:33,087 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-07-17 17:19:33,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:19:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-17 17:19:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 17:19:33,090 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:33,090 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:33,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 17:19:33,091 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:33,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:33,092 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-07-17 17:19:33,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:33,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1901464884] [2020-07-17 17:19:33,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 17:19:33,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1901464884] [2020-07-17 17:19:33,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:33,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:19:33,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676914031] [2020-07-17 17:19:33,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:19:33,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:33,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:19:33,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:19:33,226 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-07-17 17:19:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:33,401 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-07-17 17:19:33,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 17:19:33,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-07-17 17:19:33,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:33,404 INFO L225 Difference]: With dead ends: 74 [2020-07-17 17:19:33,405 INFO L226 Difference]: Without dead ends: 68 [2020-07-17 17:19:33,406 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-17 17:19:33,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-17 17:19:33,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-07-17 17:19:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-17 17:19:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-07-17 17:19:33,426 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-07-17 17:19:33,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:33,427 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-07-17 17:19:33,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:19:33,427 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-07-17 17:19:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-17 17:19:33,430 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:33,430 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:33,430 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 17:19:33,431 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:33,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:33,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-07-17 17:19:33,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:33,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1199634943] [2020-07-17 17:19:33,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-17 17:19:33,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1199634943] [2020-07-17 17:19:33,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:33,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 17:19:33,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883009246] [2020-07-17 17:19:33,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 17:19:33,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:33,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 17:19:33,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:19:33,549 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-07-17 17:19:33,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:33,631 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-07-17 17:19:33,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 17:19:33,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-07-17 17:19:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:33,634 INFO L225 Difference]: With dead ends: 130 [2020-07-17 17:19:33,635 INFO L226 Difference]: Without dead ends: 70 [2020-07-17 17:19:33,636 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:19:33,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-17 17:19:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-17 17:19:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-17 17:19:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-07-17 17:19:33,652 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-07-17 17:19:33,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:33,653 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-07-17 17:19:33,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 17:19:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-07-17 17:19:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-17 17:19:33,656 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:33,656 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:33,656 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 17:19:33,657 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:33,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:33,657 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-07-17 17:19:33,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:33,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [415433229] [2020-07-17 17:19:33,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-17 17:19:33,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [415433229] [2020-07-17 17:19:33,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:33,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:19:33,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866732313] [2020-07-17 17:19:33,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:19:33,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:33,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:19:33,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:19:33,801 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-07-17 17:19:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:33,927 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-07-17 17:19:33,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 17:19:33,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-17 17:19:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:33,931 INFO L225 Difference]: With dead ends: 142 [2020-07-17 17:19:33,931 INFO L226 Difference]: Without dead ends: 78 [2020-07-17 17:19:33,933 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:19:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-17 17:19:33,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-07-17 17:19:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-17 17:19:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-07-17 17:19:33,952 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-07-17 17:19:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:33,952 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-07-17 17:19:33,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:19:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-07-17 17:19:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-17 17:19:33,956 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:33,956 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:33,956 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 17:19:33,957 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:33,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:33,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-07-17 17:19:33,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:33,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1481579663] [2020-07-17 17:19:33,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-17 17:19:34,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1481579663] [2020-07-17 17:19:34,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:34,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:19:34,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119421630] [2020-07-17 17:19:34,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:19:34,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:34,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:19:34,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:19:34,087 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-07-17 17:19:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:34,282 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-07-17 17:19:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 17:19:34,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-07-17 17:19:34,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:34,285 INFO L225 Difference]: With dead ends: 118 [2020-07-17 17:19:34,286 INFO L226 Difference]: Without dead ends: 112 [2020-07-17 17:19:34,286 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:19:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-17 17:19:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-07-17 17:19:34,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-17 17:19:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-07-17 17:19:34,311 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-07-17 17:19:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:34,311 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-07-17 17:19:34,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:19:34,312 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-07-17 17:19:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-17 17:19:34,315 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:34,315 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:34,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 17:19:34,316 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:34,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:34,316 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-07-17 17:19:34,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:34,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1104399205] [2020-07-17 17:19:34,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-17 17:19:34,473 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1104399205] [2020-07-17 17:19:34,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:34,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:19:34,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037550267] [2020-07-17 17:19:34,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:19:34,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:34,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:19:34,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:19:34,476 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-07-17 17:19:34,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:34,619 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-07-17 17:19:34,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 17:19:34,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-07-17 17:19:34,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:34,622 INFO L225 Difference]: With dead ends: 227 [2020-07-17 17:19:34,623 INFO L226 Difference]: Without dead ends: 127 [2020-07-17 17:19:34,624 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:19:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-17 17:19:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-07-17 17:19:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-07-17 17:19:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-07-17 17:19:34,648 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-07-17 17:19:34,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:34,648 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-07-17 17:19:34,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:19:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-07-17 17:19:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-07-17 17:19:34,651 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:34,651 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:34,651 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 17:19:34,651 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:34,652 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-07-17 17:19:34,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:34,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [420524642] [2020-07-17 17:19:34,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-17 17:19:34,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [420524642] [2020-07-17 17:19:34,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:34,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:19:34,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524972283] [2020-07-17 17:19:34,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:19:34,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:34,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:19:34,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:19:34,831 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-07-17 17:19:35,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:35,078 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-07-17 17:19:35,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 17:19:35,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-07-17 17:19:35,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:35,082 INFO L225 Difference]: With dead ends: 257 [2020-07-17 17:19:35,082 INFO L226 Difference]: Without dead ends: 151 [2020-07-17 17:19:35,084 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:19:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-07-17 17:19:35,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-07-17 17:19:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-07-17 17:19:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-07-17 17:19:35,107 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-07-17 17:19:35,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:35,107 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-07-17 17:19:35,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:19:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-07-17 17:19:35,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-07-17 17:19:35,110 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:35,110 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:35,110 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 17:19:35,111 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:35,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:35,111 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-07-17 17:19:35,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:35,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [205403425] [2020-07-17 17:19:35,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 59 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-07-17 17:19:35,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [205403425] [2020-07-17 17:19:35,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:35,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-17 17:19:35,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73407570] [2020-07-17 17:19:35,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 17:19:35,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 17:19:35,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:19:35,398 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-07-17 17:19:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:35,881 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-07-17 17:19:35,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 17:19:35,882 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-07-17 17:19:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:35,886 INFO L225 Difference]: With dead ends: 265 [2020-07-17 17:19:35,886 INFO L226 Difference]: Without dead ends: 116 [2020-07-17 17:19:35,888 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-17 17:19:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-17 17:19:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2020-07-17 17:19:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-17 17:19:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2020-07-17 17:19:35,905 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 105 [2020-07-17 17:19:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:35,905 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2020-07-17 17:19:35,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 17:19:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2020-07-17 17:19:35,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-17 17:19:35,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:35,908 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:35,908 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 17:19:35,908 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:35,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:35,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1534580400, now seen corresponding path program 1 times [2020-07-17 17:19:35,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:35,909 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [649416755] [2020-07-17 17:19:35,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 50 proven. 67 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2020-07-17 17:19:36,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [649416755] [2020-07-17 17:19:36,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:36,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:19:36,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829997596] [2020-07-17 17:19:36,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:19:36,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:36,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:19:36,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:19:36,186 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 10 states. [2020-07-17 17:19:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:36,401 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2020-07-17 17:19:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 17:19:36,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-07-17 17:19:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:36,404 INFO L225 Difference]: With dead ends: 193 [2020-07-17 17:19:36,404 INFO L226 Difference]: Without dead ends: 105 [2020-07-17 17:19:36,406 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:19:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-17 17:19:36,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-07-17 17:19:36,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-17 17:19:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2020-07-17 17:19:36,422 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 123 [2020-07-17 17:19:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:36,423 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2020-07-17 17:19:36,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:19:36,423 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2020-07-17 17:19:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-07-17 17:19:36,425 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:36,425 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:36,426 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 17:19:36,426 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:36,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:36,426 INFO L82 PathProgramCache]: Analyzing trace with hash 822116120, now seen corresponding path program 2 times [2020-07-17 17:19:36,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:36,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1884691317] [2020-07-17 17:19:36,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 72 proven. 111 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2020-07-17 17:19:36,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1884691317] [2020-07-17 17:19:36,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:36,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-17 17:19:36,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167297271] [2020-07-17 17:19:36,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 17:19:36,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:36,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 17:19:36,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:19:36,748 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand 12 states. [2020-07-17 17:19:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:37,258 INFO L93 Difference]: Finished difference Result 241 states and 326 transitions. [2020-07-17 17:19:37,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-17 17:19:37,258 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2020-07-17 17:19:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:37,262 INFO L225 Difference]: With dead ends: 241 [2020-07-17 17:19:37,262 INFO L226 Difference]: Without dead ends: 141 [2020-07-17 17:19:37,264 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-17 17:19:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-07-17 17:19:37,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2020-07-17 17:19:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-17 17:19:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-07-17 17:19:37,288 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 140 [2020-07-17 17:19:37,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:37,288 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-07-17 17:19:37,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 17:19:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2020-07-17 17:19:37,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-07-17 17:19:37,293 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:37,293 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:37,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 17:19:37,293 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:37,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1260071360, now seen corresponding path program 2 times [2020-07-17 17:19:37,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:37,295 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [895286597] [2020-07-17 17:19:37,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 26 proven. 126 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2020-07-17 17:19:37,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [895286597] [2020-07-17 17:19:37,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:37,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:19:37,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637920963] [2020-07-17 17:19:37,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:19:37,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:37,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:19:37,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:19:37,583 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 10 states. [2020-07-17 17:19:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:37,860 INFO L93 Difference]: Finished difference Result 244 states and 326 transitions. [2020-07-17 17:19:37,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 17:19:37,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2020-07-17 17:19:37,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:37,865 INFO L225 Difference]: With dead ends: 244 [2020-07-17 17:19:37,865 INFO L226 Difference]: Without dead ends: 238 [2020-07-17 17:19:37,866 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-07-17 17:19:37,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-07-17 17:19:37,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 213. [2020-07-17 17:19:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-07-17 17:19:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 287 transitions. [2020-07-17 17:19:37,899 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 287 transitions. Word has length 140 [2020-07-17 17:19:37,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:37,900 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 287 transitions. [2020-07-17 17:19:37,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:19:37,900 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 287 transitions. [2020-07-17 17:19:37,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-07-17 17:19:37,904 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:37,904 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:37,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 17:19:37,905 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:37,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:37,905 INFO L82 PathProgramCache]: Analyzing trace with hash -88380307, now seen corresponding path program 3 times [2020-07-17 17:19:37,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:37,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [342416781] [2020-07-17 17:19:37,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 179 proven. 163 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2020-07-17 17:19:38,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [342416781] [2020-07-17 17:19:38,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:38,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-17 17:19:38,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711524255] [2020-07-17 17:19:38,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 17:19:38,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:38,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 17:19:38,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:19:38,365 INFO L87 Difference]: Start difference. First operand 213 states and 287 transitions. Second operand 14 states. [2020-07-17 17:19:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:38,847 INFO L93 Difference]: Finished difference Result 470 states and 677 transitions. [2020-07-17 17:19:38,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-17 17:19:38,848 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 193 [2020-07-17 17:19:38,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:38,854 INFO L225 Difference]: With dead ends: 470 [2020-07-17 17:19:38,854 INFO L226 Difference]: Without dead ends: 257 [2020-07-17 17:19:38,859 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2020-07-17 17:19:38,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-07-17 17:19:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 233. [2020-07-17 17:19:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-07-17 17:19:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 310 transitions. [2020-07-17 17:19:38,896 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 310 transitions. Word has length 193 [2020-07-17 17:19:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:38,897 INFO L479 AbstractCegarLoop]: Abstraction has 233 states and 310 transitions. [2020-07-17 17:19:38,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 17:19:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 310 transitions. [2020-07-17 17:19:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2020-07-17 17:19:38,906 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:38,906 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 17, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:38,907 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 17:19:38,907 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:38,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:38,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1293350858, now seen corresponding path program 4 times [2020-07-17 17:19:38,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:38,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1763025259] [2020-07-17 17:19:38,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2292 backedges. 199 proven. 672 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2020-07-17 17:19:39,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1763025259] [2020-07-17 17:19:39,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:39,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-17 17:19:39,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306969468] [2020-07-17 17:19:39,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 17:19:39,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:39,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 17:19:39,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:19:39,687 INFO L87 Difference]: Start difference. First operand 233 states and 310 transitions. Second operand 14 states. [2020-07-17 17:19:40,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:40,273 INFO L93 Difference]: Finished difference Result 534 states and 785 transitions. [2020-07-17 17:19:40,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-17 17:19:40,274 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 351 [2020-07-17 17:19:40,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:40,280 INFO L225 Difference]: With dead ends: 534 [2020-07-17 17:19:40,280 INFO L226 Difference]: Without dead ends: 301 [2020-07-17 17:19:40,284 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2020-07-17 17:19:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-07-17 17:19:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 265. [2020-07-17 17:19:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-07-17 17:19:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 352 transitions. [2020-07-17 17:19:40,320 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 352 transitions. Word has length 351 [2020-07-17 17:19:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:40,321 INFO L479 AbstractCegarLoop]: Abstraction has 265 states and 352 transitions. [2020-07-17 17:19:40,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 17:19:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 352 transitions. [2020-07-17 17:19:40,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-07-17 17:19:40,326 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:40,326 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:40,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 17:19:40,327 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:40,327 INFO L82 PathProgramCache]: Analyzing trace with hash -2113087688, now seen corresponding path program 5 times [2020-07-17 17:19:40,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:40,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [925880069] [2020-07-17 17:19:40,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 261 proven. 446 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2020-07-17 17:19:40,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [925880069] [2020-07-17 17:19:40,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:40,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-17 17:19:40,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378056918] [2020-07-17 17:19:40,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 17:19:40,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:40,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 17:19:40,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-07-17 17:19:40,919 INFO L87 Difference]: Start difference. First operand 265 states and 352 transitions. Second operand 16 states. [2020-07-17 17:19:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:41,648 INFO L93 Difference]: Finished difference Result 487 states and 692 transitions. [2020-07-17 17:19:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-07-17 17:19:41,649 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 281 [2020-07-17 17:19:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:41,654 INFO L225 Difference]: With dead ends: 487 [2020-07-17 17:19:41,654 INFO L226 Difference]: Without dead ends: 190 [2020-07-17 17:19:41,660 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2020-07-17 17:19:41,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-07-17 17:19:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2020-07-17 17:19:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-07-17 17:19:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 209 transitions. [2020-07-17 17:19:41,687 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 209 transitions. Word has length 281 [2020-07-17 17:19:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:41,688 INFO L479 AbstractCegarLoop]: Abstraction has 163 states and 209 transitions. [2020-07-17 17:19:41,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 17:19:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 209 transitions. [2020-07-17 17:19:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-07-17 17:19:41,692 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:41,692 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:41,693 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-17 17:19:41,693 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:41,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:41,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1117162661, now seen corresponding path program 6 times [2020-07-17 17:19:41,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:41,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [282034546] [2020-07-17 17:19:41,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2020-07-17 17:19:43,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [282034546] [2020-07-17 17:19:43,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:43,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-07-17 17:19:43,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398097601] [2020-07-17 17:19:43,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-07-17 17:19:43,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:43,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-07-17 17:19:43,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2020-07-17 17:19:43,161 INFO L87 Difference]: Start difference. First operand 163 states and 209 transitions. Second operand 28 states. [2020-07-17 17:19:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:44,382 INFO L93 Difference]: Finished difference Result 175 states and 223 transitions. [2020-07-17 17:19:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-07-17 17:19:44,383 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 228 [2020-07-17 17:19:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:44,386 INFO L225 Difference]: With dead ends: 175 [2020-07-17 17:19:44,386 INFO L226 Difference]: Without dead ends: 169 [2020-07-17 17:19:44,389 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=157, Invalid=2195, Unknown=0, NotChecked=0, Total=2352 [2020-07-17 17:19:44,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-07-17 17:19:44,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2020-07-17 17:19:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-07-17 17:19:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 208 transitions. [2020-07-17 17:19:44,409 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 208 transitions. Word has length 228 [2020-07-17 17:19:44,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:44,409 INFO L479 AbstractCegarLoop]: Abstraction has 163 states and 208 transitions. [2020-07-17 17:19:44,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-07-17 17:19:44,409 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 208 transitions. [2020-07-17 17:19:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2020-07-17 17:19:44,415 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:44,415 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 15, 14, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:44,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-17 17:19:44,415 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:44,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:44,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1755082522, now seen corresponding path program 7 times [2020-07-17 17:19:44,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:44,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1157190005] [2020-07-17 17:19:44,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2034 backedges. 232 proven. 385 refuted. 0 times theorem prover too weak. 1417 trivial. 0 not checked. [2020-07-17 17:19:45,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1157190005] [2020-07-17 17:19:45,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:45,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-17 17:19:45,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094849788] [2020-07-17 17:19:45,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 17:19:45,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:45,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 17:19:45,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:19:45,098 INFO L87 Difference]: Start difference. First operand 163 states and 208 transitions. Second operand 11 states. [2020-07-17 17:19:45,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:45,350 INFO L93 Difference]: Finished difference Result 316 states and 416 transitions. [2020-07-17 17:19:45,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 17:19:45,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 333 [2020-07-17 17:19:45,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:45,354 INFO L225 Difference]: With dead ends: 316 [2020-07-17 17:19:45,354 INFO L226 Difference]: Without dead ends: 162 [2020-07-17 17:19:45,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-07-17 17:19:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-07-17 17:19:45,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2020-07-17 17:19:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-17 17:19:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 201 transitions. [2020-07-17 17:19:45,379 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 201 transitions. Word has length 333 [2020-07-17 17:19:45,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:45,379 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 201 transitions. [2020-07-17 17:19:45,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 17:19:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 201 transitions. [2020-07-17 17:19:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-07-17 17:19:45,382 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:45,382 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 19, 19, 17, 16, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:45,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-17 17:19:45,383 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:45,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:45,383 INFO L82 PathProgramCache]: Analyzing trace with hash 120199642, now seen corresponding path program 8 times [2020-07-17 17:19:45,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:45,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1910225076] [2020-07-17 17:19:45,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 335 proven. 783 refuted. 0 times theorem prover too weak. 1434 trivial. 0 not checked. [2020-07-17 17:19:46,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1910225076] [2020-07-17 17:19:46,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:46,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-17 17:19:46,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079882561] [2020-07-17 17:19:46,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-17 17:19:46,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:46,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-17 17:19:46,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2020-07-17 17:19:46,368 INFO L87 Difference]: Start difference. First operand 159 states and 201 transitions. Second operand 17 states. [2020-07-17 17:19:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:47,066 INFO L93 Difference]: Finished difference Result 363 states and 511 transitions. [2020-07-17 17:19:47,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-07-17 17:19:47,069 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 369 [2020-07-17 17:19:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:47,073 INFO L225 Difference]: With dead ends: 363 [2020-07-17 17:19:47,074 INFO L226 Difference]: Without dead ends: 205 [2020-07-17 17:19:47,076 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2020-07-17 17:19:47,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-07-17 17:19:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 171. [2020-07-17 17:19:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-07-17 17:19:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 215 transitions. [2020-07-17 17:19:47,098 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 215 transitions. Word has length 369 [2020-07-17 17:19:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:47,098 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 215 transitions. [2020-07-17 17:19:47,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-17 17:19:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 215 transitions. [2020-07-17 17:19:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2020-07-17 17:19:47,101 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:47,102 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 18, 17, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:47,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-17 17:19:47,102 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:47,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:47,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1725201844, now seen corresponding path program 9 times [2020-07-17 17:19:47,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:47,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [836909959] [2020-07-17 17:19:47,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2808 backedges. 280 proven. 716 refuted. 0 times theorem prover too weak. 1812 trivial. 0 not checked. [2020-07-17 17:19:47,809 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [836909959] [2020-07-17 17:19:47,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:47,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-17 17:19:47,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331749857] [2020-07-17 17:19:47,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 17:19:47,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:47,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 17:19:47,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:19:47,811 INFO L87 Difference]: Start difference. First operand 171 states and 215 transitions. Second operand 14 states. [2020-07-17 17:19:48,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:48,314 INFO L93 Difference]: Finished difference Result 345 states and 448 transitions. [2020-07-17 17:19:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-17 17:19:48,315 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 387 [2020-07-17 17:19:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:48,318 INFO L225 Difference]: With dead ends: 345 [2020-07-17 17:19:48,318 INFO L226 Difference]: Without dead ends: 184 [2020-07-17 17:19:48,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2020-07-17 17:19:48,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-07-17 17:19:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 174. [2020-07-17 17:19:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-07-17 17:19:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 215 transitions. [2020-07-17 17:19:48,342 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 215 transitions. Word has length 387 [2020-07-17 17:19:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:48,342 INFO L479 AbstractCegarLoop]: Abstraction has 174 states and 215 transitions. [2020-07-17 17:19:48,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 17:19:48,343 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2020-07-17 17:19:48,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2020-07-17 17:19:48,345 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:48,345 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 14, 14, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:48,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-17 17:19:48,345 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:48,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:48,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1910459706, now seen corresponding path program 10 times [2020-07-17 17:19:48,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:48,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1128304164] [2020-07-17 17:19:48,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 174 proven. 436 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2020-07-17 17:19:48,927 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1128304164] [2020-07-17 17:19:48,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:48,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-17 17:19:48,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070657022] [2020-07-17 17:19:48,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 17:19:48,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:48,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 17:19:48,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:19:48,930 INFO L87 Difference]: Start difference. First operand 174 states and 215 transitions. Second operand 12 states. [2020-07-17 17:19:49,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:49,309 INFO L93 Difference]: Finished difference Result 201 states and 253 transitions. [2020-07-17 17:19:49,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 17:19:49,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 316 [2020-07-17 17:19:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:49,311 INFO L225 Difference]: With dead ends: 201 [2020-07-17 17:19:49,311 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 17:19:49,313 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2020-07-17 17:19:49,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 17:19:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 17:19:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 17:19:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 17:19:49,314 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 316 [2020-07-17 17:19:49,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:49,314 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 17:19:49,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 17:19:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 17:19:49,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 17:19:49,315 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-17 17:19:49,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 17:19:56,657 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 6 [2020-07-17 17:19:57,550 WARN L193 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 46 [2020-07-17 17:19:57,896 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 27 [2020-07-17 17:19:58,031 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 6 [2020-07-17 17:19:58,380 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 27 [2020-07-17 17:19:58,486 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 9 [2020-07-17 17:19:59,528 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 196 DAG size of output: 42 [2020-07-17 17:19:59,933 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 33 [2020-07-17 17:20:00,904 WARN L193 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 46 [2020-07-17 17:20:01,599 WARN L193 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 44 [2020-07-17 17:20:01,830 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 6 [2020-07-17 17:20:02,536 WARN L193 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 44 [2020-07-17 17:20:03,253 WARN L193 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 51 [2020-07-17 17:20:03,875 WARN L193 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 31 [2020-07-17 17:20:04,464 WARN L193 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 31 [2020-07-17 17:20:04,694 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 7 [2020-07-17 17:20:05,086 WARN L193 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 24 [2020-07-17 17:20:06,148 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 196 DAG size of output: 42 [2020-07-17 17:20:06,538 WARN L193 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 24 [2020-07-17 17:20:07,378 WARN L193 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 41 [2020-07-17 17:20:07,509 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 6 [2020-07-17 17:20:08,107 WARN L193 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 30 [2020-07-17 17:20:08,211 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:20:08,211 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:20:08,211 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:20:08,212 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 17:20:08,212 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 17:20:08,212 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:20:08,212 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-07-17 17:20:08,212 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-07-17 17:20:08,212 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 35 42) the Hoare annotation is: (<= 6 main_~x~0) [2020-07-17 17:20:08,213 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 35 42) the Hoare annotation is: (<= 6 main_~x~0) [2020-07-17 17:20:08,213 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-07-17 17:20:08,213 INFO L264 CegarLoopResult]: At program point L38(lines 38 40) the Hoare annotation is: (and (<= main_~x~0 6) (<= main_~result~0 8) (< 7 main_~result~0) (<= 6 main_~x~0)) [2020-07-17 17:20:08,214 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~x~0 6) (<= 6 main_~x~0)) [2020-07-17 17:20:08,214 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= main_~x~0 6) (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|) (<= 6 main_~x~0)) [2020-07-17 17:20:08,214 INFO L264 CegarLoopResult]: At program point L38-2(lines 38 40) the Hoare annotation is: (<= 6 main_~x~0) [2020-07-17 17:20:08,214 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= main_~x~0 6) (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|) (<= 6 main_~x~0)) [2020-07-17 17:20:08,214 INFO L264 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (and (<= main_~x~0 6) (<= main_~result~0 8) (<= |main_#t~ret4| 8) (< 7 main_~result~0) (<= 8 |main_#t~ret4|) (<= 6 main_~x~0)) [2020-07-17 17:20:08,215 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-07-17 17:20:08,215 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-17 17:20:08,215 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#t~ret2| 3) (<= 5 |fibo2_#in~n|) (<= 3 |fibo2_#t~ret2|) .cse0) (and (<= 6 fibo2_~n) .cse0) (and (<= |fibo2_#in~n| 2) (<= |fibo2_#t~ret2| 1) (<= 1 |fibo2_#t~ret2|) (< 1 fibo2_~n) .cse0) (and (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2) (<= fibo2_~n 4) .cse0 (<= 4 fibo2_~n)))) [2020-07-17 17:20:08,216 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (< 0 fibo2_~n) (<= |fibo2_#in~n| 1) (= fibo2_~n |fibo2_#in~n|)) [2020-07-17 17:20:08,216 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#t~ret2| 3) (<= 5 |fibo2_#in~n|) (<= 3 |fibo2_#t~ret2|) .cse0) (and (<= 6 fibo2_~n) .cse0) (and (<= |fibo2_#in~n| 2) (<= |fibo2_#t~ret2| 1) (<= 1 |fibo2_#t~ret2|) (< 1 fibo2_~n) .cse0) (and (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2) (<= fibo2_~n 4) .cse0 (<= 4 fibo2_~n)))) [2020-07-17 17:20:08,216 INFO L264 CegarLoopResult]: At program point L20(lines 20 24) the Hoare annotation is: (and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-17 17:20:08,217 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse3 (<= 4 fibo2_~n))) (let ((.cse6 (and (<= 2 |fibo2_#t~ret2|) (<= 3 .cse0) (<= |fibo2_#in~n| 4) (<= |fibo2_#t~ret2| 2) (<= .cse0 3) .cse3)) (.cse4 (<= |fibo2_#in~n| 3)) (.cse5 (<= 3 fibo2_~n))) (and (let ((.cse1 (<= |fibo2_#t~ret2| 1)) (.cse2 (<= 1 |fibo2_#t~ret2|))) (or (and (<= 1 .cse0) (<= |fibo2_#in~n| 2) .cse1 .cse2 (<= .cse0 1) (< 1 fibo2_~n)) (and (<= .cse0 5) (<= |fibo2_#t~ret2| 3) (<= 3 |fibo2_#t~ret2|) (<= 5 .cse0) .cse3) (and (<= 2 .cse0) .cse1 (<= .cse0 2) .cse4 .cse2 .cse5) (<= 6 fibo2_~n) .cse6)) (or (<= 5 |fibo2_#in~n|) (not (<= 3 |fibo2_#in~n|)) .cse6 (and .cse4 .cse5)) (= fibo2_~n |fibo2_#in~n|)))) [2020-07-17 17:20:08,217 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= |fibo2_#in~n| 0) (= fibo2_~n |fibo2_#in~n|)) [2020-07-17 17:20:08,217 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse3 (<= 4 fibo2_~n))) (let ((.cse6 (and (<= 2 |fibo2_#t~ret2|) (<= 3 .cse0) (<= |fibo2_#in~n| 4) (<= |fibo2_#t~ret2| 2) (<= .cse0 3) .cse3)) (.cse4 (<= |fibo2_#in~n| 3)) (.cse5 (<= 3 fibo2_~n))) (and (let ((.cse1 (<= |fibo2_#t~ret2| 1)) (.cse2 (<= 1 |fibo2_#t~ret2|))) (or (and (<= 1 .cse0) (<= |fibo2_#in~n| 2) .cse1 .cse2 (<= .cse0 1) (< 1 fibo2_~n)) (and (<= .cse0 5) (<= |fibo2_#t~ret2| 3) (<= 3 |fibo2_#t~ret2|) (<= 5 .cse0) .cse3) (and (<= 2 .cse0) .cse1 (<= .cse0 2) .cse4 .cse2 .cse5) (<= 6 fibo2_~n) .cse6)) (or (<= 5 |fibo2_#in~n|) (not (<= 3 |fibo2_#in~n|)) .cse6 (and .cse4 .cse5)) (= fibo2_~n |fibo2_#in~n|)))) [2020-07-17 17:20:08,217 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-07-17 17:20:08,218 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (and (let ((.cse1 (<= |fibo2_#t~ret2| 1)) (.cse2 (<= 1 |fibo2_#t~ret2|)) (.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|))) (or (and (<= |fibo2_#res| 5) (<= .cse0 5) (<= |fibo2_#t~ret2| 3) (<= 5 |fibo2_#in~n|) (<= 3 |fibo2_#t~ret2|) (<= 5 |fibo2_#res|) (<= 5 .cse0)) (and (<= 3 |fibo2_#res|) (<= 2 |fibo2_#t~ret2|) (<= 3 .cse0) (<= |fibo2_#res| 3) (<= |fibo2_#in~n| 4) (<= |fibo2_#t~ret2| 2) (<= .cse0 3) (<= 4 fibo2_~n)) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 2 .cse0) .cse1 (<= .cse0 2) (<= |fibo2_#in~n| 3) .cse2 (<= 3 fibo2_~n)) (<= 6 fibo2_~n) (and (<= 1 .cse0) (<= |fibo2_#in~n| 2) .cse1 (<= 1 |fibo2_#res|) .cse2 (<= .cse0 1) (<= |fibo2_#res| 1)))) (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-17 17:20:08,218 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3) (<= |fibo2_#in~n| 4) .cse0 (<= 4 fibo2_~n)) (and (<= |fibo2_#in~n| 2) (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (< 1 fibo2_~n) .cse0) (and (<= 6 fibo2_~n) .cse0) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= |fibo2_#in~n| 3) .cse0 (<= 3 fibo2_~n)) (and (<= |fibo2_#res| 5) (<= 5 |fibo2_#in~n|) (<= 5 |fibo2_#res|) .cse0))) [2020-07-17 17:20:08,218 INFO L264 CegarLoopResult]: At program point fibo2FINAL(lines 17 25) the Hoare annotation is: (let ((.cse4 (<= 1 |fibo2_#res|)) (.cse5 (<= |fibo2_#res| 1)) (.cse0 (<= |fibo2_#in~n| 4)) (.cse6 (<= 4 fibo2_~n))) (let ((.cse1 (and (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3) .cse0 .cse6)) (.cse2 (and (<= |fibo2_#in~n| 2) .cse4 .cse5 (< 1 fibo2_~n))) (.cse3 (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= |fibo2_#in~n| 3) (<= 3 fibo2_~n)))) (and (or (not .cse0) .cse1 .cse2 (not (<= 2 |fibo2_#in~n|)) .cse3) (or .cse1 .cse2 (and (<= |fibo2_#in~n| 1) .cse4 .cse5) (and (<= |fibo2_#res| 5) (<= 5 |fibo2_#res|) .cse6) (<= |fibo2_#in~n| 0) (<= 6 fibo2_~n) .cse3) (or (< 0 fibo2_~n) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))) (= fibo2_~n |fibo2_#in~n|)))) [2020-07-17 17:20:08,219 INFO L264 CegarLoopResult]: At program point fibo2EXIT(lines 17 25) the Hoare annotation is: (let ((.cse4 (<= 1 |fibo2_#res|)) (.cse5 (<= |fibo2_#res| 1)) (.cse0 (<= |fibo2_#in~n| 4)) (.cse6 (<= 4 fibo2_~n))) (let ((.cse1 (and (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3) .cse0 .cse6)) (.cse2 (and (<= |fibo2_#in~n| 2) .cse4 .cse5 (< 1 fibo2_~n))) (.cse3 (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= |fibo2_#in~n| 3) (<= 3 fibo2_~n)))) (and (or (not .cse0) .cse1 .cse2 (not (<= 2 |fibo2_#in~n|)) .cse3) (or .cse1 .cse2 (and (<= |fibo2_#in~n| 1) .cse4 .cse5) (and (<= |fibo2_#res| 5) (<= 5 |fibo2_#res|) .cse6) (<= |fibo2_#in~n| 0) (<= 6 fibo2_~n) .cse3) (or (< 0 fibo2_~n) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))) (= fibo2_~n |fibo2_#in~n|)))) [2020-07-17 17:20:08,219 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-07-17 17:20:08,219 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (= fibo1_~n |fibo1_#in~n|)) [2020-07-17 17:20:08,219 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 1 |fibo1_#t~ret0|) (<= 3 fibo1_~n) (<= |fibo1_#t~ret0| 1) .cse0 (<= |fibo1_#in~n| 3)) (and (<= 5 fibo1_~n) (<= |fibo1_#in~n| 5) .cse0) (and (<= |fibo1_#t~ret0| 5) (<= 5 |fibo1_#t~ret0|) (<= 6 fibo1_~n) .cse0) (and (<= 7 |fibo1_#in~n|) .cse0))) [2020-07-17 17:20:08,219 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-07-17 17:20:08,220 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 1 |fibo1_#t~ret0|) (<= 3 fibo1_~n) (<= |fibo1_#t~ret0| 1) .cse0 (<= |fibo1_#in~n| 3)) (and (<= 5 fibo1_~n) (<= |fibo1_#in~n| 5) .cse0) (and (<= |fibo1_#t~ret0| 5) (<= 5 |fibo1_#t~ret0|) (<= 6 fibo1_~n) .cse0) (and (<= 7 |fibo1_#in~n|) .cse0))) [2020-07-17 17:20:08,220 INFO L264 CegarLoopResult]: At program point fibo1FINAL(lines 7 15) the Hoare annotation is: (let ((.cse2 (= fibo1_~n |fibo1_#in~n|))) (let ((.cse1 (<= |fibo1_#in~n| 3)) (.cse0 (and (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) .cse2 (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1)))) (and (or (and (<= |fibo1_#res| 0) (<= 0 |fibo1_#res|)) (not (<= |fibo1_#in~n| 2)) .cse0) (or (not (<= |fibo1_#in~n| 4)) .cse1) (or (and (<= |fibo1_#in~n| 5) .cse2) (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8) .cse2) (and (<= 7 |fibo1_#in~n|) .cse2)) (or (not .cse1) .cse0 (and (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2)) (<= |fibo1_#in~n| 0))))) [2020-07-17 17:20:08,220 INFO L264 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-07-17 17:20:08,220 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 5 fibo1_~n) (or (<= |fibo1_#in~n| 5) (and (<= .cse0 8) (<= |fibo1_#t~ret0| 5) (<= 5 |fibo1_#t~ret0|) (<= 8 .cse0))) .cse1) (and (<= 1 |fibo1_#t~ret0|) (<= .cse0 2) (<= 3 |fibo1_#in~n|) (<= |fibo1_#t~ret0| 1) .cse1 (<= |fibo1_#in~n| 3) (<= 2 .cse0)) (and (<= 7 |fibo1_#in~n|) .cse1))) [2020-07-17 17:20:08,220 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (<= |fibo1_#in~n| 0)) [2020-07-17 17:20:08,221 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 5 fibo1_~n) (or (<= |fibo1_#in~n| 5) (and (<= .cse0 8) (<= |fibo1_#t~ret0| 5) (<= 5 |fibo1_#t~ret0|) (<= 8 .cse0))) .cse1) (and (<= 1 |fibo1_#t~ret0|) (<= .cse0 2) (<= 3 |fibo1_#in~n|) (<= |fibo1_#t~ret0| 1) .cse1 (<= |fibo1_#in~n| 3) (<= 2 .cse0)) (and (<= 7 |fibo1_#in~n|) .cse1))) [2020-07-17 17:20:08,221 INFO L264 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-07-17 17:20:08,221 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse0 (<= |fibo1_#in~n| 3)) (.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (.cse2 (= fibo1_~n |fibo1_#in~n|))) (and (or (not .cse0) (and (<= 1 |fibo1_#t~ret0|) (<= .cse1 2) (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2) (<= |fibo1_#t~ret0| 1) .cse2)) (not (<= |fibo1_#in~n| 2)) (or (and .cse0 (<= 2 .cse1)) (and (<= 7 |fibo1_#in~n|) .cse2) (and (<= 5 fibo1_~n) (or (<= |fibo1_#in~n| 5) (and (<= 8 |fibo1_#res|) (<= .cse1 8) (<= |fibo1_#t~ret0| 5) (<= 5 |fibo1_#t~ret0|) (<= |fibo1_#res| 8) (<= 8 .cse1))) .cse2)))) [2020-07-17 17:20:08,221 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 7 |fibo1_#in~n|) .cse0) (and (<= 5 fibo1_~n) .cse0 (or (<= |fibo1_#in~n| 5) (and (<= 8 |fibo1_#res|) (<= |fibo1_#t~ret0| 5) (<= 5 |fibo1_#t~ret0|) (<= |fibo1_#res| 8)))) (and (<= 1 |fibo1_#t~ret0|) (<= 3 |fibo1_#in~n|) (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2) (<= |fibo1_#t~ret0| 1) .cse0 (<= |fibo1_#in~n| 3)))) [2020-07-17 17:20:08,222 INFO L264 CegarLoopResult]: At program point fibo1EXIT(lines 7 15) the Hoare annotation is: (let ((.cse2 (= fibo1_~n |fibo1_#in~n|))) (let ((.cse1 (<= |fibo1_#in~n| 3)) (.cse0 (and (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) .cse2 (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1)))) (and (or (and (<= |fibo1_#res| 0) (<= 0 |fibo1_#res|)) (not (<= |fibo1_#in~n| 2)) .cse0) (or (not (<= |fibo1_#in~n| 4)) .cse1) (or (and (<= |fibo1_#in~n| 5) .cse2) (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8) .cse2) (and (<= 7 |fibo1_#in~n|) .cse2)) (or (not .cse1) .cse0 (and (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2)) (<= |fibo1_#in~n| 0))))) [2020-07-17 17:20:08,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 05:20:08 BoogieIcfgContainer [2020-07-17 17:20:08,246 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 17:20:08,247 INFO L168 Benchmark]: Toolchain (without parser) took 37035.92 ms. Allocated memory was 140.0 MB in the beginning and 888.1 MB in the end (delta: 748.2 MB). Free memory was 104.8 MB in the beginning and 364.9 MB in the end (delta: -260.1 MB). Peak memory consumption was 762.5 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:08,248 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 140.0 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 17:20:08,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.24 ms. Allocated memory is still 140.0 MB. Free memory was 104.3 MB in the beginning and 94.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:08,249 INFO L168 Benchmark]: Boogie Preprocessor took 120.97 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 94.8 MB in the beginning and 182.3 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:08,249 INFO L168 Benchmark]: RCFGBuilder took 299.01 ms. Allocated memory is still 203.4 MB. Free memory was 182.3 MB in the beginning and 167.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:08,250 INFO L168 Benchmark]: TraceAbstraction took 36350.10 ms. Allocated memory was 203.4 MB in the beginning and 888.1 MB in the end (delta: 684.7 MB). Free memory was 167.2 MB in the beginning and 364.9 MB in the end (delta: -197.7 MB). Peak memory consumption was 761.4 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:08,253 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 140.0 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 254.24 ms. Allocated memory is still 140.0 MB. Free memory was 104.3 MB in the beginning and 94.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.97 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 94.8 MB in the beginning and 182.3 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 299.01 ms. Allocated memory is still 203.4 MB. Free memory was 182.3 MB in the beginning and 167.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36350.10 ms. Allocated memory was 203.4 MB in the beginning and 888.1 MB in the end (delta: 684.7 MB). Free memory was 167.2 MB in the beginning and 364.9 MB in the end (delta: -197.7 MB). Peak memory consumption was 761.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 35]: Procedure Contract for main Derived contract for procedure main: 6 <= x - ProcedureContractResult [Line: 17]: Procedure Contract for fibo2 Derived contract for procedure fibo2: ((((((!(\old(n) <= 4) || (((3 <= \result && \result <= 3) && \old(n) <= 4) && 4 <= n)) || (((\old(n) <= 2 && 1 <= \result) && \result <= 1) && 1 < n)) || !(2 <= \old(n))) || (((\result <= 2 && 2 <= \result) && \old(n) <= 3) && 3 <= n)) && (((((((((3 <= \result && \result <= 3) && \old(n) <= 4) && 4 <= n) || (((\old(n) <= 2 && 1 <= \result) && \result <= 1) && 1 < n)) || ((\old(n) <= 1 && 1 <= \result) && \result <= 1)) || ((\result <= 5 && 5 <= \result) && 4 <= n)) || \old(n) <= 0) || 6 <= n) || (((\result <= 2 && 2 <= \result) && \old(n) <= 3) && 3 <= n))) && (0 < n || (\result <= 0 && 0 <= \result))) && n == \old(n) - ProcedureContractResult [Line: 7]: Procedure Contract for fibo1 Derived contract for procedure fibo1: (((((\result <= 0 && 0 <= \result) || !(\old(n) <= 2)) || ((((\old(n) <= 1 && 0 < n) && n == \old(n)) && 1 <= \result) && \result <= 1)) && (!(\old(n) <= 4) || \old(n) <= 3)) && (((\old(n) <= 5 && n == \old(n)) || ((8 <= \result && \result <= 8) && n == \old(n))) || (7 <= \old(n) && n == \old(n)))) && (((!(\old(n) <= 3) || ((((\old(n) <= 1 && 0 < n) && n == \old(n)) && 1 <= \result) && \result <= 1)) || (2 <= \result && \result <= 2)) || \old(n) <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 17.3s, OverallIterations: 21, TraceHistogramMax: 22, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1072 SDtfs, 1239 SDslu, 7522 SDs, 0 SdLazy, 5615 SolverSat, 522 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1184 GetRequests, 843 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 252 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 4301 PreInvPairs, 10789 NumberOfFragments, 1518 HoareAnnotationTreeSize, 4301 FomulaSimplifications, 467683 FormulaSimplificationTreeSizeReduction, 7.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 109451 FormulaSimplificationTreeSizeReductionInter, 11.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 3358 NumberOfCodeBlocks, 3358 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3337 ConstructedInterpolants, 0 QuantifiedInterpolants, 1471015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 2 PerfectInterpolantSequences, 11209/15555 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...