/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_8-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 17:20:08,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 17:20:08,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 17:20:08,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 17:20:08,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 17:20:08,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 17:20:08,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 17:20:08,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 17:20:08,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 17:20:08,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 17:20:08,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 17:20:08,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 17:20:08,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 17:20:08,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 17:20:08,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 17:20:08,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 17:20:08,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 17:20:08,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 17:20:08,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 17:20:08,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 17:20:08,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 17:20:08,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 17:20:08,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 17:20:08,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 17:20:08,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 17:20:08,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 17:20:08,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 17:20:08,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 17:20:08,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 17:20:08,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 17:20:08,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 17:20:08,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 17:20:08,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 17:20:08,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 17:20:08,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 17:20:08,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 17:20:08,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 17:20:08,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 17:20:08,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 17:20:08,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 17:20:08,198 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 17:20:08,199 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:20:08,208 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 17:20:08,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 17:20:08,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 17:20:08,209 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 17:20:08,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 17:20:08,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 17:20:08,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 17:20:08,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 17:20:08,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 17:20:08,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 17:20:08,211 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 17:20:08,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 17:20:08,211 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 17:20:08,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 17:20:08,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 17:20:08,212 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 17:20:08,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 17:20:08,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 17:20:08,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:20:08,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 17:20:08,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 17:20:08,213 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 17:20:08,213 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:20:08,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 17:20:08,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 17:20:08,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 17:20:08,552 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 17:20:08,552 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 17:20:08,553 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c [2020-07-17 17:20:08,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad414653/8229fffbe3c844ba9670304944da5b37/FLAGdfbdfa821 [2020-07-17 17:20:09,098 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 17:20:09,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c [2020-07-17 17:20:09,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad414653/8229fffbe3c844ba9670304944da5b37/FLAGdfbdfa821 [2020-07-17 17:20:09,474 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad414653/8229fffbe3c844ba9670304944da5b37 [2020-07-17 17:20:09,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 17:20:09,487 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 17:20:09,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 17:20:09,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 17:20:09,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 17:20:09,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:20:09" (1/1) ... [2020-07-17 17:20:09,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c276ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:09, skipping insertion in model container [2020-07-17 17:20:09,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:20:09" (1/1) ... [2020-07-17 17:20:09,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 17:20:09,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 17:20:09,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:20:09,723 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 17:20:09,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:20:09,756 INFO L208 MainTranslator]: Completed translation [2020-07-17 17:20:09,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:09 WrapperNode [2020-07-17 17:20:09,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 17:20:09,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 17:20:09,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 17:20:09,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 17:20:09,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:09" (1/1) ... [2020-07-17 17:20:09,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:09" (1/1) ... [2020-07-17 17:20:09,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:09" (1/1) ... [2020-07-17 17:20:09,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:09" (1/1) ... [2020-07-17 17:20:09,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:09" (1/1) ... [2020-07-17 17:20:09,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:09" (1/1) ... [2020-07-17 17:20:09,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:09" (1/1) ... [2020-07-17 17:20:09,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 17:20:09,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 17:20:09,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 17:20:09,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 17:20:09,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:09" (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:20:09,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 17:20:09,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 17:20:09,989 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-17 17:20:09,989 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-17 17:20:09,990 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 17:20:09,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 17:20:09,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 17:20:09,990 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-17 17:20:09,990 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-17 17:20:09,991 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 17:20:09,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 17:20:09,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 17:20:10,316 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 17:20:10,316 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 17:20:10,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:20:10 BoogieIcfgContainer [2020-07-17 17:20:10,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 17:20:10,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 17:20:10,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 17:20:10,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 17:20:10,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 05:20:09" (1/3) ... [2020-07-17 17:20:10,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9be456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:20:10, skipping insertion in model container [2020-07-17 17:20:10,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:09" (2/3) ... [2020-07-17 17:20:10,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9be456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:20:10, skipping insertion in model container [2020-07-17 17:20:10,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:20:10" (3/3) ... [2020-07-17 17:20:10,332 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2020-07-17 17:20:10,345 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 17:20:10,354 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 17:20:10,367 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 17:20:10,388 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 17:20:10,388 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 17:20:10,388 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-17 17:20:10,388 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 17:20:10,388 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 17:20:10,389 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 17:20:10,389 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 17:20:10,389 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 17:20:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-17 17:20:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 17:20:10,414 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:10,415 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:20:10,416 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:10,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:10,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-07-17 17:20:10,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:10,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2116052935] [2020-07-17 17:20:10,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:10,647 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:20:10,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2116052935] [2020-07-17 17:20:10,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:20:10,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:20:10,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406154382] [2020-07-17 17:20:10,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:20:10,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:10,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:20:10,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:20:10,669 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-07-17 17:20:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:10,781 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-17 17:20:10,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:20:10,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-17 17:20:10,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:10,794 INFO L225 Difference]: With dead ends: 58 [2020-07-17 17:20:10,794 INFO L226 Difference]: Without dead ends: 42 [2020-07-17 17:20:10,798 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:20:10,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-17 17:20:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-17 17:20:10,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 17:20:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-17 17:20:10,846 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-07-17 17:20:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:10,847 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-17 17:20:10,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:20:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-17 17:20:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 17:20:10,849 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:10,849 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:20:10,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 17:20:10,850 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:10,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:10,851 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-07-17 17:20:10,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:10,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [853730046] [2020-07-17 17:20:10,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:10,919 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:20:10,920 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [853730046] [2020-07-17 17:20:10,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:20:10,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:20:10,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503442632] [2020-07-17 17:20:10,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:20:10,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:10,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:20:10,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:20:10,924 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-07-17 17:20:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:10,991 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-17 17:20:10,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:20:10,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-17 17:20:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:10,994 INFO L225 Difference]: With dead ends: 50 [2020-07-17 17:20:10,994 INFO L226 Difference]: Without dead ends: 44 [2020-07-17 17:20:10,996 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:20:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-17 17:20:11,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-17 17:20:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 17:20:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-17 17:20:11,010 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-07-17 17:20:11,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:11,010 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-17 17:20:11,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:20:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-17 17:20:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 17:20:11,013 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:11,013 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:20:11,013 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 17:20:11,013 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:11,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:11,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-07-17 17:20:11,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:11,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2073114994] [2020-07-17 17:20:11,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,129 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:20:11,129 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2073114994] [2020-07-17 17:20:11,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:11,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:20:11,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652381510] [2020-07-17 17:20:11,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:20:11,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:11,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:20:11,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:20:11,132 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-07-17 17:20:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:11,219 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-07-17 17:20:11,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 17:20:11,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-17 17:20:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:11,221 INFO L225 Difference]: With dead ends: 82 [2020-07-17 17:20:11,222 INFO L226 Difference]: Without dead ends: 46 [2020-07-17 17:20:11,223 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:20:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-17 17:20:11,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-07-17 17:20:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-17 17:20:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-07-17 17:20:11,243 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-07-17 17:20:11,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:11,243 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-07-17 17:20:11,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:20:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-17 17:20:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 17:20:11,246 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:11,246 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:20:11,246 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 17:20:11,247 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:11,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-07-17 17:20:11,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:11,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [12177759] [2020-07-17 17:20:11,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,370 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:20:11,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [12177759] [2020-07-17 17:20:11,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:11,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:20:11,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645047468] [2020-07-17 17:20:11,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:20:11,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:11,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:20:11,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:20:11,373 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-07-17 17:20:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:11,570 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-07-17 17:20:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 17:20:11,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-07-17 17:20:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:11,573 INFO L225 Difference]: With dead ends: 74 [2020-07-17 17:20:11,574 INFO L226 Difference]: Without dead ends: 68 [2020-07-17 17:20:11,575 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:20:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-17 17:20:11,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-07-17 17:20:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-17 17:20:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-07-17 17:20:11,604 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-07-17 17:20:11,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:11,609 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-07-17 17:20:11,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:20:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-07-17 17:20:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-17 17:20:11,614 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:11,614 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:20:11,614 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 17:20:11,615 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:11,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:11,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-07-17 17:20:11,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:11,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1202560244] [2020-07-17 17:20:11,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,770 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:20:11,771 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1202560244] [2020-07-17 17:20:11,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:11,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 17:20:11,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721154651] [2020-07-17 17:20:11,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 17:20:11,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:11,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 17:20:11,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:20:11,773 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-07-17 17:20:11,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:11,850 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-07-17 17:20:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 17:20:11,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-07-17 17:20:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:11,852 INFO L225 Difference]: With dead ends: 130 [2020-07-17 17:20:11,853 INFO L226 Difference]: Without dead ends: 70 [2020-07-17 17:20:11,854 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:20:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-17 17:20:11,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-17 17:20:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-17 17:20:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-07-17 17:20:11,869 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-07-17 17:20:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:11,869 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-07-17 17:20:11,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 17:20:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-07-17 17:20:11,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-17 17:20:11,872 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:11,872 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:20:11,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 17:20:11,872 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:11,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:11,873 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-07-17 17:20:11,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:11,873 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1478263278] [2020-07-17 17:20:11,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,008 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:20:12,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1478263278] [2020-07-17 17:20:12,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:12,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:20:12,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820711250] [2020-07-17 17:20:12,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:20:12,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:12,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:20:12,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:20:12,011 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-07-17 17:20:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:12,116 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-07-17 17:20:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 17:20:12,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-17 17:20:12,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:12,121 INFO L225 Difference]: With dead ends: 142 [2020-07-17 17:20:12,121 INFO L226 Difference]: Without dead ends: 78 [2020-07-17 17:20:12,123 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:20:12,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-17 17:20:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-07-17 17:20:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-17 17:20:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-07-17 17:20:12,138 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-07-17 17:20:12,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:12,138 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-07-17 17:20:12,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:20:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-07-17 17:20:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-17 17:20:12,140 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:12,141 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:20:12,141 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 17:20:12,141 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:12,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:12,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-07-17 17:20:12,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:12,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [450648472] [2020-07-17 17:20:12,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,286 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:20:12,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [450648472] [2020-07-17 17:20:12,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:12,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:20:12,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352528541] [2020-07-17 17:20:12,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:20:12,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:12,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:20:12,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:20:12,290 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-07-17 17:20:12,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:12,600 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-07-17 17:20:12,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 17:20:12,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-07-17 17:20:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:12,604 INFO L225 Difference]: With dead ends: 118 [2020-07-17 17:20:12,604 INFO L226 Difference]: Without dead ends: 112 [2020-07-17 17:20:12,605 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:20:12,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-17 17:20:12,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-07-17 17:20:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-17 17:20:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-07-17 17:20:12,656 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-07-17 17:20:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:12,657 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-07-17 17:20:12,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:20:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-07-17 17:20:12,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-17 17:20:12,660 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:12,661 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:20:12,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 17:20:12,661 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:12,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:12,662 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-07-17 17:20:12,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:12,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1490763299] [2020-07-17 17:20:12,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,832 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:20:12,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1490763299] [2020-07-17 17:20:12,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:12,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:20:12,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842653200] [2020-07-17 17:20:12,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:20:12,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:12,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:20:12,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:20:12,837 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-07-17 17:20:12,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:12,986 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-07-17 17:20:12,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 17:20:12,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-07-17 17:20:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:12,990 INFO L225 Difference]: With dead ends: 227 [2020-07-17 17:20:12,990 INFO L226 Difference]: Without dead ends: 127 [2020-07-17 17:20:12,993 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:20:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-17 17:20:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-07-17 17:20:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-07-17 17:20:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-07-17 17:20:13,025 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-07-17 17:20:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:13,025 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-07-17 17:20:13,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:20:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-07-17 17:20:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-07-17 17:20:13,027 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:13,027 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:20:13,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 17:20:13,028 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:13,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:13,028 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-07-17 17:20:13,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:13,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2059321478] [2020-07-17 17:20:13,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,171 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:20:13,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2059321478] [2020-07-17 17:20:13,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:13,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:20:13,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770451060] [2020-07-17 17:20:13,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:20:13,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:13,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:20:13,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:20:13,174 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-07-17 17:20:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:13,383 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-07-17 17:20:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 17:20:13,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-07-17 17:20:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:13,387 INFO L225 Difference]: With dead ends: 257 [2020-07-17 17:20:13,387 INFO L226 Difference]: Without dead ends: 151 [2020-07-17 17:20:13,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:20:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-07-17 17:20:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-07-17 17:20:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-07-17 17:20:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-07-17 17:20:13,412 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-07-17 17:20:13,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:13,412 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-07-17 17:20:13,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:20:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-07-17 17:20:13,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-07-17 17:20:13,415 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:13,415 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:20:13,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 17:20:13,416 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:13,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:13,416 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-07-17 17:20:13,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:13,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1399398535] [2020-07-17 17:20:13,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,623 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:20:13,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1399398535] [2020-07-17 17:20:13,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:13,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-17 17:20:13,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762061152] [2020-07-17 17:20:13,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 17:20:13,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:13,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 17:20:13,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:20:13,626 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-07-17 17:20:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:14,016 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-07-17 17:20:14,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 17:20:14,017 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-07-17 17:20:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:14,020 INFO L225 Difference]: With dead ends: 265 [2020-07-17 17:20:14,021 INFO L226 Difference]: Without dead ends: 116 [2020-07-17 17:20:14,023 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-17 17:20:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-17 17:20:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2020-07-17 17:20:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-17 17:20:14,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2020-07-17 17:20:14,042 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 105 [2020-07-17 17:20:14,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:14,042 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2020-07-17 17:20:14,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 17:20:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2020-07-17 17:20:14,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-17 17:20:14,046 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:14,046 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:20:14,047 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 17:20:14,047 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:14,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:14,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1534580400, now seen corresponding path program 1 times [2020-07-17 17:20:14,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:14,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [732396420] [2020-07-17 17:20:14,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,282 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:20:14,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [732396420] [2020-07-17 17:20:14,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:14,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:20:14,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020386567] [2020-07-17 17:20:14,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:20:14,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:14,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:20:14,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:20:14,285 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 10 states. [2020-07-17 17:20:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:14,486 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2020-07-17 17:20:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 17:20:14,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-07-17 17:20:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:14,488 INFO L225 Difference]: With dead ends: 193 [2020-07-17 17:20:14,488 INFO L226 Difference]: Without dead ends: 105 [2020-07-17 17:20:14,490 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:20:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-17 17:20:14,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-07-17 17:20:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-17 17:20:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2020-07-17 17:20:14,503 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 123 [2020-07-17 17:20:14,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:14,503 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2020-07-17 17:20:14,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:20:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2020-07-17 17:20:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-07-17 17:20:14,505 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:14,506 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:20:14,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 17:20:14,506 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:14,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:14,506 INFO L82 PathProgramCache]: Analyzing trace with hash 822116120, now seen corresponding path program 2 times [2020-07-17 17:20:14,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:14,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [282652321] [2020-07-17 17:20:14,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,783 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:20:14,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [282652321] [2020-07-17 17:20:14,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:14,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-17 17:20:14,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164448835] [2020-07-17 17:20:14,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 17:20:14,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:14,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 17:20:14,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:20:14,786 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand 12 states. [2020-07-17 17:20:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:15,175 INFO L93 Difference]: Finished difference Result 241 states and 326 transitions. [2020-07-17 17:20:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-17 17:20:15,175 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2020-07-17 17:20:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:15,178 INFO L225 Difference]: With dead ends: 241 [2020-07-17 17:20:15,178 INFO L226 Difference]: Without dead ends: 141 [2020-07-17 17:20:15,179 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:20:15,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-07-17 17:20:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2020-07-17 17:20:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-17 17:20:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-07-17 17:20:15,195 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 140 [2020-07-17 17:20:15,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:15,196 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-07-17 17:20:15,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 17:20:15,196 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2020-07-17 17:20:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-07-17 17:20:15,198 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:15,198 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:20:15,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 17:20:15,199 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:15,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1260071360, now seen corresponding path program 2 times [2020-07-17 17:20:15,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:15,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1932521709] [2020-07-17 17:20:15,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,400 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:20:15,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1932521709] [2020-07-17 17:20:15,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:15,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:20:15,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366062614] [2020-07-17 17:20:15,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:20:15,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:15,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:20:15,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:20:15,405 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 10 states. [2020-07-17 17:20:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:15,654 INFO L93 Difference]: Finished difference Result 244 states and 326 transitions. [2020-07-17 17:20:15,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 17:20:15,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2020-07-17 17:20:15,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:15,659 INFO L225 Difference]: With dead ends: 244 [2020-07-17 17:20:15,659 INFO L226 Difference]: Without dead ends: 238 [2020-07-17 17:20:15,661 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:20:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-07-17 17:20:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 213. [2020-07-17 17:20:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-07-17 17:20:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 287 transitions. [2020-07-17 17:20:15,703 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 287 transitions. Word has length 140 [2020-07-17 17:20:15,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:15,704 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 287 transitions. [2020-07-17 17:20:15,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:20:15,705 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 287 transitions. [2020-07-17 17:20:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-07-17 17:20:15,709 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:15,709 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:20:15,710 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 17:20:15,710 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:15,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:15,710 INFO L82 PathProgramCache]: Analyzing trace with hash -88380307, now seen corresponding path program 3 times [2020-07-17 17:20:15,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:15,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [266364164] [2020-07-17 17:20:15,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,256 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:20:16,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [266364164] [2020-07-17 17:20:16,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:16,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-17 17:20:16,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584506551] [2020-07-17 17:20:16,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 17:20:16,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:16,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 17:20:16,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:20:16,260 INFO L87 Difference]: Start difference. First operand 213 states and 287 transitions. Second operand 14 states. [2020-07-17 17:20:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:16,818 INFO L93 Difference]: Finished difference Result 470 states and 677 transitions. [2020-07-17 17:20:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-17 17:20:16,819 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 193 [2020-07-17 17:20:16,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:16,825 INFO L225 Difference]: With dead ends: 470 [2020-07-17 17:20:16,826 INFO L226 Difference]: Without dead ends: 257 [2020-07-17 17:20:16,832 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:20:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-07-17 17:20:16,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 233. [2020-07-17 17:20:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-07-17 17:20:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 310 transitions. [2020-07-17 17:20:16,867 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 310 transitions. Word has length 193 [2020-07-17 17:20:16,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:16,867 INFO L479 AbstractCegarLoop]: Abstraction has 233 states and 310 transitions. [2020-07-17 17:20:16,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 17:20:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 310 transitions. [2020-07-17 17:20:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2020-07-17 17:20:16,873 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:16,874 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:20:16,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 17:20:16,874 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:16,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:16,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1293350858, now seen corresponding path program 4 times [2020-07-17 17:20:16,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:16,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1539634317] [2020-07-17 17:20:16,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,644 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:20:17,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1539634317] [2020-07-17 17:20:17,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:17,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-17 17:20:17,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653172235] [2020-07-17 17:20:17,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 17:20:17,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:17,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 17:20:17,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:20:17,647 INFO L87 Difference]: Start difference. First operand 233 states and 310 transitions. Second operand 14 states. [2020-07-17 17:20:18,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:18,211 INFO L93 Difference]: Finished difference Result 541 states and 798 transitions. [2020-07-17 17:20:18,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-17 17:20:18,212 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 351 [2020-07-17 17:20:18,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:18,217 INFO L225 Difference]: With dead ends: 541 [2020-07-17 17:20:18,217 INFO L226 Difference]: Without dead ends: 308 [2020-07-17 17:20:18,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2020-07-17 17:20:18,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2020-07-17 17:20:18,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 269. [2020-07-17 17:20:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-07-17 17:20:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 359 transitions. [2020-07-17 17:20:18,261 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 359 transitions. Word has length 351 [2020-07-17 17:20:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:18,261 INFO L479 AbstractCegarLoop]: Abstraction has 269 states and 359 transitions. [2020-07-17 17:20:18,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 17:20:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 359 transitions. [2020-07-17 17:20:18,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-07-17 17:20:18,265 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:18,266 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:20:18,266 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 17:20:18,266 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:18,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:18,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1117162661, now seen corresponding path program 5 times [2020-07-17 17:20:18,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:18,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2099443367] [2020-07-17 17:20:18,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 60 proven. 311 refuted. 0 times theorem prover too weak. 521 trivial. 0 not checked. [2020-07-17 17:20:18,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2099443367] [2020-07-17 17:20:18,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:18,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-17 17:20:18,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469205875] [2020-07-17 17:20:18,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 17:20:18,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:18,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 17:20:18,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:20:18,728 INFO L87 Difference]: Start difference. First operand 269 states and 359 transitions. Second operand 11 states. [2020-07-17 17:20:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:19,062 INFO L93 Difference]: Finished difference Result 530 states and 743 transitions. [2020-07-17 17:20:19,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 17:20:19,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2020-07-17 17:20:19,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:19,072 INFO L225 Difference]: With dead ends: 530 [2020-07-17 17:20:19,072 INFO L226 Difference]: Without dead ends: 524 [2020-07-17 17:20:19,074 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2020-07-17 17:20:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-07-17 17:20:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 499. [2020-07-17 17:20:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2020-07-17 17:20:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 696 transitions. [2020-07-17 17:20:19,142 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 696 transitions. Word has length 228 [2020-07-17 17:20:19,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:19,143 INFO L479 AbstractCegarLoop]: Abstraction has 499 states and 696 transitions. [2020-07-17 17:20:19,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 17:20:19,143 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 696 transitions. [2020-07-17 17:20:19,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2020-07-17 17:20:19,155 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:19,155 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 26, 26, 25, 22, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:19,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-17 17:20:19,156 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:19,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:19,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1689130430, now seen corresponding path program 6 times [2020-07-17 17:20:19,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:19,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [803228870] [2020-07-17 17:20:19,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4744 backedges. 268 proven. 732 refuted. 0 times theorem prover too weak. 3744 trivial. 0 not checked. [2020-07-17 17:20:20,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [803228870] [2020-07-17 17:20:20,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:20,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-17 17:20:20,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622566797] [2020-07-17 17:20:20,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 17:20:20,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:20,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 17:20:20,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:20:20,361 INFO L87 Difference]: Start difference. First operand 499 states and 696 transitions. Second operand 11 states. [2020-07-17 17:20:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:20,640 INFO L93 Difference]: Finished difference Result 987 states and 1429 transitions. [2020-07-17 17:20:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 17:20:20,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 495 [2020-07-17 17:20:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:20,653 INFO L225 Difference]: With dead ends: 987 [2020-07-17 17:20:20,654 INFO L226 Difference]: Without dead ends: 501 [2020-07-17 17:20:20,661 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 115 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:20:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2020-07-17 17:20:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 489. [2020-07-17 17:20:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2020-07-17 17:20:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 671 transitions. [2020-07-17 17:20:20,728 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 671 transitions. Word has length 495 [2020-07-17 17:20:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:20,728 INFO L479 AbstractCegarLoop]: Abstraction has 489 states and 671 transitions. [2020-07-17 17:20:20,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 17:20:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 671 transitions. [2020-07-17 17:20:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2020-07-17 17:20:20,743 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:20,743 INFO L422 BasicCegarLoop]: trace histogram [34, 34, 29, 29, 26, 25, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 12, 12, 8, 8, 8, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:20,744 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-17 17:20:20,744 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:20,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:20,744 INFO L82 PathProgramCache]: Analyzing trace with hash -162868606, now seen corresponding path program 7 times [2020-07-17 17:20:20,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:20,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [240299045] [2020-07-17 17:20:20,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6210 backedges. 1314 proven. 1694 refuted. 0 times theorem prover too weak. 3202 trivial. 0 not checked. [2020-07-17 17:20:22,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [240299045] [2020-07-17 17:20:22,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:22,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-17 17:20:22,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172877292] [2020-07-17 17:20:22,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 17:20:22,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:22,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 17:20:22,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-07-17 17:20:22,368 INFO L87 Difference]: Start difference. First operand 489 states and 671 transitions. Second operand 16 states. [2020-07-17 17:20:23,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:23,178 INFO L93 Difference]: Finished difference Result 892 states and 1362 transitions. [2020-07-17 17:20:23,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-07-17 17:20:23,179 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 563 [2020-07-17 17:20:23,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:23,188 INFO L225 Difference]: With dead ends: 892 [2020-07-17 17:20:23,188 INFO L226 Difference]: Without dead ends: 401 [2020-07-17 17:20:23,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2020-07-17 17:20:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2020-07-17 17:20:23,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 343. [2020-07-17 17:20:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-07-17 17:20:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 463 transitions. [2020-07-17 17:20:23,254 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 463 transitions. Word has length 563 [2020-07-17 17:20:23,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:23,254 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 463 transitions. [2020-07-17 17:20:23,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 17:20:23,255 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 463 transitions. [2020-07-17 17:20:23,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2020-07-17 17:20:23,262 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:23,262 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:20:23,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-17 17:20:23,263 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:23,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:23,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1725201844, now seen corresponding path program 8 times [2020-07-17 17:20:23,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:23,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1460084244] [2020-07-17 17:20:23,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:24,157 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:20:24,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1460084244] [2020-07-17 17:20:24,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:24,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-17 17:20:24,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908862392] [2020-07-17 17:20:24,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 17:20:24,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:24,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 17:20:24,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:20:24,163 INFO L87 Difference]: Start difference. First operand 343 states and 463 transitions. Second operand 14 states. [2020-07-17 17:20:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:24,641 INFO L93 Difference]: Finished difference Result 707 states and 995 transitions. [2020-07-17 17:20:24,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-17 17:20:24,642 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 387 [2020-07-17 17:20:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:24,648 INFO L225 Difference]: With dead ends: 707 [2020-07-17 17:20:24,648 INFO L226 Difference]: Without dead ends: 385 [2020-07-17 17:20:24,653 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 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:20:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-07-17 17:20:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 353. [2020-07-17 17:20:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-07-17 17:20:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 465 transitions. [2020-07-17 17:20:24,693 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 465 transitions. Word has length 387 [2020-07-17 17:20:24,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:24,693 INFO L479 AbstractCegarLoop]: Abstraction has 353 states and 465 transitions. [2020-07-17 17:20:24,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 17:20:24,694 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 465 transitions. [2020-07-17 17:20:24,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-07-17 17:20:24,700 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:24,700 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:24,701 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-17 17:20:24,701 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:24,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:24,701 INFO L82 PathProgramCache]: Analyzing trace with hash 549243331, now seen corresponding path program 9 times [2020-07-17 17:20:24,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:24,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1582103617] [2020-07-17 17:20:24,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2534 backedges. 130 proven. 672 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2020-07-17 17:20:25,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1582103617] [2020-07-17 17:20:25,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:25,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-17 17:20:25,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974741625] [2020-07-17 17:20:25,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 17:20:25,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:25,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 17:20:25,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:20:25,358 INFO L87 Difference]: Start difference. First operand 353 states and 465 transitions. Second operand 12 states. [2020-07-17 17:20:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:25,744 INFO L93 Difference]: Finished difference Result 768 states and 1052 transitions. [2020-07-17 17:20:25,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 17:20:25,745 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 369 [2020-07-17 17:20:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:25,755 INFO L225 Difference]: With dead ends: 768 [2020-07-17 17:20:25,756 INFO L226 Difference]: Without dead ends: 762 [2020-07-17 17:20:25,757 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2020-07-17 17:20:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2020-07-17 17:20:25,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 727. [2020-07-17 17:20:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2020-07-17 17:20:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 994 transitions. [2020-07-17 17:20:25,842 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 994 transitions. Word has length 369 [2020-07-17 17:20:25,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:25,843 INFO L479 AbstractCegarLoop]: Abstraction has 727 states and 994 transitions. [2020-07-17 17:20:25,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 17:20:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 994 transitions. [2020-07-17 17:20:25,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2020-07-17 17:20:25,849 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:25,849 INFO L422 BasicCegarLoop]: trace histogram [35, 35, 32, 32, 27, 27, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 11, 11, 10, 10, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:25,849 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-17 17:20:25,850 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:25,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:25,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1058675901, now seen corresponding path program 10 times [2020-07-17 17:20:25,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:25,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [564614412] [2020-07-17 17:20:25,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 747 proven. 1629 refuted. 0 times theorem prover too weak. 4620 trivial. 0 not checked. [2020-07-17 17:20:27,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [564614412] [2020-07-17 17:20:27,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:27,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-07-17 17:20:27,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137191967] [2020-07-17 17:20:27,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-17 17:20:27,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:27,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-17 17:20:27,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2020-07-17 17:20:27,367 INFO L87 Difference]: Start difference. First operand 727 states and 994 transitions. Second operand 18 states. [2020-07-17 17:20:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:28,311 INFO L93 Difference]: Finished difference Result 1267 states and 1913 transitions. [2020-07-17 17:20:28,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-07-17 17:20:28,312 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 598 [2020-07-17 17:20:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:28,325 INFO L225 Difference]: With dead ends: 1267 [2020-07-17 17:20:28,326 INFO L226 Difference]: Without dead ends: 542 [2020-07-17 17:20:28,336 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=1472, Unknown=0, NotChecked=0, Total=1722 [2020-07-17 17:20:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-07-17 17:20:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 468. [2020-07-17 17:20:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2020-07-17 17:20:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 640 transitions. [2020-07-17 17:20:28,422 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 640 transitions. Word has length 598 [2020-07-17 17:20:28,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:28,423 INFO L479 AbstractCegarLoop]: Abstraction has 468 states and 640 transitions. [2020-07-17 17:20:28,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-17 17:20:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 640 transitions. [2020-07-17 17:20:28,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2020-07-17 17:20:28,430 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:28,430 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 25, 24, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 10, 9, 9, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:28,430 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-17 17:20:28,431 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:28,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:28,431 INFO L82 PathProgramCache]: Analyzing trace with hash -444779053, now seen corresponding path program 11 times [2020-07-17 17:20:28,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:28,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [20586053] [2020-07-17 17:20:28,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5757 backedges. 560 proven. 1270 refuted. 0 times theorem prover too weak. 3927 trivial. 0 not checked. [2020-07-17 17:20:29,656 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [20586053] [2020-07-17 17:20:29,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:29,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-17 17:20:29,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321809750] [2020-07-17 17:20:29,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 17:20:29,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:29,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 17:20:29,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-07-17 17:20:29,658 INFO L87 Difference]: Start difference. First operand 468 states and 640 transitions. Second operand 16 states. [2020-07-17 17:20:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:30,277 INFO L93 Difference]: Finished difference Result 958 states and 1371 transitions. [2020-07-17 17:20:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-17 17:20:30,279 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 545 [2020-07-17 17:20:30,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:30,287 INFO L225 Difference]: With dead ends: 958 [2020-07-17 17:20:30,287 INFO L226 Difference]: Without dead ends: 508 [2020-07-17 17:20:30,292 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2020-07-17 17:20:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2020-07-17 17:20:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 443. [2020-07-17 17:20:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2020-07-17 17:20:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 588 transitions. [2020-07-17 17:20:30,346 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 588 transitions. Word has length 545 [2020-07-17 17:20:30,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:30,347 INFO L479 AbstractCegarLoop]: Abstraction has 443 states and 588 transitions. [2020-07-17 17:20:30,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 17:20:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 588 transitions. [2020-07-17 17:20:30,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2020-07-17 17:20:30,352 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:30,352 INFO L422 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 11, 11, 10, 10, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:30,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-17 17:20:30,353 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:30,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:30,353 INFO L82 PathProgramCache]: Analyzing trace with hash -425442147, now seen corresponding path program 12 times [2020-07-17 17:20:30,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:30,353 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1340142065] [2020-07-17 17:20:30,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 17:20:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 17:20:30,631 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-17 17:20:30,632 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 17:20:30,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-17 17:20:30,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 05:20:30 BoogieIcfgContainer [2020-07-17 17:20:30,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 17:20:30,753 INFO L168 Benchmark]: Toolchain (without parser) took 21266.84 ms. Allocated memory was 142.1 MB in the beginning and 1.0 GB in the end (delta: 867.2 MB). Free memory was 100.2 MB in the beginning and 75.8 MB in the end (delta: 24.4 MB). Peak memory consumption was 891.6 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:30,754 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 142.1 MB. Free memory was 118.6 MB in the beginning and 118.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-17 17:20:30,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.18 ms. Allocated memory is still 142.1 MB. Free memory was 100.0 MB in the beginning and 90.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:30,755 INFO L168 Benchmark]: Boogie Preprocessor took 146.84 ms. Allocated memory was 142.1 MB in the beginning and 200.8 MB in the end (delta: 58.7 MB). Free memory was 90.1 MB in the beginning and 179.5 MB in the end (delta: -89.4 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:30,756 INFO L168 Benchmark]: RCFGBuilder took 416.01 ms. Allocated memory is still 200.8 MB. Free memory was 179.5 MB in the beginning and 165.0 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:30,756 INFO L168 Benchmark]: TraceAbstraction took 20428.69 ms. Allocated memory was 200.8 MB in the beginning and 1.0 GB in the end (delta: 808.5 MB). Free memory was 165.0 MB in the beginning and 75.8 MB in the end (delta: 89.2 MB). Peak memory consumption was 897.7 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:30,759 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.18 ms. Allocated memory is still 142.1 MB. Free memory was 118.6 MB in the beginning and 118.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 269.18 ms. Allocated memory is still 142.1 MB. Free memory was 100.0 MB in the beginning and 90.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 146.84 ms. Allocated memory was 142.1 MB in the beginning and 200.8 MB in the end (delta: 58.7 MB). Free memory was 90.1 MB in the beginning and 179.5 MB in the end (delta: -89.4 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 416.01 ms. Allocated memory is still 200.8 MB. Free memory was 179.5 MB in the beginning and 165.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20428.69 ms. Allocated memory was 200.8 MB in the beginning and 1.0 GB in the end (delta: 808.5 MB). Free memory was 165.0 MB in the beginning and 75.8 MB in the end (delta: 89.2 MB). Peak memory consumption was 897.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 8; VAL [x=8] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=3, \result=2, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=4, \result=3, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=3, \result=2, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=5, \result=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=3, \result=2, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=4, \result=3, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=6, \result=8, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=3, \result=2, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=4, \result=3, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=3, \result=2, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=5, \result=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=7, \result=13, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=3, \result=2, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=4, \result=3, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=3, \result=2, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=5, \result=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=3, \result=2, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=4, \result=3, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=6, \result=8, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=8, \result=21, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L37] int result = fibo1(x); VAL [fibo1(x)=21, result=21, x=8] [L38] COND TRUE result == 21 VAL [result=21, x=8] [L39] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.2s, OverallIterations: 23, TraceHistogramMax: 35, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1070 SDtfs, 1509 SDslu, 6228 SDs, 0 SdLazy, 5699 SolverSat, 699 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1466 GetRequests, 1120 SyntacticMatches, 0 SemanticMatches, 346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=727occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 476 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 5227 NumberOfCodeBlocks, 5227 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 4607 ConstructedInterpolants, 0 QuantifiedInterpolants, 2587115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 25705/33967 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 incorrect! Received shutdown request...