/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/sum_25x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 17:22:47,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 17:22:47,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 17:22:47,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 17:22:47,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 17:22:48,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 17:22:48,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 17:22:48,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 17:22:48,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 17:22:48,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 17:22:48,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 17:22:48,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 17:22:48,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 17:22:48,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 17:22:48,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 17:22:48,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 17:22:48,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 17:22:48,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 17:22:48,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 17:22:48,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 17:22:48,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 17:22:48,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 17:22:48,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 17:22:48,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 17:22:48,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 17:22:48,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 17:22:48,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 17:22:48,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 17:22:48,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 17:22:48,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 17:22:48,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 17:22:48,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 17:22:48,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 17:22:48,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 17:22:48,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 17:22:48,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 17:22:48,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 17:22:48,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 17:22:48,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 17:22:48,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 17:22:48,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 17:22:48,036 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:22:48,047 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 17:22:48,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 17:22:48,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 17:22:48,050 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 17:22:48,051 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 17:22:48,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 17:22:48,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 17:22:48,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 17:22:48,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 17:22:48,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 17:22:48,052 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 17:22:48,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 17:22:48,052 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 17:22:48,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 17:22:48,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 17:22:48,053 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 17:22:48,053 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 17:22:48,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 17:22:48,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:22:48,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 17:22:48,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 17:22:48,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 17:22:48,054 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:22:48,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 17:22:48,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 17:22:48,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 17:22:48,462 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 17:22:48,462 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 17:22:48,463 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_25x0-2.c [2020-07-17 17:22:48,545 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e566d367/53deba4cc1484f51b31c930d6120f654/FLAGc542a3b71 [2020-07-17 17:22:49,003 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 17:22:49,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_25x0-2.c [2020-07-17 17:22:49,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e566d367/53deba4cc1484f51b31c930d6120f654/FLAGc542a3b71 [2020-07-17 17:22:49,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e566d367/53deba4cc1484f51b31c930d6120f654 [2020-07-17 17:22:49,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 17:22:49,386 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 17:22:49,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 17:22:49,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 17:22:49,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 17:22:49,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:22:49" (1/1) ... [2020-07-17 17:22:49,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49eb7047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:49, skipping insertion in model container [2020-07-17 17:22:49,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:22:49" (1/1) ... [2020-07-17 17:22:49,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 17:22:49,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 17:22:49,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:22:49,661 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 17:22:49,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:22:49,701 INFO L208 MainTranslator]: Completed translation [2020-07-17 17:22:49,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:49 WrapperNode [2020-07-17 17:22:49,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 17:22:49,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 17:22:49,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 17:22:49,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 17:22:49,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:49" (1/1) ... [2020-07-17 17:22:49,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:49" (1/1) ... [2020-07-17 17:22:49,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:49" (1/1) ... [2020-07-17 17:22:49,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:49" (1/1) ... [2020-07-17 17:22:49,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:49" (1/1) ... [2020-07-17 17:22:49,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:49" (1/1) ... [2020-07-17 17:22:49,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:49" (1/1) ... [2020-07-17 17:22:49,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 17:22:49,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 17:22:49,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 17:22:49,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 17:22:49,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:49" (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:22:49,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 17:22:49,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 17:22:49,919 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-17 17:22:49,919 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 17:22:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 17:22:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-17 17:22:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 17:22:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 17:22:49,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 17:22:50,149 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 17:22:50,150 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 17:22:50,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:22:50 BoogieIcfgContainer [2020-07-17 17:22:50,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 17:22:50,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 17:22:50,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 17:22:50,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 17:22:50,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 05:22:49" (1/3) ... [2020-07-17 17:22:50,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7a74f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:22:50, skipping insertion in model container [2020-07-17 17:22:50,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:49" (2/3) ... [2020-07-17 17:22:50,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7a74f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:22:50, skipping insertion in model container [2020-07-17 17:22:50,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:22:50" (3/3) ... [2020-07-17 17:22:50,164 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_25x0-2.c [2020-07-17 17:22:50,176 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 17:22:50,184 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 17:22:50,199 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 17:22:50,227 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 17:22:50,227 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 17:22:50,227 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-17 17:22:50,227 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 17:22:50,228 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 17:22:50,228 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 17:22:50,228 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 17:22:50,228 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 17:22:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-17 17:22:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 17:22:50,256 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:50,257 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:50,257 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:50,264 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-07-17 17:22:50,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:50,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [267252001] [2020-07-17 17:22:50,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,616 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:22:50,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [267252001] [2020-07-17 17:22:50,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:22:50,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:22:50,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395023593] [2020-07-17 17:22:50,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:22:50,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:50,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:22:50,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:22:50,645 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-07-17 17:22:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:50,760 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-07-17 17:22:50,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:22:50,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-17 17:22:50,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:50,773 INFO L225 Difference]: With dead ends: 39 [2020-07-17 17:22:50,774 INFO L226 Difference]: Without dead ends: 25 [2020-07-17 17:22:50,778 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:22:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-17 17:22:50,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-17 17:22:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 17:22:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-17 17:22:50,830 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-07-17 17:22:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:50,830 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-17 17:22:50,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:22:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-17 17:22:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 17:22:50,832 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:50,833 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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:22:50,833 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 17:22:50,833 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-07-17 17:22:50,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:50,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1806227625] [2020-07-17 17:22:50,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-17 17:22:50,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1806227625] [2020-07-17 17:22:50,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:50,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 17:22:50,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188839432] [2020-07-17 17:22:50,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 17:22:50,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:50,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 17:22:50,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:22:50,996 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2020-07-17 17:22:51,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:51,076 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-17 17:22:51,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 17:22:51,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-17 17:22:51,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:51,078 INFO L225 Difference]: With dead ends: 36 [2020-07-17 17:22:51,079 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 17:22:51,080 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:22:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 17:22:51,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 17:22:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 17:22:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-17 17:22:51,093 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2020-07-17 17:22:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:51,093 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-17 17:22:51,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 17:22:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-17 17:22:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-17 17:22:51,095 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:51,096 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:51,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 17:22:51,097 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:51,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:51,097 INFO L82 PathProgramCache]: Analyzing trace with hash -175020829, now seen corresponding path program 2 times [2020-07-17 17:22:51,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:51,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675676983] [2020-07-17 17:22:51,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-17 17:22:51,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1675676983] [2020-07-17 17:22:51,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:51,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:22:51,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983362949] [2020-07-17 17:22:51,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:22:51,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:51,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:22:51,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:22:51,263 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2020-07-17 17:22:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:51,354 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-07-17 17:22:51,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 17:22:51,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-17 17:22:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:51,357 INFO L225 Difference]: With dead ends: 41 [2020-07-17 17:22:51,357 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 17:22:51,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:22:51,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 17:22:51,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-17 17:22:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 17:22:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-07-17 17:22:51,371 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 36 [2020-07-17 17:22:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:51,372 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-07-17 17:22:51,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:22:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-07-17 17:22:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-17 17:22:51,374 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:51,374 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:51,375 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 17:22:51,375 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:51,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:51,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1021564803, now seen corresponding path program 3 times [2020-07-17 17:22:51,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:51,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1187646810] [2020-07-17 17:22:51,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-17 17:22:51,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1187646810] [2020-07-17 17:22:51,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:51,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:22:51,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585080454] [2020-07-17 17:22:51,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:22:51,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:51,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:22:51,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:22:51,708 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 8 states. [2020-07-17 17:22:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:51,805 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-17 17:22:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 17:22:51,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-17 17:22:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:51,808 INFO L225 Difference]: With dead ends: 46 [2020-07-17 17:22:51,808 INFO L226 Difference]: Without dead ends: 40 [2020-07-17 17:22:51,809 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:22:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-17 17:22:51,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-17 17:22:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 17:22:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-07-17 17:22:51,820 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 45 [2020-07-17 17:22:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:51,821 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-07-17 17:22:51,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:22:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-07-17 17:22:51,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-17 17:22:51,823 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:51,823 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:51,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 17:22:51,824 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:51,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:51,824 INFO L82 PathProgramCache]: Analyzing trace with hash -263249715, now seen corresponding path program 4 times [2020-07-17 17:22:51,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:51,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2141136694] [2020-07-17 17:22:51,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-07-17 17:22:52,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2141136694] [2020-07-17 17:22:52,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:52,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-17 17:22:52,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291323749] [2020-07-17 17:22:52,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 17:22:52,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:52,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 17:22:52,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-17 17:22:52,099 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2020-07-17 17:22:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:52,184 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-07-17 17:22:52,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 17:22:52,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-07-17 17:22:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:52,186 INFO L225 Difference]: With dead ends: 51 [2020-07-17 17:22:52,186 INFO L226 Difference]: Without dead ends: 45 [2020-07-17 17:22:52,187 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:22:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-17 17:22:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-17 17:22:52,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-17 17:22:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-07-17 17:22:52,198 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 54 [2020-07-17 17:22:52,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:52,198 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-07-17 17:22:52,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 17:22:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-07-17 17:22:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-17 17:22:52,200 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:52,200 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:52,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 17:22:52,201 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:52,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:52,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1884999187, now seen corresponding path program 5 times [2020-07-17 17:22:52,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:52,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1903320568] [2020-07-17 17:22:52,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-07-17 17:22:52,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1903320568] [2020-07-17 17:22:52,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:52,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:22:52,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484816207] [2020-07-17 17:22:52,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:22:52,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:52,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:22:52,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:22:52,406 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 10 states. [2020-07-17 17:22:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:52,515 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-07-17 17:22:52,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 17:22:52,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-07-17 17:22:52,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:52,519 INFO L225 Difference]: With dead ends: 56 [2020-07-17 17:22:52,519 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 17:22:52,521 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-07-17 17:22:52,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 17:22:52,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-17 17:22:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-17 17:22:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-07-17 17:22:52,532 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 63 [2020-07-17 17:22:52,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:52,533 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-07-17 17:22:52,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:22:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-17 17:22:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-17 17:22:52,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:52,536 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:52,536 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 17:22:52,536 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:52,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:52,537 INFO L82 PathProgramCache]: Analyzing trace with hash -441437769, now seen corresponding path program 6 times [2020-07-17 17:22:52,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:52,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [942697400] [2020-07-17 17:22:52,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-07-17 17:22:52,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [942697400] [2020-07-17 17:22:52,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:52,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-17 17:22:52,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238983093] [2020-07-17 17:22:52,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 17:22:52,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:52,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 17:22:52,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:22:52,793 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 11 states. [2020-07-17 17:22:52,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:52,917 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-07-17 17:22:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 17:22:52,918 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-07-17 17:22:52,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:52,919 INFO L225 Difference]: With dead ends: 61 [2020-07-17 17:22:52,920 INFO L226 Difference]: Without dead ends: 55 [2020-07-17 17:22:52,920 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-07-17 17:22:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-17 17:22:52,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-17 17:22:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 17:22:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-07-17 17:22:52,931 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 72 [2020-07-17 17:22:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:52,931 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-07-17 17:22:52,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 17:22:52,931 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-07-17 17:22:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-07-17 17:22:52,933 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:52,933 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:52,933 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 17:22:52,934 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:52,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:52,934 INFO L82 PathProgramCache]: Analyzing trace with hash 999943849, now seen corresponding path program 7 times [2020-07-17 17:22:52,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:52,935 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1794658221] [2020-07-17 17:22:52,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,252 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-07-17 17:22:53,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1794658221] [2020-07-17 17:22:53,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:53,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-17 17:22:53,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211417973] [2020-07-17 17:22:53,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 17:22:53,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:53,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 17:22:53,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:22:53,255 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 12 states. [2020-07-17 17:22:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:53,406 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-07-17 17:22:53,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 17:22:53,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-07-17 17:22:53,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:53,409 INFO L225 Difference]: With dead ends: 66 [2020-07-17 17:22:53,412 INFO L226 Difference]: Without dead ends: 60 [2020-07-17 17:22:53,413 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-07-17 17:22:53,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-17 17:22:53,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-07-17 17:22:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-17 17:22:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-07-17 17:22:53,432 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 81 [2020-07-17 17:22:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:53,433 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-07-17 17:22:53,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 17:22:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-07-17 17:22:53,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-17 17:22:53,438 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:53,439 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:53,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 17:22:53,441 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:53,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:53,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1356134305, now seen corresponding path program 8 times [2020-07-17 17:22:53,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:53,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1618420454] [2020-07-17 17:22:53,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-07-17 17:22:53,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1618420454] [2020-07-17 17:22:53,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:53,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-17 17:22:53,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364805900] [2020-07-17 17:22:53,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 17:22:53,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:53,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 17:22:53,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-07-17 17:22:53,744 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 13 states. [2020-07-17 17:22:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:53,910 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-07-17 17:22:53,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 17:22:53,910 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-07-17 17:22:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:53,912 INFO L225 Difference]: With dead ends: 71 [2020-07-17 17:22:53,912 INFO L226 Difference]: Without dead ends: 65 [2020-07-17 17:22:53,913 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-07-17 17:22:53,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-17 17:22:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-07-17 17:22:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-17 17:22:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-07-17 17:22:53,922 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 90 [2020-07-17 17:22:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:53,923 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-07-17 17:22:53,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 17:22:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-07-17 17:22:53,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-17 17:22:53,924 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:53,925 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:53,925 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 17:22:53,925 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:53,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:53,925 INFO L82 PathProgramCache]: Analyzing trace with hash -928437697, now seen corresponding path program 9 times [2020-07-17 17:22:53,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:53,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1098628893] [2020-07-17 17:22:53,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-07-17 17:22:54,232 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1098628893] [2020-07-17 17:22:54,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:54,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-17 17:22:54,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686899573] [2020-07-17 17:22:54,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 17:22:54,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:54,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 17:22:54,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:22:54,234 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2020-07-17 17:22:54,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:54,394 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-07-17 17:22:54,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 17:22:54,394 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-07-17 17:22:54,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:54,396 INFO L225 Difference]: With dead ends: 76 [2020-07-17 17:22:54,396 INFO L226 Difference]: Without dead ends: 70 [2020-07-17 17:22:54,397 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-07-17 17:22:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-17 17:22:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-17 17:22:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-17 17:22:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-07-17 17:22:54,408 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 99 [2020-07-17 17:22:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:54,408 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-07-17 17:22:54,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 17:22:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-07-17 17:22:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-17 17:22:54,410 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:54,410 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:54,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 17:22:54,410 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:54,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:54,411 INFO L82 PathProgramCache]: Analyzing trace with hash -276966773, now seen corresponding path program 10 times [2020-07-17 17:22:54,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:54,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1970323537] [2020-07-17 17:22:54,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-07-17 17:22:54,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1970323537] [2020-07-17 17:22:54,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:54,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-17 17:22:54,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072874165] [2020-07-17 17:22:54,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 17:22:54,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:54,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 17:22:54,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-07-17 17:22:54,798 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 15 states. [2020-07-17 17:22:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:54,943 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-07-17 17:22:54,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 17:22:54,944 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-07-17 17:22:54,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:54,945 INFO L225 Difference]: With dead ends: 81 [2020-07-17 17:22:54,945 INFO L226 Difference]: Without dead ends: 75 [2020-07-17 17:22:54,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-07-17 17:22:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-17 17:22:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-07-17 17:22:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-17 17:22:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-07-17 17:22:54,957 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 108 [2020-07-17 17:22:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:54,957 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-07-17 17:22:54,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 17:22:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-07-17 17:22:54,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-17 17:22:54,959 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:54,959 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:54,959 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 17:22:54,959 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:54,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:54,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1749540651, now seen corresponding path program 11 times [2020-07-17 17:22:54,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:54,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1218204868] [2020-07-17 17:22:54,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,479 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-07-17 17:22:55,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1218204868] [2020-07-17 17:22:55,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:55,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-17 17:22:55,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535268319] [2020-07-17 17:22:55,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 17:22:55,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:55,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 17:22:55,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-07-17 17:22:55,481 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 16 states. [2020-07-17 17:22:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:55,649 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-07-17 17:22:55,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 17:22:55,649 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-07-17 17:22:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:55,650 INFO L225 Difference]: With dead ends: 86 [2020-07-17 17:22:55,651 INFO L226 Difference]: Without dead ends: 80 [2020-07-17 17:22:55,653 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-07-17 17:22:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-17 17:22:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-07-17 17:22:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-17 17:22:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2020-07-17 17:22:55,664 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 117 [2020-07-17 17:22:55,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:55,665 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2020-07-17 17:22:55,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 17:22:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2020-07-17 17:22:55,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-07-17 17:22:55,667 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:55,667 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:55,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 17:22:55,667 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:55,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:55,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1141580405, now seen corresponding path program 12 times [2020-07-17 17:22:55,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:55,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [134594544] [2020-07-17 17:22:55,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-07-17 17:22:56,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [134594544] [2020-07-17 17:22:56,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:56,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-17 17:22:56,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231217837] [2020-07-17 17:22:56,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-17 17:22:56,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:56,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-17 17:22:56,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-07-17 17:22:56,374 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 17 states. [2020-07-17 17:22:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:56,605 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-07-17 17:22:56,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-17 17:22:56,606 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-07-17 17:22:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:56,607 INFO L225 Difference]: With dead ends: 91 [2020-07-17 17:22:56,607 INFO L226 Difference]: Without dead ends: 85 [2020-07-17 17:22:56,610 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-07-17 17:22:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-17 17:22:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-07-17 17:22:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-17 17:22:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2020-07-17 17:22:56,619 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 126 [2020-07-17 17:22:56,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:56,620 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2020-07-17 17:22:56,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-17 17:22:56,620 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2020-07-17 17:22:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-07-17 17:22:56,622 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:56,622 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:56,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 17:22:56,622 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:56,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:56,623 INFO L82 PathProgramCache]: Analyzing trace with hash 55997035, now seen corresponding path program 13 times [2020-07-17 17:22:56,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:56,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2086087999] [2020-07-17 17:22:56,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-07-17 17:22:57,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2086087999] [2020-07-17 17:22:57,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:57,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-07-17 17:22:57,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784372486] [2020-07-17 17:22:57,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-17 17:22:57,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:57,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-17 17:22:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-07-17 17:22:57,272 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 18 states. [2020-07-17 17:22:57,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:57,509 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-07-17 17:22:57,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 17:22:57,509 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-07-17 17:22:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:57,511 INFO L225 Difference]: With dead ends: 96 [2020-07-17 17:22:57,511 INFO L226 Difference]: Without dead ends: 90 [2020-07-17 17:22:57,512 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-07-17 17:22:57,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-17 17:22:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-07-17 17:22:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-17 17:22:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-07-17 17:22:57,521 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 135 [2020-07-17 17:22:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:57,521 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-07-17 17:22:57,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-17 17:22:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-07-17 17:22:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-07-17 17:22:57,524 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:57,524 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:57,524 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 17:22:57,524 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:57,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:57,525 INFO L82 PathProgramCache]: Analyzing trace with hash 394086239, now seen corresponding path program 14 times [2020-07-17 17:22:57,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:57,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [708795320] [2020-07-17 17:22:57,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-07-17 17:22:58,139 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [708795320] [2020-07-17 17:22:58,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:58,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-07-17 17:22:58,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724213699] [2020-07-17 17:22:58,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 17:22:58,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:58,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 17:22:58,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-07-17 17:22:58,141 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 19 states. [2020-07-17 17:22:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:58,363 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-07-17 17:22:58,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 17:22:58,364 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-07-17 17:22:58,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:58,365 INFO L225 Difference]: With dead ends: 101 [2020-07-17 17:22:58,365 INFO L226 Difference]: Without dead ends: 95 [2020-07-17 17:22:58,366 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-07-17 17:22:58,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-17 17:22:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-07-17 17:22:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-17 17:22:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2020-07-17 17:22:58,377 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 144 [2020-07-17 17:22:58,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:58,377 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2020-07-17 17:22:58,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 17:22:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2020-07-17 17:22:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-07-17 17:22:58,381 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:58,381 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:58,381 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 17:22:58,381 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:58,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:58,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1047772929, now seen corresponding path program 15 times [2020-07-17 17:22:58,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:58,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [717975268] [2020-07-17 17:22:58,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-07-17 17:22:59,122 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [717975268] [2020-07-17 17:22:59,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:59,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-17 17:22:59,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455391869] [2020-07-17 17:22:59,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-17 17:22:59,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:59,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-17 17:22:59,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-07-17 17:22:59,128 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 20 states. [2020-07-17 17:22:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:59,355 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-07-17 17:22:59,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-17 17:22:59,355 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-07-17 17:22:59,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:59,359 INFO L225 Difference]: With dead ends: 106 [2020-07-17 17:22:59,359 INFO L226 Difference]: Without dead ends: 100 [2020-07-17 17:22:59,360 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2020-07-17 17:22:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-17 17:22:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2020-07-17 17:22:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-17 17:22:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2020-07-17 17:22:59,368 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 153 [2020-07-17 17:22:59,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:59,369 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2020-07-17 17:22:59,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-17 17:22:59,369 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2020-07-17 17:22:59,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-07-17 17:22:59,371 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:59,371 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:59,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-17 17:22:59,371 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:59,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:59,372 INFO L82 PathProgramCache]: Analyzing trace with hash -76242615, now seen corresponding path program 16 times [2020-07-17 17:22:59,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:59,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1309033232] [2020-07-17 17:22:59,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-07-17 17:23:00,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1309033232] [2020-07-17 17:23:00,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:00,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-07-17 17:23:00,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166781055] [2020-07-17 17:23:00,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-17 17:23:00,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:00,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-17 17:23:00,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-07-17 17:23:00,543 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 21 states. [2020-07-17 17:23:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:00,857 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-07-17 17:23:00,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-17 17:23:00,858 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2020-07-17 17:23:00,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:00,860 INFO L225 Difference]: With dead ends: 111 [2020-07-17 17:23:00,860 INFO L226 Difference]: Without dead ends: 105 [2020-07-17 17:23:00,862 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2020-07-17 17:23:00,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-17 17:23:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-07-17 17:23:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-17 17:23:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2020-07-17 17:23:00,873 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 162 [2020-07-17 17:23:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:00,873 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2020-07-17 17:23:00,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-17 17:23:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2020-07-17 17:23:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-07-17 17:23:00,875 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:00,876 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:00,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-17 17:23:00,876 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:00,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1382000279, now seen corresponding path program 17 times [2020-07-17 17:23:00,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:00,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1406114411] [2020-07-17 17:23:00,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-07-17 17:23:01,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1406114411] [2020-07-17 17:23:01,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:01,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-07-17 17:23:01,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924585459] [2020-07-17 17:23:01,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-17 17:23:01,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:01,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-17 17:23:01,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-07-17 17:23:01,843 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 22 states. [2020-07-17 17:23:02,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:02,100 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2020-07-17 17:23:02,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-17 17:23:02,100 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 171 [2020-07-17 17:23:02,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:02,101 INFO L225 Difference]: With dead ends: 116 [2020-07-17 17:23:02,102 INFO L226 Difference]: Without dead ends: 110 [2020-07-17 17:23:02,103 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-07-17 17:23:02,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-17 17:23:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-07-17 17:23:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-17 17:23:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2020-07-17 17:23:02,115 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 171 [2020-07-17 17:23:02,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:02,116 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2020-07-17 17:23:02,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-17 17:23:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2020-07-17 17:23:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-07-17 17:23:02,118 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:02,118 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:02,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-17 17:23:02,119 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:02,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:02,119 INFO L82 PathProgramCache]: Analyzing trace with hash -869167053, now seen corresponding path program 18 times [2020-07-17 17:23:02,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:02,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1037684935] [2020-07-17 17:23:02,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-07-17 17:23:03,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1037684935] [2020-07-17 17:23:03,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:03,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-07-17 17:23:03,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953684116] [2020-07-17 17:23:03,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-17 17:23:03,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:03,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-17 17:23:03,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-07-17 17:23:03,261 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 23 states. [2020-07-17 17:23:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:03,544 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2020-07-17 17:23:03,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-17 17:23:03,545 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2020-07-17 17:23:03,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:03,546 INFO L225 Difference]: With dead ends: 121 [2020-07-17 17:23:03,546 INFO L226 Difference]: Without dead ends: 115 [2020-07-17 17:23:03,547 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-07-17 17:23:03,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-07-17 17:23:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2020-07-17 17:23:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-07-17 17:23:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2020-07-17 17:23:03,561 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 180 [2020-07-17 17:23:03,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:03,562 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2020-07-17 17:23:03,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-17 17:23:03,562 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2020-07-17 17:23:03,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-07-17 17:23:03,564 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:03,564 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:03,564 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-17 17:23:03,565 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:03,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:03,565 INFO L82 PathProgramCache]: Analyzing trace with hash 482986285, now seen corresponding path program 19 times [2020-07-17 17:23:03,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:03,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [595601875] [2020-07-17 17:23:03,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-07-17 17:23:04,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [595601875] [2020-07-17 17:23:04,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:04,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-07-17 17:23:04,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400687619] [2020-07-17 17:23:04,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-17 17:23:04,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-17 17:23:04,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-07-17 17:23:04,745 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 24 states. [2020-07-17 17:23:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:05,057 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2020-07-17 17:23:05,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-17 17:23:05,057 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2020-07-17 17:23:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:05,058 INFO L225 Difference]: With dead ends: 126 [2020-07-17 17:23:05,059 INFO L226 Difference]: Without dead ends: 120 [2020-07-17 17:23:05,060 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2020-07-17 17:23:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-17 17:23:05,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-07-17 17:23:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-17 17:23:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2020-07-17 17:23:05,067 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 189 [2020-07-17 17:23:05,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:05,068 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2020-07-17 17:23:05,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-17 17:23:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2020-07-17 17:23:05,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-07-17 17:23:05,070 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:05,070 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:05,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-17 17:23:05,071 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:05,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:05,071 INFO L82 PathProgramCache]: Analyzing trace with hash 848589853, now seen corresponding path program 20 times [2020-07-17 17:23:05,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:05,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [154371578] [2020-07-17 17:23:05,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-07-17 17:23:06,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [154371578] [2020-07-17 17:23:06,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:06,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-07-17 17:23:06,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498525801] [2020-07-17 17:23:06,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-17 17:23:06,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:06,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-17 17:23:06,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2020-07-17 17:23:06,455 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 25 states. [2020-07-17 17:23:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:06,811 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2020-07-17 17:23:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-17 17:23:06,811 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 198 [2020-07-17 17:23:06,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:06,822 INFO L225 Difference]: With dead ends: 131 [2020-07-17 17:23:06,822 INFO L226 Difference]: Without dead ends: 125 [2020-07-17 17:23:06,825 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2020-07-17 17:23:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-07-17 17:23:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-07-17 17:23:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-07-17 17:23:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2020-07-17 17:23:06,835 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 198 [2020-07-17 17:23:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:06,837 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2020-07-17 17:23:06,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-17 17:23:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2020-07-17 17:23:06,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-07-17 17:23:06,841 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:06,841 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:06,841 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-17 17:23:06,842 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:06,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:06,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1304544963, now seen corresponding path program 21 times [2020-07-17 17:23:06,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:06,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [138226591] [2020-07-17 17:23:06,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-07-17 17:23:07,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [138226591] [2020-07-17 17:23:07,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:07,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-07-17 17:23:07,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444219660] [2020-07-17 17:23:07,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-07-17 17:23:07,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:07,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-07-17 17:23:07,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2020-07-17 17:23:07,969 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 26 states. [2020-07-17 17:23:08,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:08,347 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2020-07-17 17:23:08,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-17 17:23:08,350 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 207 [2020-07-17 17:23:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:08,354 INFO L225 Difference]: With dead ends: 136 [2020-07-17 17:23:08,354 INFO L226 Difference]: Without dead ends: 130 [2020-07-17 17:23:08,355 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2020-07-17 17:23:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-07-17 17:23:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-07-17 17:23:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-07-17 17:23:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2020-07-17 17:23:08,365 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 207 [2020-07-17 17:23:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:08,365 INFO L479 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2020-07-17 17:23:08,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-07-17 17:23:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2020-07-17 17:23:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-07-17 17:23:08,368 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:08,368 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:08,368 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-17 17:23:08,368 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:08,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:08,369 INFO L82 PathProgramCache]: Analyzing trace with hash 639479047, now seen corresponding path program 22 times [2020-07-17 17:23:08,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:08,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [64188699] [2020-07-17 17:23:08,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2020-07-17 17:23:09,592 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [64188699] [2020-07-17 17:23:09,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:09,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-07-17 17:23:09,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440326306] [2020-07-17 17:23:09,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-07-17 17:23:09,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:09,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-07-17 17:23:09,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2020-07-17 17:23:09,594 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 27 states. [2020-07-17 17:23:09,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:09,984 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2020-07-17 17:23:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-17 17:23:09,985 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 216 [2020-07-17 17:23:09,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:09,986 INFO L225 Difference]: With dead ends: 141 [2020-07-17 17:23:09,986 INFO L226 Difference]: Without dead ends: 135 [2020-07-17 17:23:09,988 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2020-07-17 17:23:09,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-07-17 17:23:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-07-17 17:23:09,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-07-17 17:23:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2020-07-17 17:23:09,996 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 216 [2020-07-17 17:23:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:09,997 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2020-07-17 17:23:09,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-07-17 17:23:09,997 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2020-07-17 17:23:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-07-17 17:23:09,999 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:10,000 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:10,000 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-17 17:23:10,000 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:10,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:10,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1706508121, now seen corresponding path program 23 times [2020-07-17 17:23:10,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:10,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [425227875] [2020-07-17 17:23:10,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2392 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2020-07-17 17:23:11,335 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [425227875] [2020-07-17 17:23:11,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:11,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-07-17 17:23:11,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624961299] [2020-07-17 17:23:11,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-07-17 17:23:11,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:11,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-07-17 17:23:11,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2020-07-17 17:23:11,337 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 28 states. [2020-07-17 17:23:11,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:11,737 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2020-07-17 17:23:11,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-17 17:23:11,738 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 225 [2020-07-17 17:23:11,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:11,739 INFO L225 Difference]: With dead ends: 146 [2020-07-17 17:23:11,739 INFO L226 Difference]: Without dead ends: 140 [2020-07-17 17:23:11,741 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2020-07-17 17:23:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-07-17 17:23:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2020-07-17 17:23:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-07-17 17:23:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2020-07-17 17:23:11,750 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 225 [2020-07-17 17:23:11,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:11,750 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2020-07-17 17:23:11,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-07-17 17:23:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2020-07-17 17:23:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-07-17 17:23:11,753 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:11,753 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:11,754 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-17 17:23:11,754 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:11,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:11,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1861065457, now seen corresponding path program 24 times [2020-07-17 17:23:11,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:11,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1472923972] [2020-07-17 17:23:11,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:13,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2604 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2020-07-17 17:23:13,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1472923972] [2020-07-17 17:23:13,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:13,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-07-17 17:23:13,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692014711] [2020-07-17 17:23:13,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-07-17 17:23:13,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:13,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-07-17 17:23:13,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2020-07-17 17:23:13,190 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 29 states. [2020-07-17 17:23:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:13,600 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2020-07-17 17:23:13,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-17 17:23:13,601 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 234 [2020-07-17 17:23:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:13,603 INFO L225 Difference]: With dead ends: 151 [2020-07-17 17:23:13,603 INFO L226 Difference]: Without dead ends: 145 [2020-07-17 17:23:13,606 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2020-07-17 17:23:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-07-17 17:23:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-07-17 17:23:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-07-17 17:23:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2020-07-17 17:23:13,614 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 234 [2020-07-17 17:23:13,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:13,614 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2020-07-17 17:23:13,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-07-17 17:23:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2020-07-17 17:23:13,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-07-17 17:23:13,616 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:13,616 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:13,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-17 17:23:13,616 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:13,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:13,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1283861777, now seen corresponding path program 25 times [2020-07-17 17:23:13,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:13,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1334550574] [2020-07-17 17:23:13,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 17:23:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 17:23:13,726 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-17 17:23:13,727 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 17:23:13,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-07-17 17:23:13,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 05:23:13 BoogieIcfgContainer [2020-07-17 17:23:13,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 17:23:13,798 INFO L168 Benchmark]: Toolchain (without parser) took 24413.00 ms. Allocated memory was 136.8 MB in the beginning and 800.6 MB in the end (delta: 663.7 MB). Free memory was 102.4 MB in the beginning and 203.2 MB in the end (delta: -100.8 MB). Peak memory consumption was 563.0 MB. Max. memory is 7.1 GB. [2020-07-17 17:23:13,798 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 17:23:13,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.61 ms. Allocated memory is still 136.8 MB. Free memory was 102.0 MB in the beginning and 92.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-07-17 17:23:13,799 INFO L168 Benchmark]: Boogie Preprocessor took 35.30 ms. Allocated memory is still 136.8 MB. Free memory was 92.9 MB in the beginning and 91.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-17 17:23:13,800 INFO L168 Benchmark]: RCFGBuilder took 415.61 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 91.2 MB in the beginning and 168.0 MB in the end (delta: -76.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-17 17:23:13,806 INFO L168 Benchmark]: TraceAbstraction took 23638.11 ms. Allocated memory was 200.8 MB in the beginning and 800.6 MB in the end (delta: 599.8 MB). Free memory was 167.0 MB in the beginning and 203.2 MB in the end (delta: -36.2 MB). Peak memory consumption was 563.6 MB. Max. memory is 7.1 GB. [2020-07-17 17:23:13,809 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.20 ms. Allocated memory is still 136.8 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 315.61 ms. Allocated memory is still 136.8 MB. Free memory was 102.0 MB in the beginning and 92.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.30 ms. Allocated memory is still 136.8 MB. Free memory was 92.9 MB in the beginning and 91.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 415.61 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 91.2 MB in the beginning and 168.0 MB in the end (delta: -76.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23638.11 ms. Allocated memory was 200.8 MB in the beginning and 800.6 MB in the end (delta: 599.8 MB). Free memory was 167.0 MB in the beginning and 203.2 MB in the end (delta: -36.2 MB). Peak memory consumption was 563.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 25; VAL [a=25] [L13] int b = 0; VAL [a=25, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=25] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=25, m=0, n=25] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=24, m=1, n=24] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=23, m=2, n=23] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=22, m=3, n=22] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=21, m=4, n=21] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=20, m=5, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=19, m=6, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=18, m=7, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=17, m=8, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=16, m=9, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=15, m=10, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=14, m=11, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=13, m=12, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=12, m=13, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=11, m=14, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=10, m=15, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=9, m=16, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=8, m=17, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=7, m=18, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=6, m=19, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=20, \old(n)=5, m=20, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=21, \old(n)=4, m=21, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=22, \old(n)=3, m=22, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=23, \old(n)=2, m=23, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=24, \old(n)=1, m=24, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=25, \old(n)=0] [L4] COND TRUE n <= 0 VAL [\old(m)=25, \old(n)=0, m=25, n=0] [L5] return m + n; VAL [\old(m)=25, \old(n)=0, \result=25, m=25, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1, m=24, n=1, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=24, \old(n)=1, \result=25, m=24, n=1, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2, m=23, n=2, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=23, \old(n)=2, \result=25, m=23, n=2, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3, m=22, n=3, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=22, \old(n)=3, \result=25, m=22, n=3, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4, m=21, n=4, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=21, \old(n)=4, \result=25, m=21, n=4, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5, m=20, n=5, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=20, \old(n)=5, \result=25, m=20, n=5, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6, m=19, n=6, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=19, \old(n)=6, \result=25, m=19, n=6, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7, m=18, n=7, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=18, \old(n)=7, \result=25, m=18, n=7, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8, m=17, n=8, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=17, \old(n)=8, \result=25, m=17, n=8, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9, m=16, n=9, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=16, \old(n)=9, \result=25, m=16, n=9, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10, m=15, n=10, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=15, \old(n)=10, \result=25, m=15, n=10, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11, m=14, n=11, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=14, \old(n)=11, \result=25, m=14, n=11, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12, m=13, n=12, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=13, \old(n)=12, \result=25, m=13, n=12, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13, m=12, n=13, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=12, \old(n)=13, \result=25, m=12, n=13, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14, m=11, n=14, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=11, \old(n)=14, \result=25, m=11, n=14, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15, m=10, n=15, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=10, \old(n)=15, \result=25, m=10, n=15, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16, m=9, n=16, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=9, \old(n)=16, \result=25, m=9, n=16, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17, m=8, n=17, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=8, \old(n)=17, \result=25, m=8, n=17, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18, m=7, n=18, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=7, \old(n)=18, \result=25, m=7, n=18, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19, m=6, n=19, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=6, \old(n)=19, \result=25, m=6, n=19, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20, m=5, n=20, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=5, \old(n)=20, \result=25, m=5, n=20, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21, m=4, n=21, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=4, \old(n)=21, \result=25, m=4, n=21, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22, m=3, n=22, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=3, \old(n)=22, \result=25, m=3, n=22, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23, m=2, n=23, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=2, \old(n)=23, \result=25, m=2, n=23, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24, m=1, n=24, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=1, \old(n)=24, \result=25, m=1, n=24, sum(n - 1, m + 1)=25] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=25, m=0, n=25, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); VAL [\old(m)=0, \old(n)=25, \result=25, m=0, n=25, sum(n - 1, m + 1)=25] [L14] RET, EXPR sum(a, b) VAL [a=25, b=0, sum(a, b)=25] [L14] int result = sum(a, b); VAL [a=25, b=0, result=25, sum(a, b)=25] [L15] COND TRUE result == a + b VAL [a=25, b=0, result=25] [L16] __VERIFIER_error() VAL [a=25, b=0, result=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.5s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 453 SDtfs, 1562 SDslu, 2581 SDs, 0 SdLazy, 1111 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1425 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 3393 NumberOfCodeBlocks, 3393 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3125 ConstructedInterpolants, 0 QuantifiedInterpolants, 1326875 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 10100/22200 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...