/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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 17:22:42,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 17:22:42,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 17:22:42,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 17:22:42,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 17:22:42,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 17:22:42,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 17:22:42,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 17:22:42,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 17:22:42,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 17:22:42,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 17:22:42,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 17:22:42,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 17:22:42,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 17:22:42,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 17:22:42,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 17:22:42,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 17:22:42,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 17:22:42,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 17:22:42,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 17:22:42,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 17:22:42,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 17:22:42,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 17:22:42,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 17:22:42,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 17:22:42,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 17:22:42,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 17:22:42,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 17:22:42,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 17:22:42,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 17:22:42,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 17:22:42,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 17:22:42,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 17:22:42,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 17:22:42,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 17:22:42,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 17:22:42,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 17:22:42,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 17:22:42,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 17:22:42,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 17:22:42,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 17:22:42,346 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:42,360 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 17:22:42,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 17:22:42,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 17:22:42,362 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 17:22:42,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 17:22:42,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 17:22:42,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 17:22:42,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 17:22:42,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 17:22:42,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 17:22:42,365 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 17:22:42,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 17:22:42,365 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 17:22:42,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 17:22:42,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 17:22:42,367 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 17:22:42,367 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 17:22:42,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 17:22:42,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:22:42,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 17:22:42,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 17:22:42,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 17:22:42,369 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:42,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 17:22:42,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 17:22:42,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 17:22:42,704 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 17:22:42,704 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 17:22:42,705 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_25x0-1.c [2020-07-17 17:22:42,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d87e7242/c09558fb28ac4502a233d7f48f2cc38e/FLAG17faf4712 [2020-07-17 17:22:43,261 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 17:22:43,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_25x0-1.c [2020-07-17 17:22:43,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d87e7242/c09558fb28ac4502a233d7f48f2cc38e/FLAG17faf4712 [2020-07-17 17:22:43,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d87e7242/c09558fb28ac4502a233d7f48f2cc38e [2020-07-17 17:22:43,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 17:22:43,650 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 17:22:43,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 17:22:43,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 17:22:43,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 17:22:43,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:22:43" (1/1) ... [2020-07-17 17:22:43,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d890f0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:43, skipping insertion in model container [2020-07-17 17:22:43,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:22:43" (1/1) ... [2020-07-17 17:22:43,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 17:22:43,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 17:22:43,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:22:43,903 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 17:22:43,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:22:43,931 INFO L208 MainTranslator]: Completed translation [2020-07-17 17:22:43,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:43 WrapperNode [2020-07-17 17:22:43,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 17:22:43,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 17:22:43,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 17:22:43,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 17:22:43,946 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:43" (1/1) ... [2020-07-17 17:22:43,946 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:43" (1/1) ... [2020-07-17 17:22:43,950 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:43" (1/1) ... [2020-07-17 17:22:43,951 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:43" (1/1) ... [2020-07-17 17:22:43,954 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:43" (1/1) ... [2020-07-17 17:22:43,956 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:43" (1/1) ... [2020-07-17 17:22:43,957 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:43" (1/1) ... [2020-07-17 17:22:43,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 17:22:43,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 17:22:43,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 17:22:43,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 17:22:43,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:43" (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:44,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 17:22:44,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 17:22:44,108 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-17 17:22:44,108 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 17:22:44,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 17:22:44,108 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-17 17:22:44,108 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 17:22:44,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 17:22:44,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 17:22:44,293 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 17:22:44,293 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 17:22:44,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:22:44 BoogieIcfgContainer [2020-07-17 17:22:44,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 17:22:44,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 17:22:44,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 17:22:44,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 17:22:44,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 05:22:43" (1/3) ... [2020-07-17 17:22:44,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ea815b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:22:44, skipping insertion in model container [2020-07-17 17:22:44,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:43" (2/3) ... [2020-07-17 17:22:44,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ea815b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:22:44, skipping insertion in model container [2020-07-17 17:22:44,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:22:44" (3/3) ... [2020-07-17 17:22:44,307 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_25x0-1.c [2020-07-17 17:22:44,318 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 17:22:44,326 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 17:22:44,343 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 17:22:44,406 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 17:22:44,407 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 17:22:44,407 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-17 17:22:44,407 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 17:22:44,407 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 17:22:44,407 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 17:22:44,407 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 17:22:44,408 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 17:22:44,445 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-17 17:22:44,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 17:22:44,472 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:44,474 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:44,474 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:44,484 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-07-17 17:22:44,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:44,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [721016347] [2020-07-17 17:22:44,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:44,743 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:44,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [721016347] [2020-07-17 17:22:44,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:22:44,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:22:44,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047029618] [2020-07-17 17:22:44,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:22:44,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:44,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:22:44,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:22:44,773 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-07-17 17:22:44,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:44,861 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-07-17 17:22:44,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:22:44,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-17 17:22:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:44,876 INFO L225 Difference]: With dead ends: 39 [2020-07-17 17:22:44,876 INFO L226 Difference]: Without dead ends: 25 [2020-07-17 17:22:44,881 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:22:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-17 17:22:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-17 17:22:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 17:22:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-17 17:22:44,935 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-07-17 17:22:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:44,936 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-17 17:22:44,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:22:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-17 17:22:44,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 17:22:44,939 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:44,939 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:44,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 17:22:44,940 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:44,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:44,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-07-17 17:22:44,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:44,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1930728036] [2020-07-17 17:22:44,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,081 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:45,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1930728036] [2020-07-17 17:22:45,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:45,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 17:22:45,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935236606] [2020-07-17 17:22:45,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 17:22:45,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:45,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 17:22:45,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:22:45,086 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2020-07-17 17:22:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:45,155 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-17 17:22:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 17:22:45,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-17 17:22:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:45,158 INFO L225 Difference]: With dead ends: 36 [2020-07-17 17:22:45,158 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 17:22:45,160 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:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 17:22:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 17:22:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 17:22:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-17 17:22:45,177 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2020-07-17 17:22:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:45,179 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-17 17:22:45,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 17:22:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-17 17:22:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-17 17:22:45,181 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:45,182 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:45,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 17:22:45,184 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:45,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:45,184 INFO L82 PathProgramCache]: Analyzing trace with hash -175020829, now seen corresponding path program 2 times [2020-07-17 17:22:45,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:45,185 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [936017046] [2020-07-17 17:22:45,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,443 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:45,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [936017046] [2020-07-17 17:22:45,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:45,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:22:45,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651048142] [2020-07-17 17:22:45,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:22:45,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:45,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:22:45,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:22:45,446 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2020-07-17 17:22:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:45,599 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-07-17 17:22:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 17:22:45,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-17 17:22:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:45,603 INFO L225 Difference]: With dead ends: 41 [2020-07-17 17:22:45,605 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 17:22:45,606 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:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 17:22:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-17 17:22:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 17:22:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-07-17 17:22:45,629 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 36 [2020-07-17 17:22:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:45,631 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-07-17 17:22:45,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:22:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-07-17 17:22:45,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-17 17:22:45,634 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:45,635 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:45,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 17:22:45,636 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:45,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:45,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1021564803, now seen corresponding path program 3 times [2020-07-17 17:22:45,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:45,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2066413769] [2020-07-17 17:22:45,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,842 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:45,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2066413769] [2020-07-17 17:22:45,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:45,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:22:45,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292851772] [2020-07-17 17:22:45,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:22:45,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:45,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:22:45,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:22:45,845 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 8 states. [2020-07-17 17:22:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:45,924 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-17 17:22:45,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 17:22:45,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-17 17:22:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:45,926 INFO L225 Difference]: With dead ends: 46 [2020-07-17 17:22:45,926 INFO L226 Difference]: Without dead ends: 40 [2020-07-17 17:22:45,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:22:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-17 17:22:45,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-17 17:22:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 17:22:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-07-17 17:22:45,938 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 45 [2020-07-17 17:22:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:45,938 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-07-17 17:22:45,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:22:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-07-17 17:22:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-17 17:22:45,940 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:45,940 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:45,941 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 17:22:45,941 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:45,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:45,941 INFO L82 PathProgramCache]: Analyzing trace with hash -263249715, now seen corresponding path program 4 times [2020-07-17 17:22:45,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:45,942 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [747732909] [2020-07-17 17:22:45,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,123 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:46,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [747732909] [2020-07-17 17:22:46,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:46,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-17 17:22:46,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986761139] [2020-07-17 17:22:46,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 17:22:46,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:46,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 17:22:46,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-17 17:22:46,126 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2020-07-17 17:22:46,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:46,210 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-07-17 17:22:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 17:22:46,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-07-17 17:22:46,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:46,212 INFO L225 Difference]: With dead ends: 51 [2020-07-17 17:22:46,213 INFO L226 Difference]: Without dead ends: 45 [2020-07-17 17:22:46,214 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:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-17 17:22:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-17 17:22:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-17 17:22:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-07-17 17:22:46,228 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 54 [2020-07-17 17:22:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:46,229 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-07-17 17:22:46,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 17:22:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-07-17 17:22:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-17 17:22:46,230 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:46,231 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:46,231 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 17:22:46,231 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:46,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:46,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1884999187, now seen corresponding path program 5 times [2020-07-17 17:22:46,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:46,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1066286437] [2020-07-17 17:22:46,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,417 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:46,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1066286437] [2020-07-17 17:22:46,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:46,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:22:46,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796130313] [2020-07-17 17:22:46,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:22:46,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:46,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:22:46,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:22:46,421 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 10 states. [2020-07-17 17:22:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:46,528 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-07-17 17:22:46,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 17:22:46,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-07-17 17:22:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:46,530 INFO L225 Difference]: With dead ends: 56 [2020-07-17 17:22:46,531 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 17:22:46,532 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:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 17:22:46,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-17 17:22:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-17 17:22:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-07-17 17:22:46,543 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 63 [2020-07-17 17:22:46,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:46,543 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-07-17 17:22:46,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:22:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-17 17:22:46,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-17 17:22:46,545 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:46,546 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:46,546 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 17:22:46,546 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:46,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:46,547 INFO L82 PathProgramCache]: Analyzing trace with hash -441437769, now seen corresponding path program 6 times [2020-07-17 17:22:46,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:46,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [959619172] [2020-07-17 17:22:46,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,798 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:46,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [959619172] [2020-07-17 17:22:46,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:46,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-17 17:22:46,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289013861] [2020-07-17 17:22:46,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 17:22:46,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:46,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 17:22:46,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:22:46,801 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 11 states. [2020-07-17 17:22:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:46,939 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-07-17 17:22:46,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 17:22:46,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-07-17 17:22:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:46,942 INFO L225 Difference]: With dead ends: 61 [2020-07-17 17:22:46,942 INFO L226 Difference]: Without dead ends: 55 [2020-07-17 17:22:46,943 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:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-17 17:22:46,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-17 17:22:46,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 17:22:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-07-17 17:22:46,953 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 72 [2020-07-17 17:22:46,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:46,954 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-07-17 17:22:46,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 17:22:46,954 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-07-17 17:22:46,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-07-17 17:22:46,955 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:46,956 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:46,956 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 17:22:46,956 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:46,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:46,957 INFO L82 PathProgramCache]: Analyzing trace with hash 999943849, now seen corresponding path program 7 times [2020-07-17 17:22:46,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:46,957 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [874803580] [2020-07-17 17:22:46,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,222 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:47,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [874803580] [2020-07-17 17:22:47,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:47,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-17 17:22:47,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871429299] [2020-07-17 17:22:47,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 17:22:47,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:47,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 17:22:47,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:22:47,225 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 12 states. [2020-07-17 17:22:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:47,360 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-07-17 17:22:47,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 17:22:47,361 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-07-17 17:22:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:47,363 INFO L225 Difference]: With dead ends: 66 [2020-07-17 17:22:47,363 INFO L226 Difference]: Without dead ends: 60 [2020-07-17 17:22:47,364 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:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-17 17:22:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-07-17 17:22:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-17 17:22:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-07-17 17:22:47,374 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 81 [2020-07-17 17:22:47,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:47,375 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-07-17 17:22:47,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 17:22:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-07-17 17:22:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-17 17:22:47,377 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:47,377 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:47,377 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 17:22:47,378 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:47,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:47,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1356134305, now seen corresponding path program 8 times [2020-07-17 17:22:47,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:47,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [370346794] [2020-07-17 17:22:47,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,697 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:47,698 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [370346794] [2020-07-17 17:22:47,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:47,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-17 17:22:47,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981045000] [2020-07-17 17:22:47,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 17:22:47,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:47,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 17:22:47,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-07-17 17:22:47,701 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 13 states. [2020-07-17 17:22:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:47,844 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-07-17 17:22:47,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 17:22:47,845 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-07-17 17:22:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:47,847 INFO L225 Difference]: With dead ends: 71 [2020-07-17 17:22:47,847 INFO L226 Difference]: Without dead ends: 65 [2020-07-17 17:22:47,848 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:47,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-17 17:22:47,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-07-17 17:22:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-17 17:22:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-07-17 17:22:47,858 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 90 [2020-07-17 17:22:47,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:47,858 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-07-17 17:22:47,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 17:22:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-07-17 17:22:47,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-17 17:22:47,860 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:47,860 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:47,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 17:22:47,861 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:47,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:47,861 INFO L82 PathProgramCache]: Analyzing trace with hash -928437697, now seen corresponding path program 9 times [2020-07-17 17:22:47,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:47,862 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1780216460] [2020-07-17 17:22:47,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,204 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:48,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1780216460] [2020-07-17 17:22:48,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:48,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-17 17:22:48,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652127482] [2020-07-17 17:22:48,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 17:22:48,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:48,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 17:22:48,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:22:48,207 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2020-07-17 17:22:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:48,362 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-07-17 17:22:48,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 17:22:48,362 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-07-17 17:22:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:48,364 INFO L225 Difference]: With dead ends: 76 [2020-07-17 17:22:48,364 INFO L226 Difference]: Without dead ends: 70 [2020-07-17 17:22:48,365 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:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-17 17:22:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-17 17:22:48,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-17 17:22:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-07-17 17:22:48,376 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 99 [2020-07-17 17:22:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:48,377 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-07-17 17:22:48,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 17:22:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-07-17 17:22:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-17 17:22:48,379 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:48,379 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:48,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 17:22:48,379 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:48,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:48,380 INFO L82 PathProgramCache]: Analyzing trace with hash -276966773, now seen corresponding path program 10 times [2020-07-17 17:22:48,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:48,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [558205691] [2020-07-17 17:22:48,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,814 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:48,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [558205691] [2020-07-17 17:22:48,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:48,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-17 17:22:48,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275549525] [2020-07-17 17:22:48,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 17:22:48,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:48,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 17:22:48,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-07-17 17:22:48,818 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 15 states. [2020-07-17 17:22:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:49,018 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-07-17 17:22:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 17:22:49,019 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-07-17 17:22:49,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:49,020 INFO L225 Difference]: With dead ends: 81 [2020-07-17 17:22:49,020 INFO L226 Difference]: Without dead ends: 75 [2020-07-17 17:22:49,021 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-07-17 17:22:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-17 17:22:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-07-17 17:22:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-17 17:22:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-07-17 17:22:49,031 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 108 [2020-07-17 17:22:49,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:49,031 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-07-17 17:22:49,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 17:22:49,031 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-07-17 17:22:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-17 17:22:49,033 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:49,034 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:49,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 17:22:49,034 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:49,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:49,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1749540651, now seen corresponding path program 11 times [2020-07-17 17:22:49,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:49,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1820333730] [2020-07-17 17:22:49,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,508 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:49,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1820333730] [2020-07-17 17:22:49,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:49,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-17 17:22:49,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697720058] [2020-07-17 17:22:49,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 17:22:49,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:49,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 17:22:49,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-07-17 17:22:49,511 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 16 states. [2020-07-17 17:22:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:49,700 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-07-17 17:22:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 17:22:49,701 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-07-17 17:22:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:49,702 INFO L225 Difference]: With dead ends: 86 [2020-07-17 17:22:49,703 INFO L226 Difference]: Without dead ends: 80 [2020-07-17 17:22:49,704 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:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-17 17:22:49,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-07-17 17:22:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-17 17:22:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2020-07-17 17:22:49,715 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 117 [2020-07-17 17:22:49,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:49,716 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2020-07-17 17:22:49,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 17:22:49,717 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2020-07-17 17:22:49,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-07-17 17:22:49,718 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:49,718 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:49,719 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 17:22:49,719 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:49,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:49,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1141580405, now seen corresponding path program 12 times [2020-07-17 17:22:49,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:49,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1008736444] [2020-07-17 17:22:49,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,358 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:50,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1008736444] [2020-07-17 17:22:50,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:50,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-17 17:22:50,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408502721] [2020-07-17 17:22:50,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-17 17:22:50,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:50,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-17 17:22:50,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-07-17 17:22:50,362 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 17 states. [2020-07-17 17:22:50,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:50,566 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-07-17 17:22:50,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-17 17:22:50,567 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-07-17 17:22:50,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:50,568 INFO L225 Difference]: With dead ends: 91 [2020-07-17 17:22:50,568 INFO L226 Difference]: Without dead ends: 85 [2020-07-17 17:22:50,569 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:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-17 17:22:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-07-17 17:22:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-17 17:22:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2020-07-17 17:22:50,579 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 126 [2020-07-17 17:22:50,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:50,579 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2020-07-17 17:22:50,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-17 17:22:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2020-07-17 17:22:50,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-07-17 17:22:50,581 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:50,582 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:50,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 17:22:50,582 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:50,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:50,582 INFO L82 PathProgramCache]: Analyzing trace with hash 55997035, now seen corresponding path program 13 times [2020-07-17 17:22:50,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:50,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2032322692] [2020-07-17 17:22:50,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,861 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,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,254 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:51,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2032322692] [2020-07-17 17:22:51,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:51,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-07-17 17:22:51,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122491932] [2020-07-17 17:22:51,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-17 17:22:51,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:51,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-17 17:22:51,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-07-17 17:22:51,257 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 18 states. [2020-07-17 17:22:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:51,500 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-07-17 17:22:51,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 17:22:51,501 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-07-17 17:22:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:51,502 INFO L225 Difference]: With dead ends: 96 [2020-07-17 17:22:51,502 INFO L226 Difference]: Without dead ends: 90 [2020-07-17 17:22:51,504 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:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-17 17:22:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-07-17 17:22:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-17 17:22:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-07-17 17:22:51,517 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 135 [2020-07-17 17:22:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:51,517 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-07-17 17:22:51,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-17 17:22:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-07-17 17:22:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-07-17 17:22:51,521 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:51,521 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:51,521 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 17:22:51,522 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:51,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:51,522 INFO L82 PathProgramCache]: Analyzing trace with hash 394086239, now seen corresponding path program 14 times [2020-07-17 17:22:51,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:51,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2086158526] [2020-07-17 17:22:51,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,247 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:52,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2086158526] [2020-07-17 17:22:52,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:52,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-07-17 17:22:52,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858473800] [2020-07-17 17:22:52,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 17:22:52,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:52,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 17:22:52,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-07-17 17:22:52,250 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 19 states. [2020-07-17 17:22:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:52,507 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-07-17 17:22:52,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 17:22:52,508 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-07-17 17:22:52,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:52,510 INFO L225 Difference]: With dead ends: 101 [2020-07-17 17:22:52,510 INFO L226 Difference]: Without dead ends: 95 [2020-07-17 17:22:52,513 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:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-17 17:22:52,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-07-17 17:22:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-17 17:22:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2020-07-17 17:22:52,523 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 144 [2020-07-17 17:22:52,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:52,527 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2020-07-17 17:22:52,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 17:22:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2020-07-17 17:22:52,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-07-17 17:22:52,529 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:52,529 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:52,529 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 17:22:52,530 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:52,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:52,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1047772929, now seen corresponding path program 15 times [2020-07-17 17:22:52,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:52,531 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [147998895] [2020-07-17 17:22:52,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,395 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:53,396 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [147998895] [2020-07-17 17:22:53,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:53,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-17 17:22:53,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599012808] [2020-07-17 17:22:53,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-17 17:22:53,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:53,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-17 17:22:53,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-07-17 17:22:53,401 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 20 states. [2020-07-17 17:22:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:53,628 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-07-17 17:22:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-17 17:22:53,628 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-07-17 17:22:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:53,630 INFO L225 Difference]: With dead ends: 106 [2020-07-17 17:22:53,630 INFO L226 Difference]: Without dead ends: 100 [2020-07-17 17:22:53,631 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:53,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-17 17:22:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2020-07-17 17:22:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-17 17:22:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2020-07-17 17:22:53,645 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 153 [2020-07-17 17:22:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:53,647 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2020-07-17 17:22:53,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-17 17:22:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2020-07-17 17:22:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-07-17 17:22:53,649 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:53,649 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:53,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-17 17:22:53,650 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:53,650 INFO L82 PathProgramCache]: Analyzing trace with hash -76242615, now seen corresponding path program 16 times [2020-07-17 17:22:53,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:53,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1286469224] [2020-07-17 17:22:53,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:53,936 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,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,600 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:22:54,600 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1286469224] [2020-07-17 17:22:54,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:54,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-07-17 17:22:54,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631489042] [2020-07-17 17:22:54,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-17 17:22:54,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:54,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-17 17:22:54,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-07-17 17:22:54,604 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 21 states. [2020-07-17 17:22:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:54,859 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-07-17 17:22:54,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-17 17:22:54,859 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2020-07-17 17:22:54,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:54,861 INFO L225 Difference]: With dead ends: 111 [2020-07-17 17:22:54,861 INFO L226 Difference]: Without dead ends: 105 [2020-07-17 17:22:54,862 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2020-07-17 17:22:54,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-17 17:22:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-07-17 17:22:54,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-17 17:22:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2020-07-17 17:22:54,873 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 162 [2020-07-17 17:22:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:54,874 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2020-07-17 17:22:54,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-17 17:22:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2020-07-17 17:22:54,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-07-17 17:22:54,877 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:54,877 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:22:54,877 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-17 17:22:54,878 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:54,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:54,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1382000279, now seen corresponding path program 17 times [2020-07-17 17:22:54,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:54,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [691470817] [2020-07-17 17:22:54,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,085 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:22:56,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [691470817] [2020-07-17 17:22:56,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:56,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-07-17 17:22:56,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613592086] [2020-07-17 17:22:56,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-17 17:22:56,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:56,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-17 17:22:56,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-07-17 17:22:56,094 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 22 states. [2020-07-17 17:22:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:56,355 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2020-07-17 17:22:56,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-17 17:22:56,355 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 171 [2020-07-17 17:22:56,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:56,357 INFO L225 Difference]: With dead ends: 116 [2020-07-17 17:22:56,357 INFO L226 Difference]: Without dead ends: 110 [2020-07-17 17:22:56,358 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:22:56,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-17 17:22:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-07-17 17:22:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-17 17:22:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2020-07-17 17:22:56,370 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 171 [2020-07-17 17:22:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:56,370 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2020-07-17 17:22:56,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-17 17:22:56,371 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2020-07-17 17:22:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-07-17 17:22:56,373 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:56,373 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:22:56,373 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-17 17:22:56,373 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:56,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:56,374 INFO L82 PathProgramCache]: Analyzing trace with hash -869167053, now seen corresponding path program 18 times [2020-07-17 17:22:56,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:56,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2081662499] [2020-07-17 17:22:56,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,886 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,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,403 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:22:57,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2081662499] [2020-07-17 17:22:57,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:57,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-07-17 17:22:57,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966996444] [2020-07-17 17:22:57,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-17 17:22:57,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:57,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-17 17:22:57,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-07-17 17:22:57,408 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 23 states. [2020-07-17 17:22:57,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:57,710 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2020-07-17 17:22:57,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-17 17:22:57,711 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2020-07-17 17:22:57,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:57,712 INFO L225 Difference]: With dead ends: 121 [2020-07-17 17:22:57,712 INFO L226 Difference]: Without dead ends: 115 [2020-07-17 17:22:57,714 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:22:57,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-07-17 17:22:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2020-07-17 17:22:57,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-07-17 17:22:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2020-07-17 17:22:57,725 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 180 [2020-07-17 17:22:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:57,726 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2020-07-17 17:22:57,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-17 17:22:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2020-07-17 17:22:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-07-17 17:22:57,728 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:57,728 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:22:57,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-17 17:22:57,729 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:57,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:57,729 INFO L82 PathProgramCache]: Analyzing trace with hash 482986285, now seen corresponding path program 19 times [2020-07-17 17:22:57,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:57,730 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1853324825] [2020-07-17 17:22:57,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,140 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:22:59,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1853324825] [2020-07-17 17:22:59,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:59,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-07-17 17:22:59,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483061281] [2020-07-17 17:22:59,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-17 17:22:59,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:59,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-17 17:22:59,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-07-17 17:22:59,143 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 24 states. [2020-07-17 17:22:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:59,441 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2020-07-17 17:22:59,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-17 17:22:59,442 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2020-07-17 17:22:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:59,443 INFO L225 Difference]: With dead ends: 126 [2020-07-17 17:22:59,443 INFO L226 Difference]: Without dead ends: 120 [2020-07-17 17:22:59,445 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:22:59,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-17 17:22:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-07-17 17:22:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-17 17:22:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2020-07-17 17:22:59,458 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 189 [2020-07-17 17:22:59,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:59,459 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2020-07-17 17:22:59,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-17 17:22:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2020-07-17 17:22:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-07-17 17:22:59,461 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:59,461 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:22:59,461 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-17 17:22:59,462 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:59,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:59,462 INFO L82 PathProgramCache]: Analyzing trace with hash 848589853, now seen corresponding path program 20 times [2020-07-17 17:22:59,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:59,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1838397663] [2020-07-17 17:22:59,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:00,873 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:00,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1838397663] [2020-07-17 17:23:00,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:00,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-07-17 17:23:00,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828927530] [2020-07-17 17:23:00,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-17 17:23:00,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:00,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-17 17:23:00,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2020-07-17 17:23:00,879 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 25 states. [2020-07-17 17:23:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:01,224 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2020-07-17 17:23:01,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-17 17:23:01,225 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 198 [2020-07-17 17:23:01,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:01,226 INFO L225 Difference]: With dead ends: 131 [2020-07-17 17:23:01,226 INFO L226 Difference]: Without dead ends: 125 [2020-07-17 17:23:01,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2020-07-17 17:23:01,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-07-17 17:23:01,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-07-17 17:23:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-07-17 17:23:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2020-07-17 17:23:01,238 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 198 [2020-07-17 17:23:01,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:01,241 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2020-07-17 17:23:01,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-17 17:23:01,241 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2020-07-17 17:23:01,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-07-17 17:23:01,246 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:01,246 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:01,246 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-17 17:23:01,247 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:01,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:01,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1304544963, now seen corresponding path program 21 times [2020-07-17 17:23:01,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:01,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1484613567] [2020-07-17 17:23:01,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,405 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:02,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1484613567] [2020-07-17 17:23:02,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:02,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-07-17 17:23:02,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537582738] [2020-07-17 17:23:02,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-07-17 17:23:02,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:02,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-07-17 17:23:02,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2020-07-17 17:23:02,408 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 26 states. [2020-07-17 17:23:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:02,770 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2020-07-17 17:23:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-17 17:23:02,770 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 207 [2020-07-17 17:23:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:02,772 INFO L225 Difference]: With dead ends: 136 [2020-07-17 17:23:02,772 INFO L226 Difference]: Without dead ends: 130 [2020-07-17 17:23:02,773 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:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-07-17 17:23:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-07-17 17:23:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-07-17 17:23:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2020-07-17 17:23:02,782 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 207 [2020-07-17 17:23:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:02,783 INFO L479 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2020-07-17 17:23:02,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-07-17 17:23:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2020-07-17 17:23:02,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-07-17 17:23:02,785 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:02,786 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:02,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-17 17:23:02,786 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:02,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:02,786 INFO L82 PathProgramCache]: Analyzing trace with hash 639479047, now seen corresponding path program 22 times [2020-07-17 17:23:02,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:02,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1851380294] [2020-07-17 17:23:02,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,016 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:04,017 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1851380294] [2020-07-17 17:23:04,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:04,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-07-17 17:23:04,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147845937] [2020-07-17 17:23:04,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-07-17 17:23:04,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:04,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-07-17 17:23:04,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2020-07-17 17:23:04,019 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 27 states. [2020-07-17 17:23:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:04,420 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2020-07-17 17:23:04,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-17 17:23:04,421 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 216 [2020-07-17 17:23:04,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:04,422 INFO L225 Difference]: With dead ends: 141 [2020-07-17 17:23:04,422 INFO L226 Difference]: Without dead ends: 135 [2020-07-17 17:23:04,424 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:04,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-07-17 17:23:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-07-17 17:23:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-07-17 17:23:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2020-07-17 17:23:04,432 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 216 [2020-07-17 17:23:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:04,433 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2020-07-17 17:23:04,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-07-17 17:23:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2020-07-17 17:23:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-07-17 17:23:04,436 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:04,436 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:04,436 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-17 17:23:04,437 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:04,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:04,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1706508121, now seen corresponding path program 23 times [2020-07-17 17:23:04,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:04,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [826443374] [2020-07-17 17:23:04,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:05,714 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:05,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [826443374] [2020-07-17 17:23:05,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:05,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-07-17 17:23:05,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213633143] [2020-07-17 17:23:05,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-07-17 17:23:05,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:05,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-07-17 17:23:05,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2020-07-17 17:23:05,717 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 28 states. [2020-07-17 17:23:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:06,109 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2020-07-17 17:23:06,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-17 17:23:06,110 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 225 [2020-07-17 17:23:06,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:06,112 INFO L225 Difference]: With dead ends: 146 [2020-07-17 17:23:06,112 INFO L226 Difference]: Without dead ends: 140 [2020-07-17 17:23:06,113 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:06,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-07-17 17:23:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2020-07-17 17:23:06,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-07-17 17:23:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2020-07-17 17:23:06,122 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 225 [2020-07-17 17:23:06,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:06,122 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2020-07-17 17:23:06,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-07-17 17:23:06,122 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2020-07-17 17:23:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-07-17 17:23:06,124 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:06,124 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:06,124 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-17 17:23:06,124 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:06,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:06,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1861065457, now seen corresponding path program 24 times [2020-07-17 17:23:06,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:06,125 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1639932351] [2020-07-17 17:23:06,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:07,668 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:07,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1639932351] [2020-07-17 17:23:07,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:07,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-07-17 17:23:07,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894402107] [2020-07-17 17:23:07,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-07-17 17:23:07,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:07,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-07-17 17:23:07,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2020-07-17 17:23:07,675 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 29 states. [2020-07-17 17:23:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:08,090 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2020-07-17 17:23:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-17 17:23:08,091 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 234 [2020-07-17 17:23:08,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:08,093 INFO L225 Difference]: With dead ends: 151 [2020-07-17 17:23:08,093 INFO L226 Difference]: Without dead ends: 145 [2020-07-17 17:23:08,095 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2020-07-17 17:23:08,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-07-17 17:23:08,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-07-17 17:23:08,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-07-17 17:23:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2020-07-17 17:23:08,103 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 234 [2020-07-17 17:23:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:08,104 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2020-07-17 17:23:08,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-07-17 17:23:08,104 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2020-07-17 17:23:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-07-17 17:23:08,105 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:08,106 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:08,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-17 17:23:08,106 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:08,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:08,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1283861777, now seen corresponding path program 25 times [2020-07-17 17:23:08,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:08,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [658983529] [2020-07-17 17:23:08,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 1524 proven. 50 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2020-07-17 17:23:12,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [658983529] [2020-07-17 17:23:12,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:12,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2020-07-17 17:23:12,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634832776] [2020-07-17 17:23:12,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2020-07-17 17:23:12,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:12,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2020-07-17 17:23:12,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=2818, Unknown=0, NotChecked=0, Total=3540 [2020-07-17 17:23:12,996 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 60 states. [2020-07-17 17:23:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:19,683 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2020-07-17 17:23:19,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2020-07-17 17:23:19,684 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 243 [2020-07-17 17:23:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:19,684 INFO L225 Difference]: With dead ends: 145 [2020-07-17 17:23:19,685 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 17:23:19,695 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2637 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=3968, Invalid=15214, Unknown=0, NotChecked=0, Total=19182 [2020-07-17 17:23:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 17:23:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 17:23:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 17:23:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 17:23:19,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 243 [2020-07-17 17:23:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:19,696 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 17:23:19,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 60 states. [2020-07-17 17:23:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 17:23:19,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 17:23:19,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-07-17 17:23:19,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 17:23:20,812 WARN L193 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 134 [2020-07-17 17:23:21,488 WARN L193 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 134 [2020-07-17 17:23:22,477 WARN L193 SmtUtils]: Spent 966.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 161 [2020-07-17 17:23:23,787 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 166 DAG size of output: 140 [2020-07-17 17:23:25,056 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 166 DAG size of output: 140 [2020-07-17 17:23:25,093 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:23:25,093 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:23:25,094 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:23:25,094 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 17:23:25,094 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 17:23:25,094 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:23:25,095 INFO L264 CegarLoopResult]: At program point sumEXIT(lines 3 9) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (<= |sum_#res| .cse2))) (or (and .cse0 .cse1 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7)) (and .cse0 .cse1 (<= |sum_#in~n| 3) (<= (+ |sum_#in~m| 3) |sum_#res|)) (and .cse0 (<= (+ |sum_#in~m| 10) |sum_#res|) .cse1 (<= |sum_#in~n| 10)) (and .cse0 (<= |sum_#in~n| 13) .cse1 (<= (+ |sum_#in~m| 13) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 2) .cse1 (<= (+ |sum_#in~m| 2) |sum_#res|)) (and (<= |sum_#in~n| 12) .cse0 (<= (+ |sum_#in~m| 12) |sum_#res|) .cse1) (and .cse0 (<= (+ |sum_#in~m| 20) |sum_#res|) .cse1 (<= |sum_#in~n| 20)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 11) |sum_#res|) (<= |sum_#in~n| 11)) (and .cse0 (<= |sum_#in~n| 17) .cse1 (<= (+ |sum_#in~m| 17) |sum_#res|)) (and (<= (+ |sum_#in~m| 9) |sum_#res|) .cse0 (<= |sum_#in~n| 9) .cse1) (and .cse0 .cse1 (<= |sum_#in~n| 14) (<= (+ |sum_#in~m| 14) |sum_#res|)) (and .cse0 (<= .cse2 |sum_#res|) (<= |sum_#res| |sum_#in~m|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 24) |sum_#res|)) (and .cse0 .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#res|)) (and .cse0 (<= (+ |sum_#in~m| 22) |sum_#res|) .cse1 (<= |sum_#in~n| 22)) (and (<= |sum_#in~n| 5) .cse0 (<= (+ |sum_#in~m| 5) |sum_#res|) .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 21) |sum_#res|) (<= |sum_#in~n| 21)) (and .cse0 .cse1 (<= |sum_#in~n| 4) (<= (+ |sum_#in~m| 4) |sum_#res|)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#in~n| 1) .cse0 (<= (+ |sum_#in~m| 1) |sum_#res|) .cse1) (and .cse0 (<= (+ |sum_#in~m| 18) |sum_#res|) .cse1 (<= |sum_#in~n| 18)) (and .cse0 .cse1 (<= |sum_#in~n| 23) (<= (+ |sum_#in~m| 23) |sum_#res|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 19) |sum_#res|) (<= |sum_#in~n| 19)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 16) |sum_#res|) (<= |sum_#in~n| 16)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 15) |sum_#res|) (<= |sum_#in~n| 15))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 24)) (and .cse3 (<= (+ |sum_#in~m| 25) |sum_#res|))))) [2020-07-17 17:23:25,096 INFO L264 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n)) [2020-07-17 17:23:25,096 INFO L264 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (= sum_~n |sum_#in~n|)) (.cse2 (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))) (or (and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#in~n| 1) .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 14) (<= (+ |sum_#in~m| 14) |sum_#t~ret0|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 25) |sum_#t~ret0|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 7) |sum_#t~ret0|) (<= |sum_#in~n| 7) .cse2) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 16) |sum_#t~ret0|) (<= |sum_#in~n| 16)) (and (<= |sum_#in~n| 12) .cse0 .cse1 (<= (+ |sum_#in~m| 12) |sum_#t~ret0|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 24) |sum_#t~ret0|) (<= |sum_#in~n| 24) .cse2) (and .cse0 (<= (+ |sum_#in~m| 4) |sum_#t~ret0|) .cse1 (<= |sum_#in~n| 4) .cse2) (and .cse0 (<= (+ |sum_#in~m| 6) |sum_#t~ret0|) .cse1 (<= |sum_#in~n| 6) .cse2) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret0|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 19) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 19)) (and .cse0 (<= (+ |sum_#in~m| 18) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 18)) (and .cse0 .cse1 (<= |sum_#in~n| 3) (<= (+ |sum_#in~m| 3) |sum_#t~ret0|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 10) (<= (+ |sum_#in~m| 10) |sum_#t~ret0|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 20) (<= (+ |sum_#in~m| 20) |sum_#t~ret0|) .cse2) (and (<= (+ |sum_#in~m| 8) |sum_#t~ret0|) .cse0 .cse1 (<= |sum_#in~n| 8) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 22) (<= (+ |sum_#in~m| 22) |sum_#t~ret0|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 23) (<= (+ |sum_#in~m| 23) |sum_#t~ret0|) .cse2) (and .cse0 (<= |sum_#in~n| 9) .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret0|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 11) |sum_#t~ret0|) .cse1 (<= |sum_#in~n| 11) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 15) .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret0|)) (and .cse0 .cse1 (<= |sum_#in~n| 17) (<= (+ |sum_#in~m| 17) |sum_#t~ret0|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 21) (<= (+ |sum_#in~m| 21) |sum_#t~ret0|) .cse2) (and .cse0 (<= |sum_#in~n| 2) .cse1 (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) .cse2) (and .cse0 (<= |sum_#in~n| 13) .cse1 (<= (+ |sum_#in~m| 13) |sum_#t~ret0|) .cse2))) [2020-07-17 17:23:25,096 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= |sum_#in~n| 0)) [2020-07-17 17:23:25,097 INFO L264 CegarLoopResult]: At program point L7-2(line 7) the Hoare annotation is: (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (= sum_~n |sum_#in~n|)) (.cse2 (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))) (or (and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#in~n| 1) .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 14) (<= (+ |sum_#in~m| 14) |sum_#t~ret0|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 25) |sum_#t~ret0|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 7) |sum_#t~ret0|) (<= |sum_#in~n| 7) .cse2) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 16) |sum_#t~ret0|) (<= |sum_#in~n| 16)) (and (<= |sum_#in~n| 12) .cse0 .cse1 (<= (+ |sum_#in~m| 12) |sum_#t~ret0|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 24) |sum_#t~ret0|) (<= |sum_#in~n| 24) .cse2) (and .cse0 (<= (+ |sum_#in~m| 4) |sum_#t~ret0|) .cse1 (<= |sum_#in~n| 4) .cse2) (and .cse0 (<= (+ |sum_#in~m| 6) |sum_#t~ret0|) .cse1 (<= |sum_#in~n| 6) .cse2) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret0|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 19) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 19)) (and .cse0 (<= (+ |sum_#in~m| 18) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 18)) (and .cse0 .cse1 (<= |sum_#in~n| 3) (<= (+ |sum_#in~m| 3) |sum_#t~ret0|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 10) (<= (+ |sum_#in~m| 10) |sum_#t~ret0|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 20) (<= (+ |sum_#in~m| 20) |sum_#t~ret0|) .cse2) (and (<= (+ |sum_#in~m| 8) |sum_#t~ret0|) .cse0 .cse1 (<= |sum_#in~n| 8) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 22) (<= (+ |sum_#in~m| 22) |sum_#t~ret0|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 23) (<= (+ |sum_#in~m| 23) |sum_#t~ret0|) .cse2) (and .cse0 (<= |sum_#in~n| 9) .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret0|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 11) |sum_#t~ret0|) .cse1 (<= |sum_#in~n| 11) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 15) .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret0|)) (and .cse0 .cse1 (<= |sum_#in~n| 17) (<= (+ |sum_#in~m| 17) |sum_#t~ret0|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 21) (<= (+ |sum_#in~m| 21) |sum_#t~ret0|) .cse2) (and .cse0 (<= |sum_#in~n| 2) .cse1 (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) .cse2) (and .cse0 (<= |sum_#in~n| 13) .cse1 (<= (+ |sum_#in~m| 13) |sum_#t~ret0|) .cse2))) [2020-07-17 17:23:25,097 INFO L264 CegarLoopResult]: At program point L4(lines 4 8) the Hoare annotation is: (and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|)) [2020-07-17 17:23:25,098 INFO L264 CegarLoopResult]: At program point L7-3(line 7) the Hoare annotation is: (let ((.cse29 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (= sum_~n |sum_#in~n|)) (.cse2 (<= |sum_#res| .cse29)) (.cse4 (<= |sum_#t~ret0| .cse29))) (or (let ((.cse3 (+ |sum_#in~m| 15))) (and .cse0 .cse1 .cse2 (<= .cse3 |sum_#res|) (<= |sum_#in~n| 15) .cse4 (<= .cse3 |sum_#t~ret0|))) (let ((.cse5 (+ |sum_#in~m| 20))) (and .cse0 .cse1 (<= .cse5 |sum_#res|) .cse2 (<= |sum_#in~n| 20) (<= .cse5 |sum_#t~ret0|) .cse4)) (let ((.cse6 (+ |sum_#in~m| 19))) (and .cse0 (<= .cse6 |sum_#t~ret0|) .cse1 .cse2 (<= .cse6 |sum_#res|) .cse4 (<= |sum_#in~n| 19))) (let ((.cse7 (+ |sum_#in~m| 1))) (and (<= .cse7 |sum_#t~ret0|) (<= |sum_#in~n| 1) .cse0 .cse1 (<= .cse7 |sum_#res|) .cse2 .cse4)) (let ((.cse8 (+ |sum_#in~m| 4))) (and .cse0 (<= .cse8 |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 4) (<= .cse8 |sum_#res|) .cse4)) (let ((.cse9 (+ |sum_#in~m| 18))) (and .cse0 (<= .cse9 |sum_#res|) (<= .cse9 |sum_#t~ret0|) .cse1 .cse2 .cse4 (<= |sum_#in~n| 18))) (let ((.cse10 (+ |sum_#in~m| 23))) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 23) (<= .cse10 |sum_#t~ret0|) (<= .cse10 |sum_#res|) .cse4)) (let ((.cse11 (+ |sum_#in~m| 24))) (and .cse0 .cse1 (<= .cse11 |sum_#t~ret0|) .cse2 (<= .cse11 |sum_#res|) (<= |sum_#in~n| 24) .cse4)) (let ((.cse12 (+ |sum_#in~m| 2))) (and .cse0 (<= |sum_#in~n| 2) .cse1 (<= .cse12 |sum_#t~ret0|) .cse2 (<= .cse12 |sum_#res|) .cse4)) (let ((.cse13 (+ |sum_#in~m| 6))) (and (<= .cse13 |sum_#res|) .cse0 (<= .cse13 |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 6) .cse4)) (let ((.cse14 (+ |sum_#in~m| 3))) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 3) (<= .cse14 |sum_#res|) (<= .cse14 |sum_#t~ret0|) .cse4)) (let ((.cse15 (+ |sum_#in~m| 9))) (and (<= .cse15 |sum_#res|) .cse0 (<= |sum_#in~n| 9) .cse1 .cse2 (<= .cse15 |sum_#t~ret0|) .cse4)) (let ((.cse16 (+ |sum_#in~m| 12))) (and (<= |sum_#in~n| 12) .cse0 .cse1 (<= .cse16 |sum_#res|) .cse2 (<= .cse16 |sum_#t~ret0|) .cse4)) (let ((.cse17 (+ |sum_#in~m| 8))) (and (<= .cse17 |sum_#t~ret0|) .cse0 .cse1 .cse2 (<= |sum_#in~n| 8) (<= .cse17 |sum_#res|) .cse4)) (let ((.cse18 (+ |sum_#in~m| 11))) (and .cse0 (<= .cse18 |sum_#t~ret0|) .cse1 .cse2 (<= .cse18 |sum_#res|) (<= |sum_#in~n| 11) .cse4)) (let ((.cse19 (+ |sum_#in~m| 7))) (and .cse0 .cse1 .cse2 (<= .cse19 |sum_#t~ret0|) (<= .cse19 |sum_#res|) (<= |sum_#in~n| 7) .cse4)) (let ((.cse20 (+ |sum_#in~m| 22))) (and .cse0 (<= .cse20 |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 22) (<= .cse20 |sum_#t~ret0|) .cse4)) (let ((.cse21 (+ |sum_#in~m| 14))) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 14) (<= .cse21 |sum_#res|) (<= .cse21 |sum_#t~ret0|) .cse4)) (let ((.cse22 (+ |sum_#in~m| 13))) (and .cse0 (<= |sum_#in~n| 13) .cse1 .cse2 (<= .cse22 |sum_#res|) (<= .cse22 |sum_#t~ret0|) .cse4)) (let ((.cse23 (+ |sum_#in~m| 25))) (and .cse0 .cse1 (<= .cse23 |sum_#t~ret0|) .cse2 (<= .cse23 |sum_#res|) .cse4)) (let ((.cse24 (+ |sum_#in~m| 5))) (and (<= |sum_#in~n| 5) .cse0 (<= .cse24 |sum_#res|) .cse1 .cse2 (<= .cse24 |sum_#t~ret0|) .cse4)) (let ((.cse25 (+ |sum_#in~m| 21))) (and .cse0 .cse1 .cse2 (<= .cse25 |sum_#res|) (<= |sum_#in~n| 21) (<= .cse25 |sum_#t~ret0|) .cse4)) (let ((.cse26 (+ |sum_#in~m| 16))) (and .cse0 .cse1 .cse2 (<= .cse26 |sum_#res|) .cse4 (<= .cse26 |sum_#t~ret0|) (<= |sum_#in~n| 16))) (let ((.cse27 (+ |sum_#in~m| 17))) (and .cse0 .cse1 (<= |sum_#in~n| 17) .cse2 (<= .cse27 |sum_#res|) (<= .cse27 |sum_#t~ret0|) .cse4)) (let ((.cse28 (+ |sum_#in~m| 10))) (and .cse0 (<= .cse28 |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 10) (<= .cse28 |sum_#t~ret0|) .cse4))))) [2020-07-17 17:23:25,098 INFO L264 CegarLoopResult]: At program point L3(lines 3 9) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-07-17 17:23:25,099 INFO L264 CegarLoopResult]: At program point sumFINAL(lines 3 9) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (<= |sum_#res| .cse2))) (or (and .cse0 .cse1 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7)) (and .cse0 .cse1 (<= |sum_#in~n| 3) (<= (+ |sum_#in~m| 3) |sum_#res|)) (and .cse0 (<= (+ |sum_#in~m| 10) |sum_#res|) .cse1 (<= |sum_#in~n| 10)) (and .cse0 (<= |sum_#in~n| 13) .cse1 (<= (+ |sum_#in~m| 13) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 2) .cse1 (<= (+ |sum_#in~m| 2) |sum_#res|)) (and (<= |sum_#in~n| 12) .cse0 (<= (+ |sum_#in~m| 12) |sum_#res|) .cse1) (and .cse0 (<= (+ |sum_#in~m| 20) |sum_#res|) .cse1 (<= |sum_#in~n| 20)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 11) |sum_#res|) (<= |sum_#in~n| 11)) (and .cse0 (<= |sum_#in~n| 17) .cse1 (<= (+ |sum_#in~m| 17) |sum_#res|)) (and (<= (+ |sum_#in~m| 9) |sum_#res|) .cse0 (<= |sum_#in~n| 9) .cse1) (and .cse0 .cse1 (<= |sum_#in~n| 14) (<= (+ |sum_#in~m| 14) |sum_#res|)) (and .cse0 (<= .cse2 |sum_#res|) (<= |sum_#res| |sum_#in~m|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 24) |sum_#res|)) (and .cse0 .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#res|)) (and .cse0 (<= (+ |sum_#in~m| 22) |sum_#res|) .cse1 (<= |sum_#in~n| 22)) (and (<= |sum_#in~n| 5) .cse0 (<= (+ |sum_#in~m| 5) |sum_#res|) .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 21) |sum_#res|) (<= |sum_#in~n| 21)) (and .cse0 .cse1 (<= |sum_#in~n| 4) (<= (+ |sum_#in~m| 4) |sum_#res|)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#in~n| 1) .cse0 (<= (+ |sum_#in~m| 1) |sum_#res|) .cse1) (and .cse0 (<= (+ |sum_#in~m| 18) |sum_#res|) .cse1 (<= |sum_#in~n| 18)) (and .cse0 .cse1 (<= |sum_#in~n| 23) (<= (+ |sum_#in~m| 23) |sum_#res|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 19) |sum_#res|) (<= |sum_#in~n| 19)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 16) |sum_#res|) (<= |sum_#in~n| 16)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 15) |sum_#res|) (<= |sum_#in~n| 15))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 24)) (and .cse3 (<= (+ |sum_#in~m| 25) |sum_#res|))))) [2020-07-17 17:23:25,099 INFO L271 CegarLoopResult]: At program point sumENTRY(lines 3 9) the Hoare annotation is: true [2020-07-17 17:23:25,099 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: false [2020-07-17 17:23:25,099 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2020-07-17 17:23:25,099 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 11 18) the Hoare annotation is: (<= 25 main_~a~0) [2020-07-17 17:23:25,099 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: false [2020-07-17 17:23:25,100 INFO L264 CegarLoopResult]: At program point L15(lines 15 17) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= main_~a~0 25) (<= main_~result~0 .cse0) (<= .cse0 main_~result~0) (<= 25 main_~a~0))) [2020-07-17 17:23:25,100 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (and (<= main_~a~0 25) (<= 25 main_~a~0)) [2020-07-17 17:23:25,100 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= main_~a~0 25) (<= 25 main_~a~0)) [2020-07-17 17:23:25,100 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= main_~a~0 25) (<= .cse0 |main_#t~ret1|) (<= 25 main_~a~0) (<= |main_#t~ret1| .cse0))) [2020-07-17 17:23:25,100 INFO L264 CegarLoopResult]: At program point L15-2(lines 11 18) the Hoare annotation is: (<= 25 main_~a~0) [2020-07-17 17:23:25,100 INFO L264 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= main_~a~0 25) (<= .cse0 |main_#t~ret1|) (<= 25 main_~a~0) (<= |main_#t~ret1| .cse0))) [2020-07-17 17:23:25,100 INFO L264 CegarLoopResult]: At program point L14-3(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= main_~a~0 25) (<= .cse0 |main_#t~ret1|) (<= main_~result~0 .cse0) (<= .cse0 main_~result~0) (<= 25 main_~a~0) (<= |main_#t~ret1| .cse0))) [2020-07-17 17:23:25,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 05:23:25 BoogieIcfgContainer [2020-07-17 17:23:25,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 17:23:25,143 INFO L168 Benchmark]: Toolchain (without parser) took 41495.18 ms. Allocated memory was 143.7 MB in the beginning and 919.1 MB in the end (delta: 775.4 MB). Free memory was 101.9 MB in the beginning and 109.8 MB in the end (delta: -7.9 MB). Peak memory consumption was 767.5 MB. Max. memory is 7.1 GB. [2020-07-17 17:23:25,144 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 143.7 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 17:23:25,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.95 ms. Allocated memory is still 143.7 MB. Free memory was 101.5 MB in the beginning and 92.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-17 17:23:25,145 INFO L168 Benchmark]: Boogie Preprocessor took 25.98 ms. Allocated memory is still 143.7 MB. Free memory was 92.3 MB in the beginning and 91.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2020-07-17 17:23:25,148 INFO L168 Benchmark]: RCFGBuilder took 339.12 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 90.9 MB in the beginning and 168.6 MB in the end (delta: -77.8 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-17 17:23:25,151 INFO L168 Benchmark]: TraceAbstraction took 40840.87 ms. Allocated memory was 200.8 MB in the beginning and 919.1 MB in the end (delta: 718.3 MB). Free memory was 167.9 MB in the beginning and 109.8 MB in the end (delta: 58.1 MB). Peak memory consumption was 776.4 MB. Max. memory is 7.1 GB. [2020-07-17 17:23:25,156 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.23 ms. Allocated memory is still 143.7 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 280.95 ms. Allocated memory is still 143.7 MB. Free memory was 101.5 MB in the beginning and 92.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.98 ms. Allocated memory is still 143.7 MB. Free memory was 92.3 MB in the beginning and 91.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 339.12 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 90.9 MB in the beginning and 168.6 MB in the end (delta: -77.8 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40840.87 ms. Allocated memory was 200.8 MB in the beginning and 919.1 MB in the end (delta: 718.3 MB). Free memory was 167.9 MB in the beginning and 109.8 MB in the end (delta: 58.1 MB). Peak memory consumption was 776.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 3]: Procedure Contract for sum Derived contract for procedure sum: (((((((((((((((((((((((((((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 7 <= \result) && \old(n) <= 7) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 3) && \old(m) + 3 <= \result)) || (((m == \old(m) && \old(m) + 10 <= \result) && \result <= \old(n) + \old(m)) && \old(n) <= 10)) || (((m == \old(m) && \old(n) <= 13) && \result <= \old(n) + \old(m)) && \old(m) + 13 <= \result)) || (((m == \old(m) && \old(n) <= 2) && \result <= \old(n) + \old(m)) && \old(m) + 2 <= \result)) || (((\old(n) <= 12 && m == \old(m)) && \old(m) + 12 <= \result) && \result <= \old(n) + \old(m))) || (((m == \old(m) && \old(m) + 20 <= \result) && \result <= \old(n) + \old(m)) && \old(n) <= 20)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 11 <= \result) && \old(n) <= 11)) || (((m == \old(m) && \old(n) <= 17) && \result <= \old(n) + \old(m)) && \old(m) + 17 <= \result)) || (((\old(m) + 9 <= \result && m == \old(m)) && \old(n) <= 9) && \result <= \old(n) + \old(m))) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 14) && \old(m) + 14 <= \result)) || ((m == \old(m) && \old(n) + \old(m) <= \result) && \result <= \old(m))) || ((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 24 <= \result)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 8) && \old(m) + 8 <= \result)) || (((m == \old(m) && \old(m) + 22 <= \result) && \result <= \old(n) + \old(m)) && \old(n) <= 22)) || (((\old(n) <= 5 && m == \old(m)) && \old(m) + 5 <= \result) && \result <= \old(n) + \old(m))) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 21 <= \result) && \old(n) <= 21)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 4) && \old(m) + 4 <= \result)) || (((\old(m) + 6 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 6)) || (((\old(n) <= 1 && m == \old(m)) && \old(m) + 1 <= \result) && \result <= \old(n) + \old(m))) || (((m == \old(m) && \old(m) + 18 <= \result) && \result <= \old(n) + \old(m)) && \old(n) <= 18)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 23) && \old(m) + 23 <= \result)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 19 <= \result) && \old(n) <= 19)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 16 <= \result) && \old(n) <= 16)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 15 <= \result) && \old(n) <= 15)) && ((n == \old(n) && \old(n) <= 24) || (n == \old(n) && \old(m) + 25 <= \result)) - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 25 <= a - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 35.3s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 515 SDtfs, 1601 SDslu, 3254 SDs, 0 SdLazy, 2463 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1642 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 837 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7537 ImplicationChecksByTransitivity, 15.8s 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.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 37 PreInvPairs, 412 NumberOfFragments, 2754 HoareAnnotationTreeSize, 37 FomulaSimplifications, 2690 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 27 FomulaSimplificationsInter, 1122 FormulaSimplificationTreeSizeReductionInter, 5.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 3393 NumberOfCodeBlocks, 3393 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3367 ConstructedInterpolants, 0 QuantifiedInterpolants, 1791999 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 1 PerfectInterpolantSequences, 12875/25025 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...