/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:55:55,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:55:55,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:55:55,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:55:55,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:55:55,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:55:55,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:55:55,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:55:55,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:55:55,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:55:55,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:55:55,330 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:55:55,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:55:55,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:55:55,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:55:55,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:55:55,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:55:55,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:55:55,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:55:55,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:55:55,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:55:55,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:55:55,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:55:55,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:55:55,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:55:55,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:55:55,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:55:55,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:55:55,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:55:55,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:55:55,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:55:55,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:55:55,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:55:55,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:55:55,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:55:55,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:55:55,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:55:55,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:55:55,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:55:55,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:55:55,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:55:55,400 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 21:55:55,418 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:55:55,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:55:55,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:55:55,422 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:55:55,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:55:55,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:55:55,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:55:55,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:55:55,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:55:55,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:55:55,425 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:55:55,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:55:55,425 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:55:55,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:55:55,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:55:55,426 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:55:55,426 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:55:55,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:55:55,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:55:55,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:55:55,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:55:55,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:55:55,428 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 21:55:55,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:55:55,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:55:55,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:55:55,920 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:55:55,920 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:55:55,922 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-2.c [2020-09-04 21:55:56,019 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/943599c0d/7d0cdc063df24a57ae825ad3585c514f/FLAG967051d16 [2020-09-04 21:55:56,589 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:55:56,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c [2020-09-04 21:55:56,599 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/943599c0d/7d0cdc063df24a57ae825ad3585c514f/FLAG967051d16 [2020-09-04 21:55:56,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/943599c0d/7d0cdc063df24a57ae825ad3585c514f [2020-09-04 21:55:56,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:55:56,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:55:56,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:55:56,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:55:56,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:55:56,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:55:56" (1/1) ... [2020-09-04 21:55:56,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5c20e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:56, skipping insertion in model container [2020-09-04 21:55:56,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:55:56" (1/1) ... [2020-09-04 21:55:56,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:55:56,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:55:57,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:55:57,230 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:55:57,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:55:57,265 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:55:57,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:57 WrapperNode [2020-09-04 21:55:57,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:55:57,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:55:57,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:55:57,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:55:57,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:57" (1/1) ... [2020-09-04 21:55:57,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:57" (1/1) ... [2020-09-04 21:55:57,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:57" (1/1) ... [2020-09-04 21:55:57,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:57" (1/1) ... [2020-09-04 21:55:57,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:57" (1/1) ... [2020-09-04 21:55:57,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:57" (1/1) ... [2020-09-04 21:55:57,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:57" (1/1) ... [2020-09-04 21:55:57,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:55:57,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:55:57,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:55:57,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:55:57,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:57" (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 21:55:57,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:55:57,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:55:57,486 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 21:55:57,486 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:55:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:55:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:55:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 21:55:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:55:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:55:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:55:57,701 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:55:57,701 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:55:57,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:55:57 BoogieIcfgContainer [2020-09-04 21:55:57,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:55:57,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:55:57,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:55:57,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:55:57,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:55:56" (1/3) ... [2020-09-04 21:55:57,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19edb07e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:55:57, skipping insertion in model container [2020-09-04 21:55:57,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:57" (2/3) ... [2020-09-04 21:55:57,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19edb07e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:55:57, skipping insertion in model container [2020-09-04 21:55:57,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:55:57" (3/3) ... [2020-09-04 21:55:57,717 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2020-09-04 21:55:57,728 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:55:57,737 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:55:57,760 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:55:57,791 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:55:57,791 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:55:57,791 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:55:57,791 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:55:57,792 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:55:57,792 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:55:57,792 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:55:57,792 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:55:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-09-04 21:55:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:55:57,830 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:57,831 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:57,832 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:57,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:57,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-09-04 21:55:57,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:57,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1283124413] [2020-09-04 21:55:57,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,098 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 21:55:58,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1283124413] [2020-09-04 21:55:58,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:55:58,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:55:58,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709240198] [2020-09-04 21:55:58,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:55:58,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:58,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:55:58,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:55:58,160 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-09-04 21:55:58,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:58,291 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-09-04 21:55:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:55:58,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:55:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:58,309 INFO L225 Difference]: With dead ends: 37 [2020-09-04 21:55:58,309 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 21:55:58,314 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 21:55:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 21:55:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-04 21:55:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-04 21:55:58,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-09-04 21:55:58,378 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-09-04 21:55:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:58,378 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-09-04 21:55:58,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:55:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-09-04 21:55:58,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 21:55:58,381 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:58,381 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 21:55:58,382 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:55:58,382 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:58,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:58,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-09-04 21:55:58,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:58,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [653614756] [2020-09-04 21:55:58,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 21:55:58,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [653614756] [2020-09-04 21:55:58,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:58,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:55:58,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40560592] [2020-09-04 21:55:58,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:55:58,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:58,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:55:58,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:55:58,537 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-09-04 21:55:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:58,612 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-04 21:55:58,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:55:58,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-04 21:55:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:58,615 INFO L225 Difference]: With dead ends: 34 [2020-09-04 21:55:58,615 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 21:55:58,617 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 21:55:58,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 21:55:58,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 21:55:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 21:55:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-09-04 21:55:58,630 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-09-04 21:55:58,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:58,631 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-09-04 21:55:58,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:55:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-09-04 21:55:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 21:55:58,633 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:58,633 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 21:55:58,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:55:58,634 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:58,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:58,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-09-04 21:55:58,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:58,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [698032538] [2020-09-04 21:55:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 21:55:58,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [698032538] [2020-09-04 21:55:58,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:58,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:55:58,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648448978] [2020-09-04 21:55:58,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:55:58,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:58,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:55:58,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:55:58,842 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-09-04 21:55:58,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:58,945 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-09-04 21:55:58,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:55:58,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-09-04 21:55:58,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:58,948 INFO L225 Difference]: With dead ends: 39 [2020-09-04 21:55:58,948 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 21:55:58,949 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 21:55:58,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 21:55:58,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-04 21:55:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-04 21:55:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-04 21:55:58,963 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-09-04 21:55:58,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:58,964 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-04 21:55:58,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:55:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-04 21:55:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 21:55:58,966 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:58,966 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 21:55:58,967 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:55:58,967 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:58,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:58,968 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-09-04 21:55:58,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:58,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [345139169] [2020-09-04 21:55:58,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,245 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-04 21:55:59,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [345139169] [2020-09-04 21:55:59,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:59,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:55:59,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091964108] [2020-09-04 21:55:59,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:55:59,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:59,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:55:59,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:55:59,249 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-09-04 21:55:59,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:59,396 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-09-04 21:55:59,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:55:59,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-09-04 21:55:59,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:59,399 INFO L225 Difference]: With dead ends: 44 [2020-09-04 21:55:59,400 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 21:55:59,401 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 21:55:59,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 21:55:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-09-04 21:55:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 21:55:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-09-04 21:55:59,416 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-09-04 21:55:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:59,417 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-09-04 21:55:59,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:55:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-09-04 21:55:59,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 21:55:59,423 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:59,424 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 21:55:59,424 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:55:59,424 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:59,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:59,425 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-09-04 21:55:59,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:59,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1602285498] [2020-09-04 21:55:59,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 21:55:59,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1602285498] [2020-09-04 21:55:59,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:59,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:55:59,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728315538] [2020-09-04 21:55:59,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:55:59,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:59,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:55:59,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:55:59,718 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-09-04 21:55:59,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:59,843 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-04 21:55:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:55:59,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-09-04 21:55:59,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:59,846 INFO L225 Difference]: With dead ends: 49 [2020-09-04 21:55:59,846 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 21:55:59,847 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 21:55:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 21:55:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-09-04 21:55:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-09-04 21:55:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-09-04 21:55:59,859 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-09-04 21:55:59,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:59,860 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-09-04 21:55:59,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:55:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-09-04 21:55:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 21:55:59,862 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:59,862 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 21:55:59,863 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:55:59,863 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:59,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:59,867 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-09-04 21:55:59,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:59,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [688003256] [2020-09-04 21:55:59,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 21:56:00,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [688003256] [2020-09-04 21:56:00,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:00,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:56:00,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382129153] [2020-09-04 21:56:00,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:56:00,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:00,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:56:00,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:56:00,234 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 10 states. [2020-09-04 21:56:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:00,375 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-09-04 21:56:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:56:00,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2020-09-04 21:56:00,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:00,379 INFO L225 Difference]: With dead ends: 54 [2020-09-04 21:56:00,379 INFO L226 Difference]: Without dead ends: 48 [2020-09-04 21:56:00,381 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 21:56:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-04 21:56:00,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-04 21:56:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-04 21:56:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-04 21:56:00,399 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 56 [2020-09-04 21:56:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:00,400 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-04 21:56:00,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:56:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-04 21:56:00,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 21:56:00,402 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:00,403 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 21:56:00,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:56:00,403 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:00,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:00,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1000802417, now seen corresponding path program 6 times [2020-09-04 21:56:00,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:00,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863520386] [2020-09-04 21:56:00,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-09-04 21:56:00,675 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863520386] [2020-09-04 21:56:00,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:00,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:56:00,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705131493] [2020-09-04 21:56:00,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:56:00,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:00,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:56:00,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:56:00,677 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2020-09-04 21:56:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:00,792 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-09-04 21:56:00,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:56:00,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-09-04 21:56:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:00,795 INFO L225 Difference]: With dead ends: 59 [2020-09-04 21:56:00,795 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 21:56:00,796 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 21:56:00,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 21:56:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-09-04 21:56:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-09-04 21:56:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-09-04 21:56:00,807 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 64 [2020-09-04 21:56:00,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:00,808 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-09-04 21:56:00,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:56:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-09-04 21:56:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 21:56:00,810 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:00,810 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 21:56:00,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:56:00,810 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:00,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1977618599, now seen corresponding path program 7 times [2020-09-04 21:56:00,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:00,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1027348916] [2020-09-04 21:56:00,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-04 21:56:01,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1027348916] [2020-09-04 21:56:01,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:01,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:56:01,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554507261] [2020-09-04 21:56:01,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:56:01,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:01,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:56:01,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:56:01,117 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2020-09-04 21:56:01,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:01,253 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-09-04 21:56:01,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:56:01,254 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2020-09-04 21:56:01,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:01,256 INFO L225 Difference]: With dead ends: 64 [2020-09-04 21:56:01,256 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 21:56:01,257 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 21:56:01,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 21:56:01,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-09-04 21:56:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 21:56:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-09-04 21:56:01,268 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 72 [2020-09-04 21:56:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:01,268 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-09-04 21:56:01,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:56:01,269 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-09-04 21:56:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-09-04 21:56:01,270 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:01,271 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 21:56:01,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:56:01,271 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:01,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:01,272 INFO L82 PathProgramCache]: Analyzing trace with hash 555623729, now seen corresponding path program 8 times [2020-09-04 21:56:01,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:01,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1739923776] [2020-09-04 21:56:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-09-04 21:56:01,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1739923776] [2020-09-04 21:56:01,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:01,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:56:01,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106578965] [2020-09-04 21:56:01,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:56:01,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:01,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:56:01,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:56:01,607 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2020-09-04 21:56:01,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:01,750 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-09-04 21:56:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:56:01,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2020-09-04 21:56:01,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:01,752 INFO L225 Difference]: With dead ends: 69 [2020-09-04 21:56:01,752 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 21:56:01,753 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 21:56:01,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 21:56:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-09-04 21:56:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-09-04 21:56:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-09-04 21:56:01,764 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 80 [2020-09-04 21:56:01,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:01,765 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-09-04 21:56:01,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:56:01,765 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-09-04 21:56:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-09-04 21:56:01,766 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:01,767 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 21:56:01,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:56:01,767 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:01,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:01,768 INFO L82 PathProgramCache]: Analyzing trace with hash 777699815, now seen corresponding path program 9 times [2020-09-04 21:56:01,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:01,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2123043614] [2020-09-04 21:56:01,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-04 21:56:02,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2123043614] [2020-09-04 21:56:02,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:02,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:56:02,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25830352] [2020-09-04 21:56:02,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:56:02,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:02,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:56:02,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:56:02,173 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 14 states. [2020-09-04 21:56:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:02,347 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-09-04 21:56:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:56:02,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2020-09-04 21:56:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:02,349 INFO L225 Difference]: With dead ends: 74 [2020-09-04 21:56:02,349 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 21:56:02,351 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 21:56:02,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 21:56:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-09-04 21:56:02,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 21:56:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-09-04 21:56:02,362 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 88 [2020-09-04 21:56:02,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:02,362 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-09-04 21:56:02,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:56:02,363 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-09-04 21:56:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-09-04 21:56:02,364 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:02,364 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 21:56:02,364 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:56:02,365 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:02,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:02,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2145915377, now seen corresponding path program 10 times [2020-09-04 21:56:02,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:02,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2108580355] [2020-09-04 21:56:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-09-04 21:56:02,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2108580355] [2020-09-04 21:56:02,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:02,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:56:02,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314126780] [2020-09-04 21:56:02,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:56:02,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:02,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:56:02,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:56:02,876 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 15 states. [2020-09-04 21:56:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:03,057 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-09-04 21:56:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 21:56:03,058 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2020-09-04 21:56:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:03,059 INFO L225 Difference]: With dead ends: 79 [2020-09-04 21:56:03,059 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 21:56:03,063 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 21:56:03,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 21:56:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-09-04 21:56:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-09-04 21:56:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2020-09-04 21:56:03,090 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 96 [2020-09-04 21:56:03,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:03,090 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2020-09-04 21:56:03,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:56:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2020-09-04 21:56:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-04 21:56:03,093 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:03,093 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 21:56:03,093 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:56:03,094 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:03,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:03,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1180214055, now seen corresponding path program 11 times [2020-09-04 21:56:03,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:03,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1066732588] [2020-09-04 21:56:03,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-09-04 21:56:03,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1066732588] [2020-09-04 21:56:03,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:03,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 21:56:03,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674123351] [2020-09-04 21:56:03,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 21:56:03,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:03,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 21:56:03,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:56:03,774 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 16 states. [2020-09-04 21:56:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:04,020 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-09-04 21:56:04,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:56:04,021 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-09-04 21:56:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:04,023 INFO L225 Difference]: With dead ends: 84 [2020-09-04 21:56:04,023 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 21:56:04,028 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:56:04,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 21:56:04,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-04 21:56:04,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 21:56:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2020-09-04 21:56:04,052 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 104 [2020-09-04 21:56:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:04,053 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2020-09-04 21:56:04,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 21:56:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2020-09-04 21:56:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-09-04 21:56:04,057 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:04,057 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 21:56:04,058 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 21:56:04,058 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:04,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1287598415, now seen corresponding path program 12 times [2020-09-04 21:56:04,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:04,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [198583521] [2020-09-04 21:56:04,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-09-04 21:56:04,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [198583521] [2020-09-04 21:56:04,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:04,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 21:56:04,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822705908] [2020-09-04 21:56:04,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 21:56:04,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:04,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 21:56:04,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:56:04,844 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 17 states. [2020-09-04 21:56:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:05,096 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-09-04 21:56:05,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 21:56:05,097 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2020-09-04 21:56:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:05,099 INFO L225 Difference]: With dead ends: 89 [2020-09-04 21:56:05,099 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 21:56:05,101 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 21:56:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 21:56:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-09-04 21:56:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-09-04 21:56:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2020-09-04 21:56:05,115 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 112 [2020-09-04 21:56:05,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:05,115 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2020-09-04 21:56:05,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 21:56:05,115 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2020-09-04 21:56:05,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-09-04 21:56:05,120 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:05,121 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 21:56:05,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 21:56:05,121 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:05,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:05,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1612559463, now seen corresponding path program 13 times [2020-09-04 21:56:05,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:05,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [142176010] [2020-09-04 21:56:05,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-09-04 21:56:05,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [142176010] [2020-09-04 21:56:05,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:05,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-04 21:56:05,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139063858] [2020-09-04 21:56:05,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 21:56:05,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:05,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 21:56:05,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:56:05,867 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 18 states. [2020-09-04 21:56:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:06,096 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-09-04 21:56:06,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:56:06,098 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2020-09-04 21:56:06,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:06,100 INFO L225 Difference]: With dead ends: 94 [2020-09-04 21:56:06,101 INFO L226 Difference]: Without dead ends: 88 [2020-09-04 21:56:06,103 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 21:56:06,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-09-04 21:56:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-09-04 21:56:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-09-04 21:56:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2020-09-04 21:56:06,116 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 120 [2020-09-04 21:56:06,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:06,117 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2020-09-04 21:56:06,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 21:56:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2020-09-04 21:56:06,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 21:56:06,119 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:06,119 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 21:56:06,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 21:56:06,119 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:06,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:06,120 INFO L82 PathProgramCache]: Analyzing trace with hash 996432753, now seen corresponding path program 14 times [2020-09-04 21:56:06,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:06,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2046954252] [2020-09-04 21:56:06,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-09-04 21:56:07,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2046954252] [2020-09-04 21:56:07,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:07,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 21:56:07,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249729776] [2020-09-04 21:56:07,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 21:56:07,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:07,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 21:56:07,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:56:07,084 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 19 states. [2020-09-04 21:56:07,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:07,376 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-09-04 21:56:07,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:56:07,377 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 128 [2020-09-04 21:56:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:07,379 INFO L225 Difference]: With dead ends: 99 [2020-09-04 21:56:07,379 INFO L226 Difference]: Without dead ends: 93 [2020-09-04 21:56:07,382 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 21:56:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-09-04 21:56:07,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-09-04 21:56:07,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-04 21:56:07,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2020-09-04 21:56:07,392 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 128 [2020-09-04 21:56:07,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:07,393 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2020-09-04 21:56:07,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 21:56:07,393 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2020-09-04 21:56:07,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-09-04 21:56:07,395 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:07,395 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 21:56:07,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 21:56:07,396 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:07,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:07,396 INFO L82 PathProgramCache]: Analyzing trace with hash 418248103, now seen corresponding path program 15 times [2020-09-04 21:56:07,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:07,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [542580497] [2020-09-04 21:56:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-09-04 21:56:08,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [542580497] [2020-09-04 21:56:08,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:08,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-04 21:56:08,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108041316] [2020-09-04 21:56:08,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 21:56:08,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:08,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 21:56:08,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:56:08,405 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 20 states. [2020-09-04 21:56:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:08,720 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-09-04 21:56:08,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 21:56:08,720 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 136 [2020-09-04 21:56:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:08,722 INFO L225 Difference]: With dead ends: 104 [2020-09-04 21:56:08,722 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 21:56:08,723 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 21:56:08,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 21:56:08,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-09-04 21:56:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-09-04 21:56:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2020-09-04 21:56:08,735 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 136 [2020-09-04 21:56:08,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:08,737 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2020-09-04 21:56:08,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 21:56:08,737 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2020-09-04 21:56:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-09-04 21:56:08,739 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:08,739 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 21:56:08,739 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 21:56:08,740 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:08,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:08,740 INFO L82 PathProgramCache]: Analyzing trace with hash 2106505265, now seen corresponding path program 16 times [2020-09-04 21:56:08,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:08,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1061071629] [2020-09-04 21:56:08,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-09-04 21:56:09,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1061071629] [2020-09-04 21:56:09,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:09,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-04 21:56:09,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471905286] [2020-09-04 21:56:09,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 21:56:09,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:09,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 21:56:09,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:56:09,864 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 21 states. [2020-09-04 21:56:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:10,198 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-09-04 21:56:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 21:56:10,198 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 144 [2020-09-04 21:56:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:10,200 INFO L225 Difference]: With dead ends: 109 [2020-09-04 21:56:10,201 INFO L226 Difference]: Without dead ends: 103 [2020-09-04 21:56:10,203 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2020-09-04 21:56:10,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-09-04 21:56:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-09-04 21:56:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-04 21:56:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2020-09-04 21:56:10,212 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 144 [2020-09-04 21:56:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:10,213 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2020-09-04 21:56:10,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 21:56:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2020-09-04 21:56:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-09-04 21:56:10,215 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:10,215 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 21:56:10,216 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 21:56:10,216 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:10,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:10,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1225615079, now seen corresponding path program 17 times [2020-09-04 21:56:10,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:10,217 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [550180745] [2020-09-04 21:56:10,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-09-04 21:56:11,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [550180745] [2020-09-04 21:56:11,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:11,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-04 21:56:11,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608083388] [2020-09-04 21:56:11,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 21:56:11,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:11,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 21:56:11,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:56:11,509 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 22 states. [2020-09-04 21:56:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:11,870 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-09-04 21:56:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 21:56:11,871 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 152 [2020-09-04 21:56:11,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:11,873 INFO L225 Difference]: With dead ends: 114 [2020-09-04 21:56:11,873 INFO L226 Difference]: Without dead ends: 108 [2020-09-04 21:56:11,876 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-09-04 21:56:11,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-09-04 21:56:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-09-04 21:56:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-09-04 21:56:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2020-09-04 21:56:11,892 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 152 [2020-09-04 21:56:11,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:11,893 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2020-09-04 21:56:11,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 21:56:11,893 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2020-09-04 21:56:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-09-04 21:56:11,895 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:11,895 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 21:56:11,896 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 21:56:11,896 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:11,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:11,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2080643855, now seen corresponding path program 18 times [2020-09-04 21:56:11,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:11,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [756384556] [2020-09-04 21:56:11,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-09-04 21:56:13,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [756384556] [2020-09-04 21:56:13,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:13,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 21:56:13,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861904055] [2020-09-04 21:56:13,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 21:56:13,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:13,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 21:56:13,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-09-04 21:56:13,365 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 23 states. [2020-09-04 21:56:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:13,738 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-09-04 21:56:13,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 21:56:13,739 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 160 [2020-09-04 21:56:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:13,742 INFO L225 Difference]: With dead ends: 119 [2020-09-04 21:56:13,742 INFO L226 Difference]: Without dead ends: 113 [2020-09-04 21:56:13,745 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 21:56:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-09-04 21:56:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-09-04 21:56:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-09-04 21:56:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2020-09-04 21:56:13,762 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 160 [2020-09-04 21:56:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:13,763 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2020-09-04 21:56:13,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 21:56:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2020-09-04 21:56:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-09-04 21:56:13,766 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:13,766 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 21:56:13,766 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 21:56:13,767 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:13,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:13,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1136658471, now seen corresponding path program 19 times [2020-09-04 21:56:13,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:13,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1015465129] [2020-09-04 21:56:13,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-09-04 21:56:15,333 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1015465129] [2020-09-04 21:56:15,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:15,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-09-04 21:56:15,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533229833] [2020-09-04 21:56:15,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 21:56:15,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:15,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 21:56:15,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:56:15,336 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 24 states. [2020-09-04 21:56:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:15,655 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-09-04 21:56:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 21:56:15,655 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 168 [2020-09-04 21:56:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:15,657 INFO L225 Difference]: With dead ends: 124 [2020-09-04 21:56:15,657 INFO L226 Difference]: Without dead ends: 118 [2020-09-04 21:56:15,660 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2020-09-04 21:56:15,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-09-04 21:56:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2020-09-04 21:56:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-09-04 21:56:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2020-09-04 21:56:15,671 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 168 [2020-09-04 21:56:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:15,671 INFO L479 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2020-09-04 21:56:15,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 21:56:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2020-09-04 21:56:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-09-04 21:56:15,674 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:15,674 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 21:56:15,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 21:56:15,674 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:15,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:15,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1108876879, now seen corresponding path program 20 times [2020-09-04 21:56:15,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:15,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2034458720] [2020-09-04 21:56:15,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-09-04 21:56:16,937 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2034458720] [2020-09-04 21:56:16,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:16,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-09-04 21:56:16,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025558900] [2020-09-04 21:56:16,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 21:56:16,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:16,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 21:56:16,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:56:16,939 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 25 states. [2020-09-04 21:56:17,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:17,305 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-09-04 21:56:17,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 21:56:17,305 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 176 [2020-09-04 21:56:17,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:17,307 INFO L225 Difference]: With dead ends: 129 [2020-09-04 21:56:17,307 INFO L226 Difference]: Without dead ends: 123 [2020-09-04 21:56:17,308 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 21:56:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-09-04 21:56:17,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-09-04 21:56:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-04 21:56:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2020-09-04 21:56:17,318 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 176 [2020-09-04 21:56:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:17,319 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2020-09-04 21:56:17,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 21:56:17,319 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2020-09-04 21:56:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-09-04 21:56:17,321 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:17,322 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 21:56:17,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 21:56:17,322 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:17,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:17,322 INFO L82 PathProgramCache]: Analyzing trace with hash 390715751, now seen corresponding path program 21 times [2020-09-04 21:56:17,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:17,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1462581242] [2020-09-04 21:56:17,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-09-04 21:56:18,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1462581242] [2020-09-04 21:56:18,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:18,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-09-04 21:56:18,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403767947] [2020-09-04 21:56:18,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-04 21:56:18,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:18,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-04 21:56:18,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2020-09-04 21:56:18,726 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 26 states. [2020-09-04 21:56:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:19,096 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2020-09-04 21:56:19,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 21:56:19,099 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 184 [2020-09-04 21:56:19,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:19,103 INFO L225 Difference]: With dead ends: 134 [2020-09-04 21:56:19,103 INFO L226 Difference]: Without dead ends: 128 [2020-09-04 21:56:19,105 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 21:56:19,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-09-04 21:56:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-09-04 21:56:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-09-04 21:56:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2020-09-04 21:56:19,122 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 184 [2020-09-04 21:56:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:19,123 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2020-09-04 21:56:19,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-04 21:56:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2020-09-04 21:56:19,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-09-04 21:56:19,126 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:19,127 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 21:56:19,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 21:56:19,127 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:19,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:19,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1081168271, now seen corresponding path program 22 times [2020-09-04 21:56:19,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:19,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [176278012] [2020-09-04 21:56:19,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:20,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:20,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:20,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:20,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:20,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:20,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:20,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:20,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2020-09-04 21:56:20,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [176278012] [2020-09-04 21:56:20,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:20,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-09-04 21:56:20,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492231274] [2020-09-04 21:56:20,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 21:56:20,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:20,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 21:56:20,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2020-09-04 21:56:20,732 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 27 states. [2020-09-04 21:56:21,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:21,148 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2020-09-04 21:56:21,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 21:56:21,149 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 192 [2020-09-04 21:56:21,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:21,150 INFO L225 Difference]: With dead ends: 139 [2020-09-04 21:56:21,150 INFO L226 Difference]: Without dead ends: 133 [2020-09-04 21:56:21,152 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 21:56:21,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-09-04 21:56:21,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-09-04 21:56:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-04 21:56:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2020-09-04 21:56:21,161 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 192 [2020-09-04 21:56:21,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:21,161 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2020-09-04 21:56:21,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 21:56:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2020-09-04 21:56:21,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-09-04 21:56:21,164 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:21,164 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 21:56:21,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 21:56:21,164 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:21,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash -856761689, now seen corresponding path program 23 times [2020-09-04 21:56:21,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:21,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [519591727] [2020-09-04 21:56:21,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:21,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:21,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:21,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:21,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:21,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:21,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:21,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:21,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:21,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:21,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:21,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:21,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:22,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:22,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:22,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:22,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:22,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:22,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:22,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:22,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:22,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:22,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:22,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:22,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:22,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2020-09-04 21:56:22,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [519591727] [2020-09-04 21:56:22,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:22,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-09-04 21:56:22,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255211032] [2020-09-04 21:56:22,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-09-04 21:56:22,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:22,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-09-04 21:56:22,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:56:22,818 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 28 states. [2020-09-04 21:56:23,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:23,308 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2020-09-04 21:56:23,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 21:56:23,308 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 200 [2020-09-04 21:56:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:23,310 INFO L225 Difference]: With dead ends: 144 [2020-09-04 21:56:23,310 INFO L226 Difference]: Without dead ends: 138 [2020-09-04 21:56:23,312 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2020-09-04 21:56:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-09-04 21:56:23,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-09-04 21:56:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-09-04 21:56:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2020-09-04 21:56:23,321 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 200 [2020-09-04 21:56:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:23,322 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2020-09-04 21:56:23,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-09-04 21:56:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2020-09-04 21:56:23,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-09-04 21:56:23,325 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:23,325 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 21:56:23,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 21:56:23,326 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:23,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:23,326 INFO L82 PathProgramCache]: Analyzing trace with hash 36457265, now seen corresponding path program 24 times [2020-09-04 21:56:23,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:23,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [948918577] [2020-09-04 21:56:23,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:23,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:23,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:23,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:23,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:23,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:23,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:23,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:23,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:23,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:23,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2020-09-04 21:56:25,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [948918577] [2020-09-04 21:56:25,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:25,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-09-04 21:56:25,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307043484] [2020-09-04 21:56:25,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-09-04 21:56:25,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:25,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-09-04 21:56:25,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2020-09-04 21:56:25,036 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 29 states. [2020-09-04 21:56:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:25,519 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2020-09-04 21:56:25,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-04 21:56:25,520 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 208 [2020-09-04 21:56:25,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:25,522 INFO L225 Difference]: With dead ends: 149 [2020-09-04 21:56:25,522 INFO L226 Difference]: Without dead ends: 143 [2020-09-04 21:56:25,524 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2020-09-04 21:56:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-09-04 21:56:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2020-09-04 21:56:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-09-04 21:56:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2020-09-04 21:56:25,533 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 208 [2020-09-04 21:56:25,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:25,533 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2020-09-04 21:56:25,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-09-04 21:56:25,533 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2020-09-04 21:56:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-09-04 21:56:25,535 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:25,535 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 21:56:25,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 21:56:25,535 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:25,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:25,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1460466713, now seen corresponding path program 25 times [2020-09-04 21:56:25,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:25,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1893386699] [2020-09-04 21:56:25,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:56:25,568 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:56:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:56:25,618 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:56:25,662 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 21:56:25,663 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 21:56:25,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-04 21:56:25,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:56:25 BoogieIcfgContainer [2020-09-04 21:56:25,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:56:25,739 INFO L168 Benchmark]: Toolchain (without parser) took 28798.93 ms. Allocated memory was 144.2 MB in the beginning and 768.6 MB in the end (delta: 624.4 MB). Free memory was 101.9 MB in the beginning and 109.8 MB in the end (delta: -7.9 MB). Peak memory consumption was 616.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:25,739 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 144.2 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 21:56:25,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.83 ms. Allocated memory is still 144.2 MB. Free memory was 101.7 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 21:56:25,741 INFO L168 Benchmark]: Boogie Preprocessor took 31.83 ms. Allocated memory is still 144.2 MB. Free memory was 92.4 MB in the beginning and 91.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:25,745 INFO L168 Benchmark]: RCFGBuilder took 407.70 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 91.1 MB in the beginning and 169.5 MB in the end (delta: -78.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:25,746 INFO L168 Benchmark]: TraceAbstraction took 28026.57 ms. Allocated memory was 201.9 MB in the beginning and 768.6 MB in the end (delta: 566.8 MB). Free memory was 168.8 MB in the beginning and 109.8 MB in the end (delta: 59.0 MB). Peak memory consumption was 625.8 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:25,747 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 144.2 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 326.83 ms. Allocated memory is still 144.2 MB. Free memory was 101.7 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 31.83 ms. Allocated memory is still 144.2 MB. Free memory was 92.4 MB in the beginning and 91.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 407.70 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 91.1 MB in the beginning and 169.5 MB in the end (delta: -78.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28026.57 ms. Allocated memory was 201.9 MB in the beginning and 768.6 MB in the end (delta: 566.8 MB). Free memory was 168.8 MB in the beginning and 109.8 MB in the end (delta: 59.0 MB). Peak memory consumption was 625.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 25; VAL [input=25] [L11] CALL, EXPR id(input) VAL [\old(x)=25] [L5] COND FALSE !(x==0) VAL [\old(x)=25, x=25] [L6] CALL, EXPR id(x-1) VAL [\old(x)=24] [L5] COND FALSE !(x==0) VAL [\old(x)=24, x=24] [L6] CALL, EXPR id(x-1) VAL [\old(x)=23] [L5] COND FALSE !(x==0) VAL [\old(x)=23, x=23] [L6] CALL, EXPR id(x-1) VAL [\old(x)=22] [L5] COND FALSE !(x==0) VAL [\old(x)=22, x=22] [L6] CALL, EXPR id(x-1) VAL [\old(x)=21] [L5] COND FALSE !(x==0) VAL [\old(x)=21, x=21] [L6] CALL, EXPR id(x-1) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 VAL [\old(x)=0, x=0] [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; VAL [\old(x)=1, \result=1, id(x-1)=0, x=1] [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; VAL [\old(x)=2, \result=2, id(x-1)=1, x=2] [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; VAL [\old(x)=3, \result=3, id(x-1)=2, x=3] [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; VAL [\old(x)=4, \result=4, id(x-1)=3, x=4] [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; VAL [\old(x)=5, \result=5, id(x-1)=4, x=5] [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; VAL [\old(x)=6, \result=6, id(x-1)=5, x=6] [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; VAL [\old(x)=7, \result=7, id(x-1)=6, x=7] [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; VAL [\old(x)=8, \result=8, id(x-1)=7, x=8] [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; VAL [\old(x)=9, \result=9, id(x-1)=8, x=9] [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; VAL [\old(x)=10, \result=10, id(x-1)=9, x=10] [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; VAL [\old(x)=11, \result=11, id(x-1)=10, x=11] [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; VAL [\old(x)=12, \result=12, id(x-1)=11, x=12] [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; VAL [\old(x)=13, \result=13, id(x-1)=12, x=13] [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; VAL [\old(x)=14, \result=14, id(x-1)=13, x=14] [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; VAL [\old(x)=15, \result=15, id(x-1)=14, x=15] [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; VAL [\old(x)=16, \result=16, id(x-1)=15, x=16] [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; VAL [\old(x)=17, \result=17, id(x-1)=16, x=17] [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; VAL [\old(x)=18, \result=18, id(x-1)=17, x=18] [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; VAL [\old(x)=19, \result=19, id(x-1)=18, x=19] [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; VAL [\old(x)=20, \result=20, id(x-1)=19, x=20] [L6] RET, EXPR id(x-1) VAL [\old(x)=21, id(x-1)=20, x=21] [L6] return id(x-1) + 1; VAL [\old(x)=21, \result=21, id(x-1)=20, x=21] [L6] RET, EXPR id(x-1) VAL [\old(x)=22, id(x-1)=21, x=22] [L6] return id(x-1) + 1; VAL [\old(x)=22, \result=22, id(x-1)=21, x=22] [L6] RET, EXPR id(x-1) VAL [\old(x)=23, id(x-1)=22, x=23] [L6] return id(x-1) + 1; VAL [\old(x)=23, \result=23, id(x-1)=22, x=23] [L6] RET, EXPR id(x-1) VAL [\old(x)=24, id(x-1)=23, x=24] [L6] return id(x-1) + 1; VAL [\old(x)=24, \result=24, id(x-1)=23, x=24] [L6] RET, EXPR id(x-1) VAL [\old(x)=25, id(x-1)=24, x=25] [L6] return id(x-1) + 1; VAL [\old(x)=25, \result=25, id(x-1)=24, x=25] [L11] RET, EXPR id(input) VAL [id(input)=25, input=25] [L11] int result = id(input); VAL [id(input)=25, input=25, result=25] [L12] COND TRUE result == 25 VAL [input=25, result=25] [L13] __VERIFIER_error() VAL [input=25, result=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 27.8s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 454 SDtfs, 1580 SDslu, 2545 SDs, 0 SdLazy, 955 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1425 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 3016 NumberOfCodeBlocks, 3016 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2775 ConstructedInterpolants, 0 QuantifiedInterpolants, 1030775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 7500/19600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...