/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i25_o25-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:29:43,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:29:43,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:29:43,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:29:43,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:29:43,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:29:43,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:29:43,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:29:43,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:29:43,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:29:43,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:29:43,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:29:43,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:29:43,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:29:43,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:29:43,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:29:43,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:29:43,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:29:43,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:29:43,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:29:43,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:29:43,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:29:43,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:29:43,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:29:43,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:29:43,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:29:43,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:29:43,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:29:43,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:29:43,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:29:43,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:29:43,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:29:43,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:29:43,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:29:43,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:29:43,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:29:43,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:29:43,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:29:43,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:29:43,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:29:43,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:29:43,441 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 16:29:43,461 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:29:43,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:29:43,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:29:43,464 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:29:43,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:29:43,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:29:43,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:29:43,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:29:43,466 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:29:43,466 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:29:43,466 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:29:43,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:29:43,467 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:29:43,467 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:29:43,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:29:43,467 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:29:43,468 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:29:43,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:29:43,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:29:43,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:29:43,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:29:43,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:29:43,469 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:29:43,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:29:44,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:29:44,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:29:44,020 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:29:44,022 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:29:44,024 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i25_o25-1.c [2020-09-04 16:29:44,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/936db61d5/93e24f50e9eb44ec80d2ea3cf95b8484/FLAG78a72df19 [2020-09-04 16:29:44,888 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:29:44,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i25_o25-1.c [2020-09-04 16:29:44,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/936db61d5/93e24f50e9eb44ec80d2ea3cf95b8484/FLAG78a72df19 [2020-09-04 16:29:45,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/936db61d5/93e24f50e9eb44ec80d2ea3cf95b8484 [2020-09-04 16:29:45,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:29:45,247 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:29:45,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:29:45,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:29:45,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:29:45,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:29:45" (1/1) ... [2020-09-04 16:29:45,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2baf6fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:45, skipping insertion in model container [2020-09-04 16:29:45,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:29:45" (1/1) ... [2020-09-04 16:29:45,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:29:45,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:29:45,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:29:45,613 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:29:45,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:29:45,662 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:29:45,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:45 WrapperNode [2020-09-04 16:29:45,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:29:45,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:29:45,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:29:45,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:29:45,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:45" (1/1) ... [2020-09-04 16:29:45,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:45" (1/1) ... [2020-09-04 16:29:45,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:45" (1/1) ... [2020-09-04 16:29:45,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:45" (1/1) ... [2020-09-04 16:29:45,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:45" (1/1) ... [2020-09-04 16:29:45,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:45" (1/1) ... [2020-09-04 16:29:45,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:45" (1/1) ... [2020-09-04 16:29:45,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:29:45,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:29:45,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:29:45,715 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:29:45,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:45" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 16:29:45,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:29:45,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:29:45,977 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 16:29:45,977 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:29:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:29:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:29:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 16:29:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:29:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:29:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:29:46,202 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:29:46,202 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:29:46,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:29:46 BoogieIcfgContainer [2020-09-04 16:29:46,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:29:46,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:29:46,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:29:46,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:29:46,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:29:45" (1/3) ... [2020-09-04 16:29:46,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55121d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:29:46, skipping insertion in model container [2020-09-04 16:29:46,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:45" (2/3) ... [2020-09-04 16:29:46,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55121d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:29:46, skipping insertion in model container [2020-09-04 16:29:46,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:29:46" (3/3) ... [2020-09-04 16:29:46,220 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i25_o25-1.c [2020-09-04 16:29:46,234 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:29:46,244 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:29:46,269 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:29:46,299 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:29:46,299 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:29:46,299 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:29:46,300 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:29:46,300 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:29:46,300 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:29:46,300 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:29:46,300 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:29:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-09-04 16:29:46,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:29:46,334 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:46,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:46,336 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:46,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:46,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-09-04 16:29:46,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:46,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1493134845] [2020-09-04 16:29:46,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:46,442 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:29:46,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1493134845] [2020-09-04 16:29:46,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:46,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:29:46,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143688077] [2020-09-04 16:29:46,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:29:46,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:46,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:29:46,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:29:46,717 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-09-04 16:29:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:46,858 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-09-04 16:29:46,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:29:46,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:29:46,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:46,875 INFO L225 Difference]: With dead ends: 37 [2020-09-04 16:29:46,875 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 16:29:46,880 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-09-04 16:29:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 16:29:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-04 16:29:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-04 16:29:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-09-04 16:29:46,939 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-09-04 16:29:46,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:46,940 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-09-04 16:29:46,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:29:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-09-04 16:29:46,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 16:29:46,944 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:46,944 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:46,944 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:29:46,945 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:46,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:46,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-09-04 16:29:46,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:46,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1673222815] [2020-09-04 16:29:46,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:46,949 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:29:47,135 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1673222815] [2020-09-04 16:29:47,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:47,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:29:47,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568129544] [2020-09-04 16:29:47,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:29:47,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:47,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:29:47,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:29:47,144 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-09-04 16:29:47,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:47,227 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-04 16:29:47,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:29:47,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-04 16:29:47,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:47,230 INFO L225 Difference]: With dead ends: 34 [2020-09-04 16:29:47,230 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 16:29:47,233 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-09-04 16:29:47,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 16:29:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 16:29:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 16:29:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-09-04 16:29:47,245 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-09-04 16:29:47,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:47,246 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-09-04 16:29:47,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:29:47,247 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-09-04 16:29:47,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 16:29:47,249 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:47,249 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:47,249 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:29:47,250 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:47,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:47,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-09-04 16:29:47,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:47,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [317248688] [2020-09-04 16:29:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:47,255 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 16:29:47,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [317248688] [2020-09-04 16:29:47,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:47,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:29:47,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201929636] [2020-09-04 16:29:47,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:29:47,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:47,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:29:47,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:29:47,464 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-09-04 16:29:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:47,579 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-09-04 16:29:47,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:29:47,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-09-04 16:29:47,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:47,582 INFO L225 Difference]: With dead ends: 39 [2020-09-04 16:29:47,583 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 16:29:47,584 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-09-04 16:29:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 16:29:47,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-04 16:29:47,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-04 16:29:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-04 16:29:47,597 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-09-04 16:29:47,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:47,598 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-04 16:29:47,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:29:47,598 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-04 16:29:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 16:29:47,600 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:47,600 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:47,601 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:29:47,601 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:47,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:47,602 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-09-04 16:29:47,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:47,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1893213137] [2020-09-04 16:29:47,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:47,605 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-04 16:29:47,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1893213137] [2020-09-04 16:29:47,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:47,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:29:47,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208486786] [2020-09-04 16:29:47,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:29:47,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:47,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:29:47,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:29:47,927 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-09-04 16:29:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:48,073 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-09-04 16:29:48,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:29:48,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-09-04 16:29:48,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:48,076 INFO L225 Difference]: With dead ends: 44 [2020-09-04 16:29:48,076 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 16:29:48,078 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:29:48,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 16:29:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-09-04 16:29:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 16:29:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-09-04 16:29:48,091 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-09-04 16:29:48,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:48,092 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-09-04 16:29:48,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:29:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-09-04 16:29:48,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 16:29:48,094 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:48,094 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:48,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:29:48,095 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:48,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:48,096 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-09-04 16:29:48,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:48,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272181192] [2020-09-04 16:29:48,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:48,099 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,367 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 16:29:48,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [272181192] [2020-09-04 16:29:48,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:48,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:29:48,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164136224] [2020-09-04 16:29:48,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:29:48,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:48,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:29:48,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:29:48,370 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-09-04 16:29:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:48,464 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-04 16:29:48,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:29:48,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-09-04 16:29:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:48,467 INFO L225 Difference]: With dead ends: 49 [2020-09-04 16:29:48,467 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 16:29:48,468 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:29:48,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 16:29:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-09-04 16:29:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-09-04 16:29:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-09-04 16:29:48,479 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-09-04 16:29:48,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:48,480 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-09-04 16:29:48,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:29:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-09-04 16:29:48,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 16:29:48,482 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:48,482 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:48,482 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:29:48,483 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:48,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:48,483 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-09-04 16:29:48,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:48,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1174854102] [2020-09-04 16:29:48,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:48,486 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 16:29:48,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1174854102] [2020-09-04 16:29:48,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:48,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:29:48,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970238539] [2020-09-04 16:29:48,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:29:48,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:48,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:29:48,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:29:48,772 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 10 states. [2020-09-04 16:29:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:48,891 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-09-04 16:29:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:29:48,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2020-09-04 16:29:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:48,894 INFO L225 Difference]: With dead ends: 54 [2020-09-04 16:29:48,894 INFO L226 Difference]: Without dead ends: 48 [2020-09-04 16:29:48,895 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-09-04 16:29:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-04 16:29:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-04 16:29:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-04 16:29:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-04 16:29:48,908 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 56 [2020-09-04 16:29:48,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:48,909 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-04 16:29:48,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:29:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-04 16:29:48,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 16:29:48,912 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:48,912 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:48,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:29:48,913 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:48,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:48,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1000802417, now seen corresponding path program 6 times [2020-09-04 16:29:48,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:48,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1925983877] [2020-09-04 16:29:48,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:48,917 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-09-04 16:29:49,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1925983877] [2020-09-04 16:29:49,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:49,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:29:49,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867779540] [2020-09-04 16:29:49,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:29:49,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:49,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:29:49,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:29:49,204 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2020-09-04 16:29:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:49,320 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-09-04 16:29:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:29:49,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-09-04 16:29:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:49,323 INFO L225 Difference]: With dead ends: 59 [2020-09-04 16:29:49,323 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 16:29:49,324 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-09-04 16:29:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 16:29:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-09-04 16:29:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-09-04 16:29:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-09-04 16:29:49,334 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 64 [2020-09-04 16:29:49,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:49,335 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-09-04 16:29:49,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:29:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-09-04 16:29:49,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 16:29:49,337 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:49,337 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:49,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:29:49,337 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:49,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:49,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1977618599, now seen corresponding path program 7 times [2020-09-04 16:29:49,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:49,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [32125541] [2020-09-04 16:29:49,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:49,340 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-04 16:29:49,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [32125541] [2020-09-04 16:29:49,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:49,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:29:49,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525753078] [2020-09-04 16:29:49,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:29:49,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:49,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:29:49,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:29:49,626 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2020-09-04 16:29:49,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:49,778 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-09-04 16:29:49,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:29:49,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2020-09-04 16:29:49,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:49,781 INFO L225 Difference]: With dead ends: 64 [2020-09-04 16:29:49,781 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 16:29:49,782 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-09-04 16:29:49,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 16:29:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-09-04 16:29:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 16:29:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-09-04 16:29:49,793 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 72 [2020-09-04 16:29:49,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:49,794 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-09-04 16:29:49,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:29:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-09-04 16:29:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-09-04 16:29:49,795 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:49,796 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:49,796 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:29:49,796 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:49,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:49,797 INFO L82 PathProgramCache]: Analyzing trace with hash 555623729, now seen corresponding path program 8 times [2020-09-04 16:29:49,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:49,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [922026509] [2020-09-04 16:29:49,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:49,799 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-09-04 16:29:50,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [922026509] [2020-09-04 16:29:50,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:50,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:29:50,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521752279] [2020-09-04 16:29:50,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:29:50,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:50,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:29:50,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:29:50,163 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2020-09-04 16:29:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:50,302 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-09-04 16:29:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:29:50,303 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2020-09-04 16:29:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:50,305 INFO L225 Difference]: With dead ends: 69 [2020-09-04 16:29:50,305 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 16:29:50,306 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-09-04 16:29:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 16:29:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-09-04 16:29:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-09-04 16:29:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-09-04 16:29:50,317 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 80 [2020-09-04 16:29:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:50,317 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-09-04 16:29:50,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:29:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-09-04 16:29:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-09-04 16:29:50,319 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:50,319 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:50,319 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:29:50,319 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:50,320 INFO L82 PathProgramCache]: Analyzing trace with hash 777699815, now seen corresponding path program 9 times [2020-09-04 16:29:50,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:50,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [624953643] [2020-09-04 16:29:50,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:50,322 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-04 16:29:50,738 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [624953643] [2020-09-04 16:29:50,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:50,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:29:50,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855940767] [2020-09-04 16:29:50,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:29:50,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:50,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:29:50,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:29:50,747 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 14 states. [2020-09-04 16:29:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:50,935 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-09-04 16:29:50,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:29:50,935 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2020-09-04 16:29:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:50,937 INFO L225 Difference]: With dead ends: 74 [2020-09-04 16:29:50,937 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 16:29:50,941 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:29:50,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 16:29:50,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-09-04 16:29:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 16:29:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-09-04 16:29:50,958 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 88 [2020-09-04 16:29:50,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:50,959 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-09-04 16:29:50,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:29:50,959 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-09-04 16:29:50,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-09-04 16:29:50,966 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:50,966 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:50,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:29:50,968 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:50,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:50,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2145915377, now seen corresponding path program 10 times [2020-09-04 16:29:50,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:50,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1355535576] [2020-09-04 16:29:50,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:50,973 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-09-04 16:29:51,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1355535576] [2020-09-04 16:29:51,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:51,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:29:51,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973137392] [2020-09-04 16:29:51,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:29:51,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:51,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:29:51,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:29:51,525 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 15 states. [2020-09-04 16:29:51,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:51,701 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-09-04 16:29:51,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:29:51,702 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2020-09-04 16:29:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:51,703 INFO L225 Difference]: With dead ends: 79 [2020-09-04 16:29:51,704 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 16:29:51,706 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-09-04 16:29:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 16:29:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-09-04 16:29:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-09-04 16:29:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2020-09-04 16:29:51,731 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 96 [2020-09-04 16:29:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:51,731 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2020-09-04 16:29:51,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:29:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2020-09-04 16:29:51,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-04 16:29:51,733 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:51,734 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:51,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:29:51,735 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:51,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:51,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1180214055, now seen corresponding path program 11 times [2020-09-04 16:29:51,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:51,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [294496620] [2020-09-04 16:29:51,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:51,738 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,309 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-09-04 16:29:52,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [294496620] [2020-09-04 16:29:52,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:52,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:29:52,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564594790] [2020-09-04 16:29:52,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:29:52,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:52,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:29:52,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:29:52,314 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 16 states. [2020-09-04 16:29:52,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:52,518 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-09-04 16:29:52,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:29:52,519 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-09-04 16:29:52,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:52,520 INFO L225 Difference]: With dead ends: 84 [2020-09-04 16:29:52,520 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 16:29:52,522 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-09-04 16:29:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 16:29:52,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-04 16:29:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 16:29:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2020-09-04 16:29:52,540 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 104 [2020-09-04 16:29:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:52,541 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2020-09-04 16:29:52,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:29:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2020-09-04 16:29:52,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-09-04 16:29:52,544 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:52,544 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:52,545 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:29:52,545 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:52,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:52,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1287598415, now seen corresponding path program 12 times [2020-09-04 16:29:52,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:52,546 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [741409803] [2020-09-04 16:29:52,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:52,551 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-09-04 16:29:53,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [741409803] [2020-09-04 16:29:53,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:53,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:29:53,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250694596] [2020-09-04 16:29:53,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:29:53,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:53,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:29:53,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:29:53,301 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 17 states. [2020-09-04 16:29:53,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:53,526 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-09-04 16:29:53,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 16:29:53,527 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2020-09-04 16:29:53,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:53,528 INFO L225 Difference]: With dead ends: 89 [2020-09-04 16:29:53,528 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 16:29:53,530 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-09-04 16:29:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 16:29:53,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-09-04 16:29:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-09-04 16:29:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2020-09-04 16:29:53,554 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 112 [2020-09-04 16:29:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:53,556 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2020-09-04 16:29:53,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:29:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2020-09-04 16:29:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-09-04 16:29:53,558 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:53,559 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:53,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:29:53,559 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:53,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:53,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1612559463, now seen corresponding path program 13 times [2020-09-04 16:29:53,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:53,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [565757131] [2020-09-04 16:29:53,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:53,567 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-09-04 16:29:54,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [565757131] [2020-09-04 16:29:54,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:54,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 16:29:54,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904592653] [2020-09-04 16:29:54,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 16:29:54,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:54,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 16:29:54,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:29:54,328 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 18 states. [2020-09-04 16:29:54,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:54,585 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-09-04 16:29:54,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:29:54,585 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2020-09-04 16:29:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:54,587 INFO L225 Difference]: With dead ends: 94 [2020-09-04 16:29:54,587 INFO L226 Difference]: Without dead ends: 88 [2020-09-04 16:29:54,588 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-09-04 16:29:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-09-04 16:29:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-09-04 16:29:54,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-09-04 16:29:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2020-09-04 16:29:54,601 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 120 [2020-09-04 16:29:54,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:54,602 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2020-09-04 16:29:54,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 16:29:54,602 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2020-09-04 16:29:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 16:29:54,605 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:54,605 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:54,606 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:29:54,606 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:54,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:54,606 INFO L82 PathProgramCache]: Analyzing trace with hash 996432753, now seen corresponding path program 14 times [2020-09-04 16:29:54,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:54,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1879369616] [2020-09-04 16:29:54,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:54,610 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:55,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:55,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:55,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:55,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:55,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:55,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:55,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:55,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-09-04 16:29:55,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1879369616] [2020-09-04 16:29:55,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:55,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 16:29:55,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325210718] [2020-09-04 16:29:55,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 16:29:55,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:55,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 16:29:55,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:29:55,402 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 19 states. [2020-09-04 16:29:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:55,660 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-09-04 16:29:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:29:55,661 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 128 [2020-09-04 16:29:55,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:55,663 INFO L225 Difference]: With dead ends: 99 [2020-09-04 16:29:55,663 INFO L226 Difference]: Without dead ends: 93 [2020-09-04 16:29:55,667 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-09-04 16:29:55,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-09-04 16:29:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-09-04 16:29:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-04 16:29:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2020-09-04 16:29:55,678 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 128 [2020-09-04 16:29:55,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:55,679 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2020-09-04 16:29:55,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 16:29:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2020-09-04 16:29:55,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-09-04 16:29:55,681 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:55,682 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:55,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 16:29:55,682 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:55,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:55,683 INFO L82 PathProgramCache]: Analyzing trace with hash 418248103, now seen corresponding path program 15 times [2020-09-04 16:29:55,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:55,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [809865665] [2020-09-04 16:29:55,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:55,686 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:55,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:55,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:55,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:55,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:55,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:55,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-09-04 16:29:56,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [809865665] [2020-09-04 16:29:56,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:56,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-09-04 16:29:56,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175314324] [2020-09-04 16:29:56,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 16:29:56,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:56,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 16:29:56,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:29:56,500 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 20 states. [2020-09-04 16:29:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:56,799 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-09-04 16:29:56,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 16:29:56,800 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 136 [2020-09-04 16:29:56,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:56,802 INFO L225 Difference]: With dead ends: 104 [2020-09-04 16:29:56,802 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 16:29:56,804 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2020-09-04 16:29:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 16:29:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-09-04 16:29:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-09-04 16:29:56,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2020-09-04 16:29:56,816 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 136 [2020-09-04 16:29:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:56,818 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2020-09-04 16:29:56,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 16:29:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2020-09-04 16:29:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-09-04 16:29:56,820 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:56,820 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:56,821 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 16:29:56,821 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:56,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:56,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2106505265, now seen corresponding path program 16 times [2020-09-04 16:29:56,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:56,822 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [555435801] [2020-09-04 16:29:56,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:56,826 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:56,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:57,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:57,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:57,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:57,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:57,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:57,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:57,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:57,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:57,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:57,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:57,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:57,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:57,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:57,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-09-04 16:29:57,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [555435801] [2020-09-04 16:29:57,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:57,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 16:29:57,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234773122] [2020-09-04 16:29:57,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 16:29:57,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:57,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 16:29:57,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:29:57,880 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 21 states. [2020-09-04 16:29:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:58,168 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-09-04 16:29:58,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 16:29:58,168 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 144 [2020-09-04 16:29:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:58,170 INFO L225 Difference]: With dead ends: 109 [2020-09-04 16:29:58,170 INFO L226 Difference]: Without dead ends: 103 [2020-09-04 16:29:58,171 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2020-09-04 16:29:58,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-09-04 16:29:58,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-09-04 16:29:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-04 16:29:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2020-09-04 16:29:58,185 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 144 [2020-09-04 16:29:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:58,185 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2020-09-04 16:29:58,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 16:29:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2020-09-04 16:29:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-09-04 16:29:58,189 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:58,189 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:58,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 16:29:58,189 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:58,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:58,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1225615079, now seen corresponding path program 17 times [2020-09-04 16:29:58,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:58,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1102945558] [2020-09-04 16:29:58,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:58,193 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:58,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:59,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:59,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-09-04 16:29:59,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1102945558] [2020-09-04 16:29:59,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:59,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-09-04 16:29:59,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827396618] [2020-09-04 16:29:59,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 16:29:59,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:59,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 16:29:59,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:29:59,332 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 22 states. [2020-09-04 16:29:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:59,623 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-09-04 16:29:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 16:29:59,624 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 152 [2020-09-04 16:29:59,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:59,625 INFO L225 Difference]: With dead ends: 114 [2020-09-04 16:29:59,625 INFO L226 Difference]: Without dead ends: 108 [2020-09-04 16:29:59,628 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-09-04 16:29:59,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-09-04 16:29:59,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-09-04 16:29:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-09-04 16:29:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2020-09-04 16:29:59,642 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 152 [2020-09-04 16:29:59,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:59,642 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2020-09-04 16:29:59,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 16:29:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2020-09-04 16:29:59,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-09-04 16:29:59,644 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:59,644 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:59,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 16:29:59,645 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:59,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:59,645 INFO L82 PathProgramCache]: Analyzing trace with hash -2080643855, now seen corresponding path program 18 times [2020-09-04 16:29:59,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:59,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1281049777] [2020-09-04 16:29:59,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:59,650 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:59,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:59,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:59,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:59,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:59,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:59,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:00,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:00,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:00,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:00,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:00,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:00,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:00,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:00,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:00,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:00,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:00,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:00,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:00,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:00,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-09-04 16:30:00,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1281049777] [2020-09-04 16:30:00,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:00,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-09-04 16:30:00,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194149131] [2020-09-04 16:30:00,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 16:30:00,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:00,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 16:30:00,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-09-04 16:30:00,888 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 23 states. [2020-09-04 16:30:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:01,347 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-09-04 16:30:01,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 16:30:01,348 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 160 [2020-09-04 16:30:01,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:01,349 INFO L225 Difference]: With dead ends: 119 [2020-09-04 16:30:01,350 INFO L226 Difference]: Without dead ends: 113 [2020-09-04 16:30:01,354 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 16:30:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-09-04 16:30:01,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-09-04 16:30:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-09-04 16:30:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2020-09-04 16:30:01,375 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 160 [2020-09-04 16:30:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:01,376 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2020-09-04 16:30:01,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 16:30:01,376 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2020-09-04 16:30:01,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-09-04 16:30:01,378 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:01,379 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:01,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 16:30:01,379 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:01,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:01,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1136658471, now seen corresponding path program 19 times [2020-09-04 16:30:01,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:01,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [624608925] [2020-09-04 16:30:01,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:01,383 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:30:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-09-04 16:30:02,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [624608925] [2020-09-04 16:30:02,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:02,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-09-04 16:30:02,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690112747] [2020-09-04 16:30:02,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 16:30:02,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:02,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 16:30:02,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:30:02,570 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 24 states. [2020-09-04 16:30:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:02,885 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-09-04 16:30:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 16:30:02,886 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 168 [2020-09-04 16:30:02,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:02,887 INFO L225 Difference]: With dead ends: 124 [2020-09-04 16:30:02,887 INFO L226 Difference]: Without dead ends: 118 [2020-09-04 16:30:02,889 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-09-04 16:30:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-09-04 16:30:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2020-09-04 16:30:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-09-04 16:30:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2020-09-04 16:30:02,899 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 168 [2020-09-04 16:30:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:02,900 INFO L479 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2020-09-04 16:30:02,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 16:30:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2020-09-04 16:30:02,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-09-04 16:30:02,902 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:02,902 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:02,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 16:30:02,903 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:02,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:02,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1108876879, now seen corresponding path program 20 times [2020-09-04 16:30:02,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:02,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [194273363] [2020-09-04 16:30:02,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:02,905 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:30:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:04,220 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-09-04 16:30:04,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [194273363] [2020-09-04 16:30:04,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:04,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-09-04 16:30:04,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216242549] [2020-09-04 16:30:04,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 16:30:04,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:04,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 16:30:04,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2020-09-04 16:30:04,223 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 25 states. [2020-09-04 16:30:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:04,586 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-09-04 16:30:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 16:30:04,587 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 176 [2020-09-04 16:30:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:04,588 INFO L225 Difference]: With dead ends: 129 [2020-09-04 16:30:04,588 INFO L226 Difference]: Without dead ends: 123 [2020-09-04 16:30:04,590 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2020-09-04 16:30:04,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-09-04 16:30:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-09-04 16:30:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-04 16:30:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2020-09-04 16:30:04,599 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 176 [2020-09-04 16:30:04,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:04,600 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2020-09-04 16:30:04,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 16:30:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2020-09-04 16:30:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-09-04 16:30:04,603 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:04,604 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:04,604 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 16:30:04,604 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:04,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:04,605 INFO L82 PathProgramCache]: Analyzing trace with hash 390715751, now seen corresponding path program 21 times [2020-09-04 16:30:04,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:04,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [98933711] [2020-09-04 16:30:04,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:04,609 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:04,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:04,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:30:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:04,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:04,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:04,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:04,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:04,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-09-04 16:30:05,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [98933711] [2020-09-04 16:30:05,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:05,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-09-04 16:30:05,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796879751] [2020-09-04 16:30:05,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-04 16:30:05,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:05,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-04 16:30:05,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2020-09-04 16:30:05,955 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 26 states. [2020-09-04 16:30:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:06,353 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2020-09-04 16:30:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 16:30:06,355 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 184 [2020-09-04 16:30:06,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:06,358 INFO L225 Difference]: With dead ends: 134 [2020-09-04 16:30:06,359 INFO L226 Difference]: Without dead ends: 128 [2020-09-04 16:30:06,360 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2020-09-04 16:30:06,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-09-04 16:30:06,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-09-04 16:30:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-09-04 16:30:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2020-09-04 16:30:06,371 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 184 [2020-09-04 16:30:06,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:06,371 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2020-09-04 16:30:06,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-04 16:30:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2020-09-04 16:30:06,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-09-04 16:30:06,375 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:06,375 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:06,375 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 16:30:06,375 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:06,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:06,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1081168271, now seen corresponding path program 22 times [2020-09-04 16:30:06,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:06,378 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1156930800] [2020-09-04 16:30:06,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:06,380 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:06,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:06,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:30:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:06,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:06,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:06,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:06,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:06,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:06,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:06,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:06,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:06,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:07,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:07,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:07,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:07,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:07,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:07,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:07,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:07,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:07,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:07,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:07,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:07,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:07,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2020-09-04 16:30:07,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1156930800] [2020-09-04 16:30:07,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:07,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-09-04 16:30:07,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715012827] [2020-09-04 16:30:07,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 16:30:07,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:07,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 16:30:07,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2020-09-04 16:30:07,755 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 27 states. [2020-09-04 16:30:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:08,254 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2020-09-04 16:30:08,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 16:30:08,255 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 192 [2020-09-04 16:30:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:08,256 INFO L225 Difference]: With dead ends: 139 [2020-09-04 16:30:08,256 INFO L226 Difference]: Without dead ends: 133 [2020-09-04 16:30:08,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2020-09-04 16:30:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-09-04 16:30:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-09-04 16:30:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-04 16:30:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2020-09-04 16:30:08,271 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 192 [2020-09-04 16:30:08,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:08,272 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2020-09-04 16:30:08,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 16:30:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2020-09-04 16:30:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-09-04 16:30:08,274 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:08,275 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:08,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 16:30:08,275 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:08,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash -856761689, now seen corresponding path program 23 times [2020-09-04 16:30:08,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:08,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1526603940] [2020-09-04 16:30:08,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:08,279 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:08,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:08,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:30:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:08,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:08,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:08,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:08,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:08,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:08,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:08,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:08,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:08,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:08,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:09,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:09,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:09,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:09,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:09,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:09,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:09,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:09,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:09,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:09,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:09,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:09,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:09,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2020-09-04 16:30:09,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1526603940] [2020-09-04 16:30:09,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:09,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2020-09-04 16:30:09,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122583276] [2020-09-04 16:30:09,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-09-04 16:30:09,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:09,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-09-04 16:30:09,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:30:09,841 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 28 states. [2020-09-04 16:30:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:10,347 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2020-09-04 16:30:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 16:30:10,348 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 200 [2020-09-04 16:30:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:10,350 INFO L225 Difference]: With dead ends: 144 [2020-09-04 16:30:10,350 INFO L226 Difference]: Without dead ends: 138 [2020-09-04 16:30:10,351 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2020-09-04 16:30:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-09-04 16:30:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-09-04 16:30:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-09-04 16:30:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2020-09-04 16:30:10,359 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 200 [2020-09-04 16:30:10,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:10,360 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2020-09-04 16:30:10,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-09-04 16:30:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2020-09-04 16:30:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-09-04 16:30:10,362 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:10,363 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:10,363 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 16:30:10,363 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:10,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:10,363 INFO L82 PathProgramCache]: Analyzing trace with hash 36457265, now seen corresponding path program 24 times [2020-09-04 16:30:10,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:10,364 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [468729405] [2020-09-04 16:30:10,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:10,365 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:10,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:10,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:30:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:10,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:10,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:10,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:10,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:10,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:10,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:10,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:10,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:10,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:11,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:11,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:11,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:11,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:11,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:11,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:11,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:11,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:11,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:11,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:11,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:11,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:11,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:11,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:11,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:12,149 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2020-09-04 16:30:12,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [468729405] [2020-09-04 16:30:12,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:12,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2020-09-04 16:30:12,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526734600] [2020-09-04 16:30:12,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-09-04 16:30:12,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:12,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-09-04 16:30:12,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2020-09-04 16:30:12,152 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 29 states. [2020-09-04 16:30:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:12,653 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2020-09-04 16:30:12,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-04 16:30:12,654 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 208 [2020-09-04 16:30:12,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:12,655 INFO L225 Difference]: With dead ends: 149 [2020-09-04 16:30:12,655 INFO L226 Difference]: Without dead ends: 143 [2020-09-04 16:30:12,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2020-09-04 16:30:12,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-09-04 16:30:12,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2020-09-04 16:30:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-09-04 16:30:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2020-09-04 16:30:12,665 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 208 [2020-09-04 16:30:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:12,666 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2020-09-04 16:30:12,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-09-04 16:30:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2020-09-04 16:30:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-09-04 16:30:12,667 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:12,668 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:12,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 16:30:12,668 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:12,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:12,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1460466713, now seen corresponding path program 25 times [2020-09-04 16:30:12,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:12,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [782787300] [2020-09-04 16:30:12,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:12,671 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:12,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:12,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:30:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:12,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:13,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:13,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:13,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:13,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:13,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:13,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:13,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:13,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:13,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:14,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:14,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:14,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:14,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:14,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:14,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:14,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:14,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:15,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:15,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:15,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:15,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:15,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:15,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:15,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2020-09-04 16:30:16,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [782787300] [2020-09-04 16:30:16,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:16,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2020-09-04 16:30:16,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835598189] [2020-09-04 16:30:16,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2020-09-04 16:30:16,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:16,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2020-09-04 16:30:16,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2020-09-04 16:30:16,417 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 55 states. [2020-09-04 16:30:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:20,678 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2020-09-04 16:30:20,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2020-09-04 16:30:20,679 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 216 [2020-09-04 16:30:20,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:20,681 INFO L225 Difference]: With dead ends: 154 [2020-09-04 16:30:20,682 INFO L226 Difference]: Without dead ends: 148 [2020-09-04 16:30:20,686 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=211, Invalid=6269, Unknown=0, NotChecked=0, Total=6480 [2020-09-04 16:30:20,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-09-04 16:30:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2020-09-04 16:30:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-09-04 16:30:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2020-09-04 16:30:20,697 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 216 [2020-09-04 16:30:20,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:20,697 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2020-09-04 16:30:20,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 55 states. [2020-09-04 16:30:20,697 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2020-09-04 16:30:20,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-09-04 16:30:20,699 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:20,699 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:20,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-04 16:30:20,699 INFO L427 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:20,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:20,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1543718927, now seen corresponding path program 26 times [2020-09-04 16:30:20,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:20,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1118068059] [2020-09-04 16:30:20,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:20,703 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:30:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2020-09-04 16:30:22,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1118068059] [2020-09-04 16:30:22,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:22,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2020-09-04 16:30:22,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748888003] [2020-09-04 16:30:22,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-09-04 16:30:22,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:22,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-09-04 16:30:22,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=546, Unknown=0, NotChecked=0, Total=930 [2020-09-04 16:30:22,781 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 31 states. [2020-09-04 16:30:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:25,669 INFO L93 Difference]: Finished difference Result 346 states and 1022 transitions. [2020-09-04 16:30:25,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2020-09-04 16:30:25,671 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 224 [2020-09-04 16:30:25,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:25,672 INFO L225 Difference]: With dead ends: 346 [2020-09-04 16:30:25,672 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:30:25,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1142, Invalid=2164, Unknown=0, NotChecked=0, Total=3306 [2020-09-04 16:30:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:30:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:30:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:30:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:30:25,683 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2020-09-04 16:30:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:25,684 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:30:25,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-09-04 16:30:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:30:25,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:30:25,685 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-09-04 16:30:25,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:30:25,804 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2020-09-04 16:30:26,485 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 87 [2020-09-04 16:30:32,113 WARN L193 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 284 DAG size of output: 208 [2020-09-04 16:30:33,476 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 238 DAG size of output: 163 [2020-09-04 16:30:33,653 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 3 [2020-09-04 16:30:35,061 WARN L193 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 238 DAG size of output: 163 [2020-09-04 16:30:35,201 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 3 [2020-09-04 16:30:36,295 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 233 DAG size of output: 157 [2020-09-04 16:30:37,378 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 233 DAG size of output: 157 [2020-09-04 16:30:37,383 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:30:37,383 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:30:37,383 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:30:37,383 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:30:37,383 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:30:37,383 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:30:37,384 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) the Hoare annotation is: false [2020-09-04 16:30:37,384 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-09-04 16:30:37,384 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 9 15) the Hoare annotation is: (<= 25 main_~input~0) [2020-09-04 16:30:37,384 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: false [2020-09-04 16:30:37,384 INFO L264 CegarLoopResult]: At program point L12(lines 12 14) the Hoare annotation is: (and (<= 25 main_~input~0) (<= main_~result~0 25) (< 24 main_~result~0)) [2020-09-04 16:30:37,385 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= 25 main_~input~0) (<= main_~input~0 25)) [2020-09-04 16:30:37,385 INFO L264 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (and (<= 25 main_~input~0) (<= |main_#t~ret1| 25) (<= 25 |main_#t~ret1|)) [2020-09-04 16:30:37,385 INFO L264 CegarLoopResult]: At program point L12-2(lines 9 15) the Hoare annotation is: (<= 25 main_~input~0) [2020-09-04 16:30:37,385 INFO L264 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (and (<= 25 main_~input~0) (<= |main_#t~ret1| 25) (<= 25 |main_#t~ret1|)) [2020-09-04 16:30:37,386 INFO L264 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (and (<= 25 main_~input~0) (<= main_~result~0 25) (< 24 main_~result~0) (<= |main_#t~ret1| 25) (<= 25 |main_#t~ret1|)) [2020-09-04 16:30:37,387 INFO L264 CegarLoopResult]: At program point idFINAL(lines 4 7) the Hoare annotation is: (let ((.cse16 (<= 12 |id_#in~x|)) (.cse0 (= |id_#in~x| id_~x))) (let ((.cse7 (and .cse0 (<= 26 |id_#in~x|))) (.cse1 (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15))) (.cse2 (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|))) (.cse8 (and (<= |id_#res| 23) .cse0 (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= 23 |id_#res|))) (.cse9 (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|))) (.cse3 (and .cse0 (<= 22 |id_#res|) (<= |id_#in~x| 22) (<= |id_#res| 22) (<= 22 |id_#in~x|))) (.cse10 (and (<= 25 |id_#in~x|) .cse0 (<= |id_#res| 25) (<= 25 |id_#res|))) (.cse4 (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|))) (.cse11 (and .cse0 (<= |id_#in~x| 20) (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|))) (.cse12 (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14))) (.cse13 (and .cse16 .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|))) (.cse5 (and .cse0 (<= |id_#in~x| 24) (<= |id_#res| 24) (<= 24 |id_#in~x|) (<= 24 |id_#res|))) (.cse6 (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|))) (.cse14 (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18))) (.cse15 (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= 21 |id_#res|) .cse0 (<= |id_#res| 21)))) (and (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) .cse1 .cse2 (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) .cse3 .cse4 (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) .cse5 (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) .cse6 (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) .cse7 (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) .cse14 .cse15) (or .cse7 .cse1 .cse2 .cse8 (not .cse16) .cse9 .cse3 .cse10 .cse4 .cse11 .cse12 .cse13 .cse5 .cse6 .cse14 .cse15)))) [2020-09-04 16:30:37,387 INFO L264 CegarLoopResult]: At program point idEXIT(lines 4 7) the Hoare annotation is: (let ((.cse16 (<= 12 |id_#in~x|)) (.cse0 (= |id_#in~x| id_~x))) (let ((.cse7 (and .cse0 (<= 26 |id_#in~x|))) (.cse1 (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15))) (.cse2 (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|))) (.cse8 (and (<= |id_#res| 23) .cse0 (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= 23 |id_#res|))) (.cse9 (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|))) (.cse3 (and .cse0 (<= 22 |id_#res|) (<= |id_#in~x| 22) (<= |id_#res| 22) (<= 22 |id_#in~x|))) (.cse10 (and (<= 25 |id_#in~x|) .cse0 (<= |id_#res| 25) (<= 25 |id_#res|))) (.cse4 (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|))) (.cse11 (and .cse0 (<= |id_#in~x| 20) (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|))) (.cse12 (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14))) (.cse13 (and .cse16 .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|))) (.cse5 (and .cse0 (<= |id_#in~x| 24) (<= |id_#res| 24) (<= 24 |id_#in~x|) (<= 24 |id_#res|))) (.cse6 (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|))) (.cse14 (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18))) (.cse15 (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= 21 |id_#res|) .cse0 (<= |id_#res| 21)))) (and (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) .cse1 .cse2 (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) .cse3 .cse4 (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) .cse5 (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) .cse6 (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) .cse7 (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) .cse14 .cse15) (or .cse7 .cse1 .cse2 .cse8 (not .cse16) .cse9 .cse3 .cse10 .cse4 .cse11 .cse12 .cse13 .cse5 .cse6 .cse14 .cse15)))) [2020-09-04 16:30:37,387 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-09-04 16:30:37,387 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-09-04 16:30:37,387 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-09-04 16:30:37,388 INFO L264 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) (and (<= 12 |id_#in~x|) (<= 11 |id_#t~ret0|) .cse0 (<= |id_#in~x| 12) (<= |id_#t~ret0| 11)) (and (<= |id_#t~ret0| 23) (<= 23 |id_#t~ret0|) .cse0 (<= |id_#in~x| 24) (<= 24 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 22) (<= 22 |id_#in~x|) (<= |id_#t~ret0| 21) (<= 21 |id_#t~ret0|)) (and .cse0 (<= 23 |id_#in~x|) (<= |id_#t~ret0| 22) (<= |id_#in~x| 23) (<= 22 |id_#t~ret0|)) (and .cse0 (<= 1 |id_#t~ret0|) (<= 2 |id_#in~x|) (<= |id_#t~ret0| 1) (<= |id_#in~x| 2)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret0| 14) .cse0 (<= 14 |id_#t~ret0|) (<= |id_#in~x| 15)) (and (<= |id_#t~ret0| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6) (<= 5 |id_#t~ret0|)) (and (<= |id_#t~ret0| 9) (<= 9 |id_#t~ret0|) .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|)) (and (<= 24 |id_#t~ret0|) (<= 25 |id_#in~x|) .cse0 (<= |id_#t~ret0| 24)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret0| 12) .cse0 (<= 12 |id_#t~ret0|)) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret0| 0) (<= |id_#in~x| 1)) (and .cse0 (<= 26 |id_#in~x|)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#t~ret0| 10) (<= 10 |id_#t~ret0|)) (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret0|) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8)) (and (<= 7 |id_#t~ret0|) (<= |id_#t~ret0| 7) .cse0 (<= 8 |id_#in~x|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret0| 19) .cse0 (<= |id_#in~x| 20) (<= 19 |id_#t~ret0|) (<= 20 |id_#in~x|)) (and (<= 13 |id_#t~ret0|) (<= 14 |id_#in~x|) .cse0 (<= |id_#t~ret0| 13) (<= |id_#in~x| 14)) (and (<= 17 |id_#t~ret0|) (<= 18 |id_#in~x|) .cse0 (<= |id_#in~x| 18) (<= |id_#t~ret0| 17)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) .cse0 (<= 20 |id_#t~ret0|) (<= |id_#t~ret0| 20)) (and .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret0|) (<= |id_#t~ret0| 15)) (and (<= 18 |id_#t~ret0|) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|) (<= |id_#t~ret0| 18)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) (<= 4 |id_#in~x|)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse0 (<= |id_#in~x| 3) (<= 2 |id_#t~ret0|)) (and .cse0 (<= |id_#t~ret0| 6) (<= 7 |id_#in~x|) (<= 6 |id_#t~ret0|) (<= |id_#in~x| 7)) (and (<= |id_#t~ret0| 16) .cse0 (<= 16 |id_#t~ret0|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)))) [2020-09-04 16:30:37,388 INFO L264 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-09-04 16:30:37,388 INFO L264 CegarLoopResult]: At program point L6-2(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) (and (<= 12 |id_#in~x|) (<= 11 |id_#t~ret0|) .cse0 (<= |id_#in~x| 12) (<= |id_#t~ret0| 11)) (and (<= |id_#t~ret0| 23) (<= 23 |id_#t~ret0|) .cse0 (<= |id_#in~x| 24) (<= 24 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 22) (<= 22 |id_#in~x|) (<= |id_#t~ret0| 21) (<= 21 |id_#t~ret0|)) (and .cse0 (<= 23 |id_#in~x|) (<= |id_#t~ret0| 22) (<= |id_#in~x| 23) (<= 22 |id_#t~ret0|)) (and .cse0 (<= 1 |id_#t~ret0|) (<= 2 |id_#in~x|) (<= |id_#t~ret0| 1) (<= |id_#in~x| 2)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret0| 14) .cse0 (<= 14 |id_#t~ret0|) (<= |id_#in~x| 15)) (and (<= |id_#t~ret0| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6) (<= 5 |id_#t~ret0|)) (and (<= |id_#t~ret0| 9) (<= 9 |id_#t~ret0|) .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|)) (and (<= 24 |id_#t~ret0|) (<= 25 |id_#in~x|) .cse0 (<= |id_#t~ret0| 24)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret0| 12) .cse0 (<= 12 |id_#t~ret0|)) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret0| 0) (<= |id_#in~x| 1)) (and .cse0 (<= 26 |id_#in~x|)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#t~ret0| 10) (<= 10 |id_#t~ret0|)) (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret0|) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8)) (and (<= 7 |id_#t~ret0|) (<= |id_#t~ret0| 7) .cse0 (<= 8 |id_#in~x|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret0| 19) .cse0 (<= |id_#in~x| 20) (<= 19 |id_#t~ret0|) (<= 20 |id_#in~x|)) (and (<= 13 |id_#t~ret0|) (<= 14 |id_#in~x|) .cse0 (<= |id_#t~ret0| 13) (<= |id_#in~x| 14)) (and (<= 17 |id_#t~ret0|) (<= 18 |id_#in~x|) .cse0 (<= |id_#in~x| 18) (<= |id_#t~ret0| 17)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) .cse0 (<= 20 |id_#t~ret0|) (<= |id_#t~ret0| 20)) (and .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret0|) (<= |id_#t~ret0| 15)) (and (<= 18 |id_#t~ret0|) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|) (<= |id_#t~ret0| 18)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) (<= 4 |id_#in~x|)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse0 (<= |id_#in~x| 3) (<= 2 |id_#t~ret0|)) (and .cse0 (<= |id_#t~ret0| 6) (<= 7 |id_#in~x|) (<= 6 |id_#t~ret0|) (<= |id_#in~x| 7)) (and (<= |id_#t~ret0| 16) .cse0 (<= 16 |id_#t~ret0|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)))) [2020-09-04 16:30:37,389 INFO L264 CegarLoopResult]: At program point L6-3(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 13 |id_#t~ret0|) (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= |id_#t~ret0| 13) (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5) (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) (and (<= |id_#res| 17) (<= |id_#t~ret0| 16) (<= 17 |id_#res|) .cse0 (<= 16 |id_#t~ret0|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= |id_#t~ret0| 9) (<= 9 |id_#t~ret0|) .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) (<= |id_#t~ret0| 14) .cse0 (<= 14 |id_#t~ret0|) (<= |id_#in~x| 15) (<= |id_#res| 15)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) (<= 4 |id_#in~x|)) (and (<= 19 |id_#res|) (<= 18 |id_#t~ret0|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|) (<= |id_#t~ret0| 18)) (and (<= |id_#res| 23) .cse0 (<= 23 |id_#in~x|) (<= |id_#t~ret0| 22) (<= |id_#in~x| 23) (<= 22 |id_#t~ret0|) (<= 23 |id_#res|)) (and (<= |id_#t~ret0| 5) (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6) (<= 5 |id_#t~ret0|)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|) (<= 15 |id_#t~ret0|) (<= |id_#t~ret0| 15)) (and (<= |id_#t~ret0| 23) (<= 23 |id_#t~ret0|) .cse0 (<= |id_#in~x| 24) (<= |id_#res| 24) (<= 24 |id_#in~x|) (<= 24 |id_#res|)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|) (<= |id_#t~ret0| 10) (<= 10 |id_#t~ret0|)) (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= |id_#t~ret0| 6) (<= 7 |id_#in~x|) (<= 6 |id_#t~ret0|) (<= |id_#in~x| 7)) (and (<= 12 |id_#in~x|) (<= 11 |id_#t~ret0|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|) (<= |id_#t~ret0| 11)) (and .cse0 (<= 26 |id_#in~x|)) (and (<= |id_#res| 18) (<= 17 |id_#t~ret0|) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18) (<= |id_#t~ret0| 17)) (and .cse0 (<= 22 |id_#res|) (<= |id_#in~x| 22) (<= |id_#res| 22) (<= 22 |id_#in~x|) (<= |id_#t~ret0| 21) (<= 21 |id_#t~ret0|)) (and (<= 24 |id_#t~ret0|) (<= 25 |id_#in~x|) .cse0 (<= |id_#res| 25) (<= |id_#t~ret0| 24) (<= 25 |id_#res|)) (and (<= |id_#t~ret0| 19) .cse0 (<= |id_#in~x| 20) (<= 20 |id_#res|) (<= |id_#res| 20) (<= 19 |id_#t~ret0|) (<= 20 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (= |id_#t~ret0| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|) (<= 2 |id_#t~ret0|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret0| 12) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|) (<= 12 |id_#t~ret0|)) (and (<= 7 |id_#t~ret0|) (<= |id_#res| 8) (<= |id_#t~ret0| 7) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= 21 |id_#res|) .cse0 (<= |id_#res| 21) (<= 20 |id_#t~ret0|) (<= |id_#t~ret0| 20)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 8 |id_#t~ret0|) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8)) (and (<= 2 |id_#res|) .cse0 (<= 1 |id_#t~ret0|) (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#t~ret0| 1) (<= |id_#in~x| 2)))) [2020-09-04 16:30:37,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:30:37 BoogieIcfgContainer [2020-09-04 16:30:37,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:30:37,428 INFO L168 Benchmark]: Toolchain (without parser) took 52182.63 ms. Allocated memory was 137.4 MB in the beginning and 789.1 MB in the end (delta: 651.7 MB). Free memory was 101.8 MB in the beginning and 137.1 MB in the end (delta: -35.4 MB). Peak memory consumption was 672.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:37,428 INFO L168 Benchmark]: CDTParser took 2.12 ms. Allocated memory is still 137.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 16:30:37,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 416.16 ms. Allocated memory is still 137.4 MB. Free memory was 101.6 MB in the beginning and 92.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:37,430 INFO L168 Benchmark]: Boogie Preprocessor took 48.23 ms. Allocated memory is still 137.4 MB. Free memory was 92.4 MB in the beginning and 91.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:37,430 INFO L168 Benchmark]: RCFGBuilder took 494.14 ms. Allocated memory was 137.4 MB in the beginning and 204.5 MB in the end (delta: 67.1 MB). Free memory was 90.8 MB in the beginning and 172.4 MB in the end (delta: -81.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:37,431 INFO L168 Benchmark]: TraceAbstraction took 51216.49 ms. Allocated memory was 204.5 MB in the beginning and 789.1 MB in the end (delta: 584.6 MB). Free memory was 171.7 MB in the beginning and 137.1 MB in the end (delta: 34.6 MB). Peak memory consumption was 675.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:37,434 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.12 ms. Allocated memory is still 137.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 416.16 ms. Allocated memory is still 137.4 MB. Free memory was 101.6 MB in the beginning and 92.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.23 ms. Allocated memory is still 137.4 MB. Free memory was 92.4 MB in the beginning and 91.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 494.14 ms. Allocated memory was 137.4 MB in the beginning and 204.5 MB in the end (delta: 67.1 MB). Free memory was 90.8 MB in the beginning and 172.4 MB in the end (delta: -81.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51216.49 ms. Allocated memory was 204.5 MB in the beginning and 789.1 MB in the end (delta: 584.6 MB). Free memory was 171.7 MB in the beginning and 137.1 MB in the end (delta: 34.6 MB). Peak memory consumption was 675.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: 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: 9]: Procedure Contract for main Derived contract for procedure main: 25 <= input - ProcedureContractResult [Line: 4]: Procedure Contract for id Derived contract for procedure id: ((((((((((((((((((((((((((((((7 <= \result && \old(x) == x) && \result <= 7) && 7 <= \old(x)) && \old(x) <= 7) || ((((15 <= \result && 15 <= \old(x)) && \old(x) == x) && \old(x) <= 15) && \result <= 15)) || ((((\result <= 16 && \old(x) == x) && 16 <= \old(x)) && \old(x) <= 16) && 16 <= \result)) || ((((\old(x) == x && \old(x) <= 10) && 10 <= \old(x)) && 10 <= \result) && \result <= 10)) || ((((2 <= \result && \old(x) == x) && \result <= 2) && 2 <= \old(x)) && \old(x) <= 2)) || ((((\result <= 3 && 3 <= \old(x)) && \old(x) == x) && \old(x) <= 3) && 3 <= \result)) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || ((((\old(x) == x && 22 <= \result) && \old(x) <= 22) && \result <= 22) && 22 <= \old(x))) || ((((13 <= \old(x) && \old(x) <= 13) && \old(x) == x) && \result <= 13) && 13 <= \result)) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((((\result <= 8 && \old(x) == x) && 8 <= \old(x)) && 8 <= \result) && \old(x) <= 8)) || ((((\old(x) == x && \old(x) <= 24) && \result <= 24) && 24 <= \old(x)) && 24 <= \result)) || ((((\result <= 6 && \old(x) == x) && 6 <= \old(x)) && 6 <= \result) && \old(x) <= 6)) || ((((19 <= \result && \result <= 19) && \old(x) == x) && \old(x) <= 19) && 19 <= \old(x))) || ((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) && \old(x) <= 1)) || (\old(x) == x && 26 <= \old(x))) || ((((5 <= \result && 5 <= \old(x)) && \old(x) <= 5) && \old(x) == x) && \result <= 5)) || ((((\result <= 23 && \old(x) == x) && 23 <= \old(x)) && \old(x) <= 23) && 23 <= \result)) || ((((\result <= 17 && 17 <= \result) && \old(x) == x) && \old(x) <= 17) && 17 <= \old(x))) || (((25 <= \old(x) && \old(x) == x) && \result <= 25) && 25 <= \result)) || ((((\old(x) == x && \old(x) <= 20) && 20 <= \result) && \result <= 20) && 20 <= \old(x))) || ((((\result <= 14 && 14 <= \old(x)) && \old(x) == x) && 14 <= \result) && \old(x) <= 14)) || ((((12 <= \old(x) && \old(x) == x) && \result <= 12) && \old(x) <= 12) && 12 <= \result)) || (((11 <= \old(x) && \old(x) == x) && \result <= 11) && 11 <= \result)) || ((\old(x) == x && \result == 0) && \old(x) == 0)) || ((((\result <= 18 && 18 <= \old(x)) && \old(x) == x) && 18 <= \result) && \old(x) <= 18)) || ((((\old(x) <= 21 && 21 <= \old(x)) && 21 <= \result) && \old(x) == x) && \result <= 21)) && ((((((((((((((((\old(x) == x && 26 <= \old(x)) || ((((15 <= \result && 15 <= \old(x)) && \old(x) == x) && \old(x) <= 15) && \result <= 15)) || ((((\result <= 16 && \old(x) == x) && 16 <= \old(x)) && \old(x) <= 16) && 16 <= \result)) || ((((\result <= 23 && \old(x) == x) && 23 <= \old(x)) && \old(x) <= 23) && 23 <= \result)) || !(12 <= \old(x))) || ((((\result <= 17 && 17 <= \result) && \old(x) == x) && \old(x) <= 17) && 17 <= \old(x))) || ((((\old(x) == x && 22 <= \result) && \old(x) <= 22) && \result <= 22) && 22 <= \old(x))) || (((25 <= \old(x) && \old(x) == x) && \result <= 25) && 25 <= \result)) || ((((13 <= \old(x) && \old(x) <= 13) && \old(x) == x) && \result <= 13) && 13 <= \result)) || ((((\old(x) == x && \old(x) <= 20) && 20 <= \result) && \result <= 20) && 20 <= \old(x))) || ((((\result <= 14 && 14 <= \old(x)) && \old(x) == x) && 14 <= \result) && \old(x) <= 14)) || ((((12 <= \old(x) && \old(x) == x) && \result <= 12) && \old(x) <= 12) && 12 <= \result)) || ((((\old(x) == x && \old(x) <= 24) && \result <= 24) && 24 <= \old(x)) && 24 <= \result)) || ((((19 <= \result && \result <= 19) && \old(x) == x) && \old(x) <= 19) && 19 <= \old(x))) || ((((\result <= 18 && 18 <= \old(x)) && \old(x) == x) && 18 <= \result) && \old(x) <= 18)) || ((((\old(x) <= 21 && 21 <= \old(x)) && 21 <= \result) && \old(x) == x) && \result <= 21)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 39.3s, OverallIterations: 27, TraceHistogramMax: 27, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 659 SDtfs, 1773 SDslu, 6608 SDs, 0 SdLazy, 7212 SolverSat, 234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1673 GetRequests, 838 SyntacticMatches, 0 SemanticMatches, 835 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5600 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=26, 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, 27 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 259 PreInvPairs, 2518 NumberOfFragments, 2730 HoareAnnotationTreeSize, 259 FomulaSimplifications, 1786 FormulaSimplificationTreeSizeReduction, 4.9s HoareSimplificationTime, 25 FomulaSimplificationsInter, 30158 FormulaSimplificationTreeSizeReductionInter, 6.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...