/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/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 23:13:09,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 23:13:09,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 23:13:09,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 23:13:09,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 23:13:09,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 23:13:09,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 23:13:09,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 23:13:09,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 23:13:09,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 23:13:09,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 23:13:09,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 23:13:09,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 23:13:09,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 23:13:09,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 23:13:09,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 23:13:09,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 23:13:09,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 23:13:09,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 23:13:09,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 23:13:09,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 23:13:09,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 23:13:09,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 23:13:09,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 23:13:09,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 23:13:09,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 23:13:09,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 23:13:09,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 23:13:09,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 23:13:09,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 23:13:09,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 23:13:09,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 23:13:09,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 23:13:09,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 23:13:09,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 23:13:09,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 23:13:09,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 23:13:09,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 23:13:09,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 23:13:09,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 23:13:09,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 23:13:09,382 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 23:13:09,400 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 23:13:09,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 23:13:09,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 23:13:09,404 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 23:13:09,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 23:13:09,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 23:13:09,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 23:13:09,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 23:13:09,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 23:13:09,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 23:13:09,406 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 23:13:09,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 23:13:09,407 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 23:13:09,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 23:13:09,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 23:13:09,408 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 23:13:09,408 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 23:13:09,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 23:13:09,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:13:09,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 23:13:09,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 23:13:09,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 23:13:09,410 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 23:13:09,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 23:13:09,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 23:13:09,916 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 23:13:09,918 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 23:13:09,919 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 23:13:09,920 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2020-09-04 23:13:10,019 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/de8f77833/16c46a6ff2ab46b5b5fd3049a76b55b3/FLAG0120abd01 [2020-09-04 23:13:10,621 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 23:13:10,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2020-09-04 23:13:10,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/de8f77833/16c46a6ff2ab46b5b5fd3049a76b55b3/FLAG0120abd01 [2020-09-04 23:13:10,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/de8f77833/16c46a6ff2ab46b5b5fd3049a76b55b3 [2020-09-04 23:13:10,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 23:13:10,991 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 23:13:10,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 23:13:10,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 23:13:10,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 23:13:11,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:13:10" (1/1) ... [2020-09-04 23:13:11,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a86aac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:11, skipping insertion in model container [2020-09-04 23:13:11,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:13:10" (1/1) ... [2020-09-04 23:13:11,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 23:13:11,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 23:13:11,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:13:11,280 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 23:13:11,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:13:11,328 INFO L208 MainTranslator]: Completed translation [2020-09-04 23:13:11,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:11 WrapperNode [2020-09-04 23:13:11,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 23:13:11,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 23:13:11,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 23:13:11,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 23:13:11,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:11" (1/1) ... [2020-09-04 23:13:11,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:11" (1/1) ... [2020-09-04 23:13:11,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:11" (1/1) ... [2020-09-04 23:13:11,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:11" (1/1) ... [2020-09-04 23:13:11,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:11" (1/1) ... [2020-09-04 23:13:11,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:11" (1/1) ... [2020-09-04 23:13:11,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:11" (1/1) ... [2020-09-04 23:13:11,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 23:13:11,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 23:13:11,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 23:13:11,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 23:13:11,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:11" (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 23:13:11,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 23:13:11,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 23:13:11,532 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 23:13:11,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 23:13:11,532 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 23:13:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 23:13:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 23:13:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 23:13:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 23:13:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 23:13:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 23:13:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 23:13:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 23:13:11,933 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 23:13:11,934 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-09-04 23:13:11,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:13:11 BoogieIcfgContainer [2020-09-04 23:13:11,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 23:13:11,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 23:13:11,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 23:13:11,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 23:13:11,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 11:13:10" (1/3) ... [2020-09-04 23:13:11,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80e1393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:13:11, skipping insertion in model container [2020-09-04 23:13:11,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:11" (2/3) ... [2020-09-04 23:13:11,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80e1393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:13:11, skipping insertion in model container [2020-09-04 23:13:11,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:13:11" (3/3) ... [2020-09-04 23:13:11,953 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2020-09-04 23:13:11,966 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 23:13:11,977 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 23:13:11,999 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 23:13:12,026 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 23:13:12,027 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 23:13:12,027 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 23:13:12,027 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 23:13:12,027 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 23:13:12,027 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 23:13:12,029 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 23:13:12,029 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 23:13:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-09-04 23:13:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 23:13:12,062 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:12,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:12,064 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:12,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1441743938, now seen corresponding path program 1 times [2020-09-04 23:13:12,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:12,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1854947541] [2020-09-04 23:13:12,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:12,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:12,353 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 23:13:12,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1854947541] [2020-09-04 23:13:12,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:12,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 23:13:12,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659301411] [2020-09-04 23:13:12,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 23:13:12,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:12,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 23:13:12,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 23:13:12,382 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 5 states. [2020-09-04 23:13:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:12,628 INFO L93 Difference]: Finished difference Result 143 states and 210 transitions. [2020-09-04 23:13:12,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 23:13:12,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-09-04 23:13:12,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:12,646 INFO L225 Difference]: With dead ends: 143 [2020-09-04 23:13:12,647 INFO L226 Difference]: Without dead ends: 81 [2020-09-04 23:13:12,654 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 23:13:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-09-04 23:13:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2020-09-04 23:13:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-09-04 23:13:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2020-09-04 23:13:12,726 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 25 [2020-09-04 23:13:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:12,727 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2020-09-04 23:13:12,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 23:13:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2020-09-04 23:13:12,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 23:13:12,730 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:12,730 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:12,731 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 23:13:12,731 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:12,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:12,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1406858677, now seen corresponding path program 1 times [2020-09-04 23:13:12,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:12,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [563313165] [2020-09-04 23:13:12,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:12,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:12,821 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 23:13:12,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [563313165] [2020-09-04 23:13:12,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:12,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 23:13:12,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527198492] [2020-09-04 23:13:12,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 23:13:12,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:12,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 23:13:12,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 23:13:12,826 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand 5 states. [2020-09-04 23:13:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:12,992 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2020-09-04 23:13:12,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 23:13:12,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-09-04 23:13:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:13,000 INFO L225 Difference]: With dead ends: 85 [2020-09-04 23:13:13,001 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 23:13:13,004 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 23:13:13,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 23:13:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2020-09-04 23:13:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-09-04 23:13:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2020-09-04 23:13:13,052 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 25 [2020-09-04 23:13:13,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:13,054 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2020-09-04 23:13:13,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 23:13:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2020-09-04 23:13:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 23:13:13,057 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:13,057 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:13,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 23:13:13,059 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:13,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1771333938, now seen corresponding path program 1 times [2020-09-04 23:13:13,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:13,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1425230223] [2020-09-04 23:13:13,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:13,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:13,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:13:13,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1425230223] [2020-09-04 23:13:13,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:13,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 23:13:13,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347020945] [2020-09-04 23:13:13,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 23:13:13,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:13,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 23:13:13,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 23:13:13,232 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand 5 states. [2020-09-04 23:13:13,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:13,417 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2020-09-04 23:13:13,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 23:13:13,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-09-04 23:13:13,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:13,420 INFO L225 Difference]: With dead ends: 116 [2020-09-04 23:13:13,421 INFO L226 Difference]: Without dead ends: 114 [2020-09-04 23:13:13,421 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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 23:13:13,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-09-04 23:13:13,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2020-09-04 23:13:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-04 23:13:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2020-09-04 23:13:13,460 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 30 [2020-09-04 23:13:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:13,460 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2020-09-04 23:13:13,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 23:13:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2020-09-04 23:13:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-09-04 23:13:13,462 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:13,463 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:13,463 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 23:13:13,463 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:13,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:13,464 INFO L82 PathProgramCache]: Analyzing trace with hash 456630219, now seen corresponding path program 1 times [2020-09-04 23:13:13,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:13,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [573878457] [2020-09-04 23:13:13,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:13,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:13,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:13,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:13,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 23:13:13,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [573878457] [2020-09-04 23:13:13,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:13,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 23:13:13,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639781898] [2020-09-04 23:13:13,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 23:13:13,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:13,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 23:13:13,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:13:13,558 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand 6 states. [2020-09-04 23:13:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:13,764 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2020-09-04 23:13:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 23:13:13,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-09-04 23:13:13,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:13,767 INFO L225 Difference]: With dead ends: 106 [2020-09-04 23:13:13,768 INFO L226 Difference]: Without dead ends: 104 [2020-09-04 23:13:13,769 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:13:13,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-09-04 23:13:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-09-04 23:13:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-09-04 23:13:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2020-09-04 23:13:13,790 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 35 [2020-09-04 23:13:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:13,791 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2020-09-04 23:13:13,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 23:13:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2020-09-04 23:13:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 23:13:13,793 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:13,793 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:13,793 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 23:13:13,793 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:13,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:13,794 INFO L82 PathProgramCache]: Analyzing trace with hash 364478305, now seen corresponding path program 1 times [2020-09-04 23:13:13,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:13,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2054604126] [2020-09-04 23:13:13,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:13,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:13,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:13,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:13,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 23:13:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-04 23:13:13,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2054604126] [2020-09-04 23:13:13,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:13,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 23:13:13,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457535283] [2020-09-04 23:13:13,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 23:13:13,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:13,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 23:13:13,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 23:13:13,917 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand 5 states. [2020-09-04 23:13:14,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:14,044 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2020-09-04 23:13:14,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 23:13:14,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2020-09-04 23:13:14,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:14,052 INFO L225 Difference]: With dead ends: 135 [2020-09-04 23:13:14,053 INFO L226 Difference]: Without dead ends: 133 [2020-09-04 23:13:14,054 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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 23:13:14,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-09-04 23:13:14,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2020-09-04 23:13:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-09-04 23:13:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 162 transitions. [2020-09-04 23:13:14,102 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 162 transitions. Word has length 40 [2020-09-04 23:13:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:14,103 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 162 transitions. [2020-09-04 23:13:14,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 23:13:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2020-09-04 23:13:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-09-04 23:13:14,111 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:14,115 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:14,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 23:13:14,115 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:14,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:14,116 INFO L82 PathProgramCache]: Analyzing trace with hash 914533499, now seen corresponding path program 1 times [2020-09-04 23:13:14,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:14,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1204655816] [2020-09-04 23:13:14,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 23:13:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:13:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,210 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 23:13:14,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1204655816] [2020-09-04 23:13:14,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:14,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 23:13:14,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101349446] [2020-09-04 23:13:14,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 23:13:14,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:14,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 23:13:14,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-04 23:13:14,212 INFO L87 Difference]: Start difference. First operand 125 states and 162 transitions. Second operand 5 states. [2020-09-04 23:13:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:14,309 INFO L93 Difference]: Finished difference Result 229 states and 302 transitions. [2020-09-04 23:13:14,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 23:13:14,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2020-09-04 23:13:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:14,316 INFO L225 Difference]: With dead ends: 229 [2020-09-04 23:13:14,316 INFO L226 Difference]: Without dead ends: 128 [2020-09-04 23:13:14,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:13:14,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-09-04 23:13:14,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-09-04 23:13:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-09-04 23:13:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2020-09-04 23:13:14,364 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 58 [2020-09-04 23:13:14,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:14,364 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2020-09-04 23:13:14,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 23:13:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2020-09-04 23:13:14,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 23:13:14,366 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:14,366 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:14,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 23:13:14,367 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:14,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:14,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1807369608, now seen corresponding path program 1 times [2020-09-04 23:13:14,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:14,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [757987980] [2020-09-04 23:13:14,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-09-04 23:13:14,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [757987980] [2020-09-04 23:13:14,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:14,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:13:14,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417519224] [2020-09-04 23:13:14,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:13:14,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:14,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:13:14,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:13:14,499 INFO L87 Difference]: Start difference. First operand 128 states and 165 transitions. Second operand 7 states. [2020-09-04 23:13:14,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:14,710 INFO L93 Difference]: Finished difference Result 136 states and 172 transitions. [2020-09-04 23:13:14,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 23:13:14,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2020-09-04 23:13:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:14,713 INFO L225 Difference]: With dead ends: 136 [2020-09-04 23:13:14,713 INFO L226 Difference]: Without dead ends: 134 [2020-09-04 23:13:14,714 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:13:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-09-04 23:13:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2020-09-04 23:13:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-09-04 23:13:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 168 transitions. [2020-09-04 23:13:14,733 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 168 transitions. Word has length 64 [2020-09-04 23:13:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:14,734 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 168 transitions. [2020-09-04 23:13:14,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:13:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions. [2020-09-04 23:13:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-04 23:13:14,735 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:14,736 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:14,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 23:13:14,736 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:14,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:14,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1715909932, now seen corresponding path program 1 times [2020-09-04 23:13:14,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:14,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1376698332] [2020-09-04 23:13:14,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 23:13:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-09-04 23:13:14,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1376698332] [2020-09-04 23:13:14,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:14,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:13:14,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282206132] [2020-09-04 23:13:14,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:13:14,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:14,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:13:14,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:13:14,903 INFO L87 Difference]: Start difference. First operand 132 states and 168 transitions. Second operand 7 states. [2020-09-04 23:13:15,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:15,088 INFO L93 Difference]: Finished difference Result 162 states and 205 transitions. [2020-09-04 23:13:15,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 23:13:15,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2020-09-04 23:13:15,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:15,092 INFO L225 Difference]: With dead ends: 162 [2020-09-04 23:13:15,092 INFO L226 Difference]: Without dead ends: 160 [2020-09-04 23:13:15,092 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:13:15,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-09-04 23:13:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2020-09-04 23:13:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-09-04 23:13:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 185 transitions. [2020-09-04 23:13:15,129 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 185 transitions. Word has length 69 [2020-09-04 23:13:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:15,129 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 185 transitions. [2020-09-04 23:13:15,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:13:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 185 transitions. [2020-09-04 23:13:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-09-04 23:13:15,131 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:15,131 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:15,131 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 23:13:15,132 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:15,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:15,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1298936315, now seen corresponding path program 1 times [2020-09-04 23:13:15,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:15,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [331152528] [2020-09-04 23:13:15,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-04 23:13:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-09-04 23:13:15,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [331152528] [2020-09-04 23:13:15,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:15,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:13:15,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263616640] [2020-09-04 23:13:15,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:13:15,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:15,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:13:15,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:13:15,289 INFO L87 Difference]: Start difference. First operand 146 states and 185 transitions. Second operand 7 states. [2020-09-04 23:13:15,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:15,535 INFO L93 Difference]: Finished difference Result 210 states and 280 transitions. [2020-09-04 23:13:15,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 23:13:15,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2020-09-04 23:13:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:15,539 INFO L225 Difference]: With dead ends: 210 [2020-09-04 23:13:15,539 INFO L226 Difference]: Without dead ends: 206 [2020-09-04 23:13:15,540 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:13:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-09-04 23:13:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 188. [2020-09-04 23:13:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-09-04 23:13:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 249 transitions. [2020-09-04 23:13:15,566 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 249 transitions. Word has length 71 [2020-09-04 23:13:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:15,567 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 249 transitions. [2020-09-04 23:13:15,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:13:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 249 transitions. [2020-09-04 23:13:15,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-09-04 23:13:15,568 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:15,568 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:15,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 23:13:15,569 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:15,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:15,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1528474552, now seen corresponding path program 1 times [2020-09-04 23:13:15,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:15,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [188879651] [2020-09-04 23:13:15,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 23:13:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 23:13:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:15,707 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-09-04 23:13:15,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [188879651] [2020-09-04 23:13:15,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:15,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 23:13:15,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158114276] [2020-09-04 23:13:15,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 23:13:15,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:15,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 23:13:15,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:13:15,711 INFO L87 Difference]: Start difference. First operand 188 states and 249 transitions. Second operand 8 states. [2020-09-04 23:13:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:15,965 INFO L93 Difference]: Finished difference Result 194 states and 254 transitions. [2020-09-04 23:13:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 23:13:15,965 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2020-09-04 23:13:15,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:15,968 INFO L225 Difference]: With dead ends: 194 [2020-09-04 23:13:15,968 INFO L226 Difference]: Without dead ends: 192 [2020-09-04 23:13:15,968 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-09-04 23:13:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-09-04 23:13:15,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2020-09-04 23:13:15,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-09-04 23:13:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 252 transitions. [2020-09-04 23:13:15,993 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 252 transitions. Word has length 74 [2020-09-04 23:13:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:15,993 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 252 transitions. [2020-09-04 23:13:15,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 23:13:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 252 transitions. [2020-09-04 23:13:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-04 23:13:15,995 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:15,995 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:15,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 23:13:15,995 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:15,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1530703596, now seen corresponding path program 1 times [2020-09-04 23:13:15,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:15,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [811563371] [2020-09-04 23:13:15,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 23:13:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 23:13:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 23:13:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-09-04 23:13:16,118 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [811563371] [2020-09-04 23:13:16,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:16,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:13:16,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634946679] [2020-09-04 23:13:16,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:13:16,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:16,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:13:16,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:13:16,120 INFO L87 Difference]: Start difference. First operand 192 states and 252 transitions. Second operand 7 states. [2020-09-04 23:13:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:16,294 INFO L93 Difference]: Finished difference Result 220 states and 283 transitions. [2020-09-04 23:13:16,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 23:13:16,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2020-09-04 23:13:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:16,298 INFO L225 Difference]: With dead ends: 220 [2020-09-04 23:13:16,298 INFO L226 Difference]: Without dead ends: 218 [2020-09-04 23:13:16,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:13:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-09-04 23:13:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 206. [2020-09-04 23:13:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-09-04 23:13:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 269 transitions. [2020-09-04 23:13:16,342 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 269 transitions. Word has length 79 [2020-09-04 23:13:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:16,343 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 269 transitions. [2020-09-04 23:13:16,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:13:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 269 transitions. [2020-09-04 23:13:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-09-04 23:13:16,344 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:16,344 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:16,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 23:13:16,345 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:16,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:16,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1064000984, now seen corresponding path program 1 times [2020-09-04 23:13:16,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:16,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1979910463] [2020-09-04 23:13:16,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-04 23:13:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-04 23:13:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 23:13:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-09-04 23:13:16,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1979910463] [2020-09-04 23:13:16,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:16,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:13:16,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293242656] [2020-09-04 23:13:16,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:13:16,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:16,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:13:16,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:13:16,460 INFO L87 Difference]: Start difference. First operand 206 states and 269 transitions. Second operand 7 states. [2020-09-04 23:13:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:16,673 INFO L93 Difference]: Finished difference Result 252 states and 330 transitions. [2020-09-04 23:13:16,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 23:13:16,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2020-09-04 23:13:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:16,677 INFO L225 Difference]: With dead ends: 252 [2020-09-04 23:13:16,677 INFO L226 Difference]: Without dead ends: 246 [2020-09-04 23:13:16,679 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:13:16,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-09-04 23:13:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 230. [2020-09-04 23:13:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-09-04 23:13:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 302 transitions. [2020-09-04 23:13:16,709 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 302 transitions. Word has length 81 [2020-09-04 23:13:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:16,710 INFO L479 AbstractCegarLoop]: Abstraction has 230 states and 302 transitions. [2020-09-04 23:13:16,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:13:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 302 transitions. [2020-09-04 23:13:16,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-09-04 23:13:16,712 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:16,712 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:16,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 23:13:16,712 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:16,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:16,713 INFO L82 PathProgramCache]: Analyzing trace with hash -895183749, now seen corresponding path program 1 times [2020-09-04 23:13:16,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:16,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [349907330] [2020-09-04 23:13:16,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 23:13:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 23:13:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 23:13:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 23:13:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-09-04 23:13:16,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [349907330] [2020-09-04 23:13:16,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:16,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 23:13:16,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893440512] [2020-09-04 23:13:16,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:13:16,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:16,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:13:16,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:13:16,905 INFO L87 Difference]: Start difference. First operand 230 states and 302 transitions. Second operand 10 states. [2020-09-04 23:13:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:17,278 INFO L93 Difference]: Finished difference Result 236 states and 307 transitions. [2020-09-04 23:13:17,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 23:13:17,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-09-04 23:13:17,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:17,281 INFO L225 Difference]: With dead ends: 236 [2020-09-04 23:13:17,281 INFO L226 Difference]: Without dead ends: 234 [2020-09-04 23:13:17,282 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2020-09-04 23:13:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-09-04 23:13:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2020-09-04 23:13:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-09-04 23:13:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 305 transitions. [2020-09-04 23:13:17,318 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 305 transitions. Word has length 90 [2020-09-04 23:13:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:17,318 INFO L479 AbstractCegarLoop]: Abstraction has 234 states and 305 transitions. [2020-09-04 23:13:17,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:13:17,319 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 305 transitions. [2020-09-04 23:13:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-09-04 23:13:17,320 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:17,321 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:17,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 23:13:17,321 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:17,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:17,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1272604239, now seen corresponding path program 1 times [2020-09-04 23:13:17,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:17,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1159841432] [2020-09-04 23:13:17,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 23:13:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 23:13:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 23:13:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 23:13:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 23:13:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-09-04 23:13:17,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1159841432] [2020-09-04 23:13:17,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:17,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 23:13:17,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981052203] [2020-09-04 23:13:17,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:13:17,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:17,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:13:17,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:13:17,490 INFO L87 Difference]: Start difference. First operand 234 states and 305 transitions. Second operand 9 states. [2020-09-04 23:13:17,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:17,721 INFO L93 Difference]: Finished difference Result 262 states and 335 transitions. [2020-09-04 23:13:17,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 23:13:17,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2020-09-04 23:13:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:17,724 INFO L225 Difference]: With dead ends: 262 [2020-09-04 23:13:17,724 INFO L226 Difference]: Without dead ends: 260 [2020-09-04 23:13:17,726 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-09-04 23:13:17,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-09-04 23:13:17,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 246. [2020-09-04 23:13:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-09-04 23:13:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 318 transitions. [2020-09-04 23:13:17,753 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 318 transitions. Word has length 95 [2020-09-04 23:13:17,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:17,754 INFO L479 AbstractCegarLoop]: Abstraction has 246 states and 318 transitions. [2020-09-04 23:13:17,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:13:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 318 transitions. [2020-09-04 23:13:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-09-04 23:13:17,759 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:17,760 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:17,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 23:13:17,760 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:17,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:17,761 INFO L82 PathProgramCache]: Analyzing trace with hash -960498755, now seen corresponding path program 1 times [2020-09-04 23:13:17,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:17,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [253519919] [2020-09-04 23:13:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-04 23:13:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-04 23:13:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 23:13:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 23:13:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-04 23:13:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 23:13:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:13:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-09-04 23:13:17,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [253519919] [2020-09-04 23:13:17,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:17,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 23:13:17,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870849402] [2020-09-04 23:13:17,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:13:17,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:17,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:13:17,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:13:17,947 INFO L87 Difference]: Start difference. First operand 246 states and 318 transitions. Second operand 9 states. [2020-09-04 23:13:18,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:18,323 INFO L93 Difference]: Finished difference Result 293 states and 378 transitions. [2020-09-04 23:13:18,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 23:13:18,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2020-09-04 23:13:18,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:18,329 INFO L225 Difference]: With dead ends: 293 [2020-09-04 23:13:18,331 INFO L226 Difference]: Without dead ends: 291 [2020-09-04 23:13:18,334 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-09-04 23:13:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-09-04 23:13:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 270. [2020-09-04 23:13:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-09-04 23:13:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 349 transitions. [2020-09-04 23:13:18,371 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 349 transitions. Word has length 110 [2020-09-04 23:13:18,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:18,372 INFO L479 AbstractCegarLoop]: Abstraction has 270 states and 349 transitions. [2020-09-04 23:13:18,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:13:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 349 transitions. [2020-09-04 23:13:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-09-04 23:13:18,376 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:18,376 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:18,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 23:13:18,376 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:18,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:18,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1038471395, now seen corresponding path program 1 times [2020-09-04 23:13:18,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:18,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [425918503] [2020-09-04 23:13:18,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:18,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:18,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:18,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:18,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:18,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:18,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:18,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:18,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 23:13:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:18,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 23:13:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:18,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 23:13:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:18,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 23:13:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:18,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 23:13:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:18,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 23:13:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:18,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:13:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-09-04 23:13:18,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [425918503] [2020-09-04 23:13:18,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:18,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 23:13:18,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528404735] [2020-09-04 23:13:18,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:13:18,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:18,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:13:18,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:13:18,566 INFO L87 Difference]: Start difference. First operand 270 states and 349 transitions. Second operand 9 states. [2020-09-04 23:13:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:18,891 INFO L93 Difference]: Finished difference Result 372 states and 494 transitions. [2020-09-04 23:13:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 23:13:18,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2020-09-04 23:13:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:18,896 INFO L225 Difference]: With dead ends: 372 [2020-09-04 23:13:18,896 INFO L226 Difference]: Without dead ends: 368 [2020-09-04 23:13:18,897 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-09-04 23:13:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2020-09-04 23:13:18,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 345. [2020-09-04 23:13:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-09-04 23:13:18,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 458 transitions. [2020-09-04 23:13:18,940 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 458 transitions. Word has length 110 [2020-09-04 23:13:18,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:18,942 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 458 transitions. [2020-09-04 23:13:18,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:13:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 458 transitions. [2020-09-04 23:13:18,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-09-04 23:13:18,946 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:18,946 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:18,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 23:13:18,947 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:18,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:18,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1539222205, now seen corresponding path program 1 times [2020-09-04 23:13:18,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:18,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [508753659] [2020-09-04 23:13:18,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-04 23:13:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-04 23:13:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 23:13:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 23:13:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-04 23:13:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 23:13:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:13:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 23:13:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-09-04 23:13:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-09-04 23:13:19,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [508753659] [2020-09-04 23:13:19,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:19,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 23:13:19,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225656505] [2020-09-04 23:13:19,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:13:19,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:19,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:13:19,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:13:19,111 INFO L87 Difference]: Start difference. First operand 345 states and 458 transitions. Second operand 9 states. [2020-09-04 23:13:19,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:19,423 INFO L93 Difference]: Finished difference Result 379 states and 496 transitions. [2020-09-04 23:13:19,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 23:13:19,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2020-09-04 23:13:19,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:19,427 INFO L225 Difference]: With dead ends: 379 [2020-09-04 23:13:19,427 INFO L226 Difference]: Without dead ends: 377 [2020-09-04 23:13:19,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-09-04 23:13:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-09-04 23:13:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 359. [2020-09-04 23:13:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-09-04 23:13:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2020-09-04 23:13:19,480 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 120 [2020-09-04 23:13:19,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:19,481 INFO L479 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2020-09-04 23:13:19,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:13:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2020-09-04 23:13:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-09-04 23:13:19,483 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:19,484 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:19,484 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 23:13:19,484 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:19,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:19,484 INFO L82 PathProgramCache]: Analyzing trace with hash 871752502, now seen corresponding path program 1 times [2020-09-04 23:13:19,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:19,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1915063709] [2020-09-04 23:13:19,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 23:13:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 23:13:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 23:13:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 23:13:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 23:13:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 23:13:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:13:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 23:13:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-09-04 23:13:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-09-04 23:13:19,664 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1915063709] [2020-09-04 23:13:19,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:19,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 23:13:19,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766580251] [2020-09-04 23:13:19,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 23:13:19,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:19,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 23:13:19,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 23:13:19,666 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 11 states. [2020-09-04 23:13:20,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:20,078 INFO L93 Difference]: Finished difference Result 424 states and 562 transitions. [2020-09-04 23:13:20,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 23:13:20,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 120 [2020-09-04 23:13:20,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:20,083 INFO L225 Difference]: With dead ends: 424 [2020-09-04 23:13:20,083 INFO L226 Difference]: Without dead ends: 418 [2020-09-04 23:13:20,084 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-09-04 23:13:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-09-04 23:13:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 398. [2020-09-04 23:13:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-09-04 23:13:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 529 transitions. [2020-09-04 23:13:20,125 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 529 transitions. Word has length 120 [2020-09-04 23:13:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:20,126 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 529 transitions. [2020-09-04 23:13:20,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 23:13:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 529 transitions. [2020-09-04 23:13:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-09-04 23:13:20,128 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:20,129 INFO L422 BasicCegarLoop]: trace histogram [18, 17, 17, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:20,129 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 23:13:20,129 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:20,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:20,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1668448602, now seen corresponding path program 1 times [2020-09-04 23:13:20,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:20,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1140384902] [2020-09-04 23:13:20,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-04 23:13:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-04 23:13:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 23:13:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 23:13:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-04 23:13:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 23:13:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:13:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 23:13:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-09-04 23:13:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 23:13:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-09-04 23:13:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2020-09-04 23:13:20,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1140384902] [2020-09-04 23:13:20,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:20,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 23:13:20,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923371611] [2020-09-04 23:13:20,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 23:13:20,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:20,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 23:13:20,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 23:13:20,314 INFO L87 Difference]: Start difference. First operand 398 states and 529 transitions. Second operand 11 states. [2020-09-04 23:13:20,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:20,694 INFO L93 Difference]: Finished difference Result 432 states and 566 transitions. [2020-09-04 23:13:20,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 23:13:20,695 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 136 [2020-09-04 23:13:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:20,699 INFO L225 Difference]: With dead ends: 432 [2020-09-04 23:13:20,699 INFO L226 Difference]: Without dead ends: 430 [2020-09-04 23:13:20,700 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-09-04 23:13:20,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2020-09-04 23:13:20,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 410. [2020-09-04 23:13:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-09-04 23:13:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 542 transitions. [2020-09-04 23:13:20,744 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 542 transitions. Word has length 136 [2020-09-04 23:13:20,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:20,745 INFO L479 AbstractCegarLoop]: Abstraction has 410 states and 542 transitions. [2020-09-04 23:13:20,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 23:13:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 542 transitions. [2020-09-04 23:13:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-09-04 23:13:20,748 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:20,748 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 19, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:20,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 23:13:20,749 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:20,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:20,749 INFO L82 PathProgramCache]: Analyzing trace with hash 362381850, now seen corresponding path program 1 times [2020-09-04 23:13:20,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:20,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223597830] [2020-09-04 23:13:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-04 23:13:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-04 23:13:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 23:13:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 23:13:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-04 23:13:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 23:13:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:13:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 23:13:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-09-04 23:13:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 23:13:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-09-04 23:13:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-09-04 23:13:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-09-04 23:13:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2020-09-04 23:13:20,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223597830] [2020-09-04 23:13:20,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:20,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 23:13:20,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307801402] [2020-09-04 23:13:20,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 23:13:20,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:20,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 23:13:20,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 23:13:20,953 INFO L87 Difference]: Start difference. First operand 410 states and 542 transitions. Second operand 11 states. [2020-09-04 23:13:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:21,478 INFO L93 Difference]: Finished difference Result 645 states and 888 transitions. [2020-09-04 23:13:21,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 23:13:21,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2020-09-04 23:13:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:21,510 INFO L225 Difference]: With dead ends: 645 [2020-09-04 23:13:21,510 INFO L226 Difference]: Without dead ends: 639 [2020-09-04 23:13:21,512 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2020-09-04 23:13:21,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-09-04 23:13:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 572. [2020-09-04 23:13:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2020-09-04 23:13:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 778 transitions. [2020-09-04 23:13:21,663 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 778 transitions. Word has length 151 [2020-09-04 23:13:21,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:21,664 INFO L479 AbstractCegarLoop]: Abstraction has 572 states and 778 transitions. [2020-09-04 23:13:21,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 23:13:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 778 transitions. [2020-09-04 23:13:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-09-04 23:13:21,667 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:21,668 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 19, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:21,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 23:13:21,668 INFO L427 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:21,669 INFO L82 PathProgramCache]: Analyzing trace with hash -978309232, now seen corresponding path program 2 times [2020-09-04 23:13:21,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:21,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [836980857] [2020-09-04 23:13:21,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 23:13:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 23:13:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 23:13:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 23:13:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 23:13:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 23:13:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:13:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 23:13:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-09-04 23:13:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-09-04 23:13:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-09-04 23:13:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-09-04 23:13:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-09-04 23:13:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2020-09-04 23:13:21,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [836980857] [2020-09-04 23:13:21,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:21,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 23:13:21,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333573752] [2020-09-04 23:13:21,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 23:13:21,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:21,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 23:13:21,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 23:13:21,920 INFO L87 Difference]: Start difference. First operand 572 states and 778 transitions. Second operand 11 states. [2020-09-04 23:13:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:22,463 INFO L93 Difference]: Finished difference Result 647 states and 885 transitions. [2020-09-04 23:13:22,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 23:13:22,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2020-09-04 23:13:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:22,469 INFO L225 Difference]: With dead ends: 647 [2020-09-04 23:13:22,469 INFO L226 Difference]: Without dead ends: 641 [2020-09-04 23:13:22,470 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2020-09-04 23:13:22,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-09-04 23:13:22,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 412. [2020-09-04 23:13:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-09-04 23:13:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 539 transitions. [2020-09-04 23:13:22,522 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 539 transitions. Word has length 151 [2020-09-04 23:13:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:22,522 INFO L479 AbstractCegarLoop]: Abstraction has 412 states and 539 transitions. [2020-09-04 23:13:22,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 23:13:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 539 transitions. [2020-09-04 23:13:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-09-04 23:13:22,525 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:22,526 INFO L422 BasicCegarLoop]: trace histogram [22, 21, 21, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:22,526 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 23:13:22,526 INFO L427 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:22,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1688386477, now seen corresponding path program 1 times [2020-09-04 23:13:22,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:22,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2110404004] [2020-09-04 23:13:22,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-04 23:13:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-04 23:13:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 23:13:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 23:13:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-04 23:13:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 23:13:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:13:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 23:13:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-09-04 23:13:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 23:13:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-09-04 23:13:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-09-04 23:13:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-09-04 23:13:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-09-04 23:13:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-09-04 23:13:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2020-09-04 23:13:22,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2110404004] [2020-09-04 23:13:22,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:22,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 23:13:22,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852757646] [2020-09-04 23:13:22,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 23:13:22,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:22,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 23:13:22,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-09-04 23:13:22,873 INFO L87 Difference]: Start difference. First operand 412 states and 539 transitions. Second operand 13 states. [2020-09-04 23:13:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:23,611 INFO L93 Difference]: Finished difference Result 505 states and 669 transitions. [2020-09-04 23:13:23,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 23:13:23,613 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 161 [2020-09-04 23:13:23,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:23,619 INFO L225 Difference]: With dead ends: 505 [2020-09-04 23:13:23,620 INFO L226 Difference]: Without dead ends: 495 [2020-09-04 23:13:23,622 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2020-09-04 23:13:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-09-04 23:13:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 459. [2020-09-04 23:13:23,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2020-09-04 23:13:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 603 transitions. [2020-09-04 23:13:23,700 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 603 transitions. Word has length 161 [2020-09-04 23:13:23,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:23,702 INFO L479 AbstractCegarLoop]: Abstraction has 459 states and 603 transitions. [2020-09-04 23:13:23,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 23:13:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 603 transitions. [2020-09-04 23:13:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-09-04 23:13:23,708 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:23,708 INFO L422 BasicCegarLoop]: trace histogram [22, 21, 21, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:23,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 23:13:23,709 INFO L427 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:23,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:23,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1620079197, now seen corresponding path program 2 times [2020-09-04 23:13:23,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:23,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [119324205] [2020-09-04 23:13:23,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:13:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:13:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:13:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 23:13:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 23:13:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 23:13:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 23:13:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 23:13:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 23:13:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:13:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 23:13:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-09-04 23:13:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-09-04 23:13:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-09-04 23:13:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-09-04 23:13:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-09-04 23:13:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-09-04 23:13:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:23,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-09-04 23:13:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2020-09-04 23:13:24,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [119324205] [2020-09-04 23:13:24,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:24,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 23:13:24,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166407160] [2020-09-04 23:13:24,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 23:13:24,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:24,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 23:13:24,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-09-04 23:13:24,014 INFO L87 Difference]: Start difference. First operand 459 states and 603 transitions. Second operand 13 states. [2020-09-04 23:13:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:24,551 INFO L93 Difference]: Finished difference Result 499 states and 659 transitions. [2020-09-04 23:13:24,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 23:13:24,552 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 161 [2020-09-04 23:13:24,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:24,554 INFO L225 Difference]: With dead ends: 499 [2020-09-04 23:13:24,554 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 23:13:24,557 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2020-09-04 23:13:24,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 23:13:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 23:13:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 23:13:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 23:13:24,558 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2020-09-04 23:13:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:24,558 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 23:13:24,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 23:13:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 23:13:24,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 23:13:24,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 23:13:24,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 23:13:24,880 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2020-09-04 23:13:25,482 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2020-09-04 23:13:25,849 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2020-09-04 23:13:26,162 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 49 [2020-09-04 23:13:26,588 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2020-09-04 23:13:27,051 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2020-09-04 23:13:27,571 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2020-09-04 23:13:28,148 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 106 [2020-09-04 23:13:28,793 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 21 [2020-09-04 23:13:29,133 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 26 [2020-09-04 23:13:29,428 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 22 [2020-09-04 23:13:29,584 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 22 [2020-09-04 23:13:29,758 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 23 [2020-09-04 23:13:30,211 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 21 [2020-09-04 23:13:30,369 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 18 [2020-09-04 23:13:30,527 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 13 [2020-09-04 23:13:30,685 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 22 [2020-09-04 23:13:30,821 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2020-09-04 23:13:31,042 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 16 [2020-09-04 23:13:31,627 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 26 [2020-09-04 23:13:31,766 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 18 [2020-09-04 23:13:32,229 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 11 [2020-09-04 23:13:32,485 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 16 [2020-09-04 23:13:32,844 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 25 [2020-09-04 23:13:33,498 WARN L193 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 29 [2020-09-04 23:13:33,669 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 19 [2020-09-04 23:13:33,674 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 23:13:33,674 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 23:13:33,675 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 23:13:33,675 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 23:13:33,675 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 23:13:33,675 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 23:13:33,675 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:13:33,675 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:13:33,676 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-09-04 23:13:33,676 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-09-04 23:13:33,676 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:13:33,676 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,676 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,676 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 56) the Hoare annotation is: true [2020-09-04 23:13:33,677 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (<= (+ main_~limit~0 4) main_~bufsize~0) [2020-09-04 23:13:33,677 INFO L264 CegarLoopResult]: At program point L23-3(lines 23 54) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= main_~len~0 main_~i~0) .cse0) (and (<= 0 main_~i~0) .cse0))) [2020-09-04 23:13:33,677 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-09-04 23:13:33,677 INFO L271 CegarLoopResult]: At program point L23-4(lines 23 54) the Hoare annotation is: true [2020-09-04 23:13:33,677 INFO L271 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: true [2020-09-04 23:13:33,677 INFO L271 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: true [2020-09-04 23:13:33,678 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse1 (<= 0 main_~j~0)) (.cse2 (< main_~i~0 main_~len~0)) (.cse3 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 .cse2 (<= 0 main_~i~0) .cse3) (and .cse0 .cse1 (<= main_~len~0 (+ main_~i~0 1)) .cse2 .cse3))) [2020-09-04 23:13:33,678 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-09-04 23:13:33,678 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 1 |main_#t~post6|) (<= 2 main_~j~0)) [2020-09-04 23:13:33,678 INFO L264 CegarLoopResult]: At program point L40-2(line 40) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 1 |main_#t~post6|) (<= 2 main_~j~0)) [2020-09-04 23:13:33,678 INFO L264 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,679 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,679 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,679 INFO L264 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,679 INFO L264 CegarLoopResult]: At program point L28-3(line 28) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,679 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,679 INFO L264 CegarLoopResult]: At program point L24-3(lines 24 53) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= 0 main_~j~0) (<= 0 main_~i~0) .cse0) (and (<= main_~len~0 main_~i~0) .cse0))) [2020-09-04 23:13:33,680 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-09-04 23:13:33,680 INFO L271 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-09-04 23:13:33,680 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse1 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 (<= 0 main_~j~0) (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) .cse1) (and .cse0 (<= main_~len~0 (+ main_~i~0 1)) (< main_~i~0 main_~len~0) .cse1))) [2020-09-04 23:13:33,680 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 23:13:33,680 INFO L264 CegarLoopResult]: At program point L45(lines 25 52) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,680 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-09-04 23:13:33,681 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-09-04 23:13:33,681 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,681 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (and (<= (+ |main_#t~post3| 5) main_~bufsize~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 |main_#t~post3|) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,681 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (and (<= (+ |main_#t~post3| 5) main_~bufsize~0) (<= 1 main_~j~0) (<= 0 |main_#t~post3|) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,681 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,681 INFO L264 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,682 INFO L264 CegarLoopResult]: At program point L25(lines 25 52) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,682 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-09-04 23:13:33,682 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-09-04 23:13:33,682 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-09-04 23:13:33,682 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse1 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 (<= 0 main_~j~0) (<= 0 |main_#t~post8|) (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) .cse1) (and .cse0 (<= main_~len~0 (+ main_~i~0 1)) (< main_~i~0 main_~len~0) .cse1))) [2020-09-04 23:13:33,682 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-09-04 23:13:33,683 INFO L264 CegarLoopResult]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= main_~len~0 (+ main_~i~0 1)) (< main_~i~0 main_~len~0) .cse0) (and (<= 1 main_~j~0) (<= 0 |main_#t~post8|) (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) .cse0))) [2020-09-04 23:13:33,683 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,683 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 56) the Hoare annotation is: true [2020-09-04 23:13:33,683 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-09-04 23:13:33,683 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,683 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (<= 1 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,683 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (and (<= 1 main_~j~0) (<= 0 |main_#t~post4|) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ |main_#t~post4| 2) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,684 INFO L264 CegarLoopResult]: At program point L34-2(line 34) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= 0 |main_#t~post4|) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ |main_#t~post4| 2) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,684 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,684 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 56) the Hoare annotation is: true [2020-09-04 23:13:33,684 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,684 INFO L264 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,684 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-09-04 23:13:33,685 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= main_~len~0 (+ main_~i~0 1)) (< main_~i~0 main_~len~0) .cse0) (and (<= 1 main_~j~0) (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) .cse0))) [2020-09-04 23:13:33,685 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-09-04 23:13:33,685 INFO L264 CegarLoopResult]: At program point L51-1(line 51) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= main_~len~0 (+ |main_#t~post9| 1)) (<= main_~len~0 (+ main_~i~0 1)) (< main_~i~0 main_~len~0) .cse0) (and (<= 1 main_~j~0) (<= 0 |main_#t~post9|) (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) .cse0))) [2020-09-04 23:13:33,685 INFO L264 CegarLoopResult]: At program point L51-2(line 51) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= 1 main_~j~0) (<= 0 |main_#t~post9|) (<= 1 main_~i~0) .cse0) (and (<= main_~len~0 (+ |main_#t~post9| 1)) (<= main_~len~0 main_~i~0) .cse0))) [2020-09-04 23:13:33,685 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse1 (<= 0 main_~j~0)) (.cse2 (< main_~i~0 main_~len~0)) (.cse3 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 .cse2 (<= 0 main_~i~0) .cse3) (and .cse0 .cse1 (<= main_~len~0 (+ main_~i~0 1)) .cse2 .cse3))) [2020-09-04 23:13:33,685 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0) (<= 2 |main_#t~post7|)) [2020-09-04 23:13:33,685 INFO L264 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (and (<= 3 main_~j~0) (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 |main_#t~post7|)) [2020-09-04 23:13:33,686 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 1 |main_#t~post5|) (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ |main_#t~post5| 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,686 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= 1 |main_#t~post5|) (<= (+ main_~j~0 3) main_~bufsize~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ |main_#t~post5| 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-09-04 23:13:33,686 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,686 INFO L264 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-09-04 23:13:33,686 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-09-04 23:13:33,686 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 23:13:33,687 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 23:13:33,687 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 23:13:33,687 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 23:13:33,687 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 23:13:33,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 11:13:33 BoogieIcfgContainer [2020-09-04 23:13:33,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 23:13:33,721 INFO L168 Benchmark]: Toolchain (without parser) took 22731.01 ms. Allocated memory was 139.5 MB in the beginning and 482.3 MB in the end (delta: 342.9 MB). Free memory was 103.9 MB in the beginning and 291.2 MB in the end (delta: -187.3 MB). Peak memory consumption was 329.0 MB. Max. memory is 7.1 GB. [2020-09-04 23:13:33,721 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 139.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 23:13:33,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.82 ms. Allocated memory is still 139.5 MB. Free memory was 103.7 MB in the beginning and 93.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-09-04 23:13:33,726 INFO L168 Benchmark]: Boogie Preprocessor took 127.12 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 93.7 MB in the beginning and 180.4 MB in the end (delta: -86.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-09-04 23:13:33,729 INFO L168 Benchmark]: RCFGBuilder took 483.69 ms. Allocated memory is still 202.4 MB. Free memory was 180.4 MB in the beginning and 162.1 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2020-09-04 23:13:33,730 INFO L168 Benchmark]: TraceAbstraction took 21776.76 ms. Allocated memory was 202.4 MB in the beginning and 482.3 MB in the end (delta: 280.0 MB). Free memory was 161.4 MB in the beginning and 291.2 MB in the end (delta: -129.8 MB). Peak memory consumption was 323.6 MB. Max. memory is 7.1 GB. [2020-09-04 23:13:33,732 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.32 ms. Allocated memory is still 139.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 334.82 ms. Allocated memory is still 139.5 MB. Free memory was 103.7 MB in the beginning and 93.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.12 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 93.7 MB in the beginning and 180.4 MB in the end (delta: -86.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 483.69 ms. Allocated memory is still 202.4 MB. Free memory was 180.4 MB in the beginning and 162.1 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21776.76 ms. Allocated memory was 202.4 MB in the beginning and 482.3 MB in the end (delta: 280.0 MB). Free memory was 161.4 MB in the beginning and 291.2 MB in the end (delta: -129.8 MB). Peak memory consumption was 323.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((j + 5 <= bufsize && 0 <= j) && i < len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (len <= i && limit + 4 <= bufsize) || (0 <= i && limit + 4 <= bufsize) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((0 <= j && 0 <= i) && limit + 4 <= bufsize) || (len <= i && limit + 4 <= bufsize) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.5s, OverallIterations: 23, TraceHistogramMax: 22, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2525 SDtfs, 852 SDslu, 11733 SDs, 0 SdLazy, 3758 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 810 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=572occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 542 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 74 LocationsWithAnnotation, 1484 PreInvPairs, 2305 NumberOfFragments, 1188 HoareAnnotationTreeSize, 1484 FomulaSimplifications, 3109982 FormulaSimplificationTreeSizeReduction, 3.7s HoareSimplificationTime, 74 FomulaSimplificationsInter, 884914 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2056 NumberOfCodeBlocks, 2056 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2033 ConstructedInterpolants, 0 QuantifiedInterpolants, 394477 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 6694/6694 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...