/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/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 23:14:46,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 23:14:46,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 23:14:46,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 23:14:46,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 23:14:46,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 23:14:46,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 23:14:46,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 23:14:46,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 23:14:46,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 23:14:46,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 23:14:46,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 23:14:46,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 23:14:46,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 23:14:46,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 23:14:46,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 23:14:46,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 23:14:46,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 23:14:46,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 23:14:46,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 23:14:46,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 23:14:46,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 23:14:46,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 23:14:46,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 23:14:46,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 23:14:46,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 23:14:46,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 23:14:46,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 23:14:46,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 23:14:46,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 23:14:46,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 23:14:46,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 23:14:46,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 23:14:46,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 23:14:46,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 23:14:46,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 23:14:46,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 23:14:46,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 23:14:46,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 23:14:46,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 23:14:46,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 23:14:46,786 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:14:46,797 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 23:14:46,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 23:14:46,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 23:14:46,799 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 23:14:46,799 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 23:14:46,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 23:14:46,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 23:14:46,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 23:14:46,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 23:14:46,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 23:14:46,800 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 23:14:46,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 23:14:46,801 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 23:14:46,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 23:14:46,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 23:14:46,801 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 23:14:46,801 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 23:14:46,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 23:14:46,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:14:46,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 23:14:46,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 23:14:46,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 23:14:46,803 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:14:47,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 23:14:47,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 23:14:47,288 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 23:14:47,290 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 23:14:47,290 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 23:14:47,291 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-09-04 23:14:47,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/505d55018/c8e8e82f548e4a51b963358e991abf74/FLAGa58b70f5e [2020-09-04 23:14:47,892 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 23:14:47,893 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-09-04 23:14:47,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/505d55018/c8e8e82f548e4a51b963358e991abf74/FLAGa58b70f5e [2020-09-04 23:14:48,232 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/505d55018/c8e8e82f548e4a51b963358e991abf74 [2020-09-04 23:14:48,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 23:14:48,249 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 23:14:48,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 23:14:48,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 23:14:48,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 23:14:48,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:14:48" (1/1) ... [2020-09-04 23:14:48,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7673bb3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:48, skipping insertion in model container [2020-09-04 23:14:48,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:14:48" (1/1) ... [2020-09-04 23:14:48,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 23:14:48,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 23:14:48,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:14:48,577 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 23:14:48,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:14:48,619 INFO L208 MainTranslator]: Completed translation [2020-09-04 23:14:48,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:48 WrapperNode [2020-09-04 23:14:48,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 23:14:48,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 23:14:48,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 23:14:48,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 23:14:48,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:48" (1/1) ... [2020-09-04 23:14:48,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:48" (1/1) ... [2020-09-04 23:14:48,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:48" (1/1) ... [2020-09-04 23:14:48,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:48" (1/1) ... [2020-09-04 23:14:48,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:48" (1/1) ... [2020-09-04 23:14:48,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:48" (1/1) ... [2020-09-04 23:14:48,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:48" (1/1) ... [2020-09-04 23:14:48,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 23:14:48,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 23:14:48,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 23:14:48,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 23:14:48,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:48" (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:14:48,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 23:14:48,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 23:14:48,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 23:14:48,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 23:14:48,822 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 23:14:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 23:14:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 23:14:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 23:14:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 23:14:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 23:14:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 23:14:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 23:14:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 23:14:49,126 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 23:14:49,127 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 23:14:49,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:14:49 BoogieIcfgContainer [2020-09-04 23:14:49,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 23:14:49,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 23:14:49,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 23:14:49,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 23:14:49,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 11:14:48" (1/3) ... [2020-09-04 23:14:49,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3c66b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:14:49, skipping insertion in model container [2020-09-04 23:14:49,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:48" (2/3) ... [2020-09-04 23:14:49,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3c66b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:14:49, skipping insertion in model container [2020-09-04 23:14:49,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:14:49" (3/3) ... [2020-09-04 23:14:49,145 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2020-09-04 23:14:49,160 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 23:14:49,175 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 23:14:49,227 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 23:14:49,278 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 23:14:49,278 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 23:14:49,279 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 23:14:49,279 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 23:14:49,279 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 23:14:49,279 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 23:14:49,279 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 23:14:49,280 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 23:14:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-09-04 23:14:49,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 23:14:49,311 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:49,313 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] [2020-09-04 23:14:49,313 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:49,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:49,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1122321079, now seen corresponding path program 1 times [2020-09-04 23:14:49,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:49,330 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [659740665] [2020-09-04 23:14:49,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:49,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:49,489 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:14:49,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [659740665] [2020-09-04 23:14:49,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:49,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-04 23:14:49,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393756712] [2020-09-04 23:14:49,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-09-04 23:14:49,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:49,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-09-04 23:14:49,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-04 23:14:49,522 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2020-09-04 23:14:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:49,566 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2020-09-04 23:14:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-09-04 23:14:49,568 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2020-09-04 23:14:49,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:49,581 INFO L225 Difference]: With dead ends: 91 [2020-09-04 23:14:49,582 INFO L226 Difference]: Without dead ends: 47 [2020-09-04 23:14:49,588 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-04 23:14:49,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-09-04 23:14:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-09-04 23:14:49,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 23:14:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-09-04 23:14:49,652 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2020-09-04 23:14:49,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:49,653 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-09-04 23:14:49,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-09-04 23:14:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-09-04 23:14:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 23:14:49,654 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:49,655 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, 1] [2020-09-04 23:14:49,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 23:14:49,655 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:49,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:49,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1949391841, now seen corresponding path program 1 times [2020-09-04 23:14:49,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:49,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [256790534] [2020-09-04 23:14:49,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:49,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:49,902 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:14:49,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [256790534] [2020-09-04 23:14:49,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:49,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 23:14:49,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778633230] [2020-09-04 23:14:49,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 23:14:49,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:49,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 23:14:49,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 23:14:49,907 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 5 states. [2020-09-04 23:14:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:50,061 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2020-09-04 23:14:50,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 23:14:50,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-09-04 23:14:50,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:50,065 INFO L225 Difference]: With dead ends: 66 [2020-09-04 23:14:50,065 INFO L226 Difference]: Without dead ends: 64 [2020-09-04 23:14:50,067 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:14:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-09-04 23:14:50,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2020-09-04 23:14:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 23:14:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2020-09-04 23:14:50,087 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 26 [2020-09-04 23:14:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:50,088 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2020-09-04 23:14:50,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 23:14:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-09-04 23:14:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 23:14:50,089 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:50,090 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, 1] [2020-09-04 23:14:50,090 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 23:14:50,090 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:50,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:50,091 INFO L82 PathProgramCache]: Analyzing trace with hash -873076999, now seen corresponding path program 1 times [2020-09-04 23:14:50,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:50,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1450273869] [2020-09-04 23:14:50,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:50,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:50,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:14:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:50,223 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:14:50,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1450273869] [2020-09-04 23:14:50,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:50,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 23:14:50,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310353012] [2020-09-04 23:14:50,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 23:14:50,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:50,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 23:14:50,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:14:50,226 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 6 states. [2020-09-04 23:14:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:50,389 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2020-09-04 23:14:50,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 23:14:50,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-09-04 23:14:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:50,392 INFO L225 Difference]: With dead ends: 70 [2020-09-04 23:14:50,392 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 23:14:50,393 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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:14:50,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 23:14:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2020-09-04 23:14:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-09-04 23:14:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2020-09-04 23:14:50,416 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 31 [2020-09-04 23:14:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:50,416 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2020-09-04 23:14:50,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 23:14:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2020-09-04 23:14:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-09-04 23:14:50,418 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:50,419 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, 1, 1, 1, 1] [2020-09-04 23:14:50,419 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 23:14:50,419 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:50,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:50,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2057902492, now seen corresponding path program 1 times [2020-09-04 23:14:50,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:50,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1464232645] [2020-09-04 23:14:50,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:50,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:50,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:14:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:50,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:14:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:50,537 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:14:50,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1464232645] [2020-09-04 23:14:50,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:50,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:14:50,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001617807] [2020-09-04 23:14:50,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:14:50,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:50,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:14:50,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:14:50,540 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 7 states. [2020-09-04 23:14:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:50,687 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2020-09-04 23:14:50,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 23:14:50,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-09-04 23:14:50,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:50,690 INFO L225 Difference]: With dead ends: 77 [2020-09-04 23:14:50,690 INFO L226 Difference]: Without dead ends: 75 [2020-09-04 23:14:50,691 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 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:14:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-04 23:14:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2020-09-04 23:14:50,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-09-04 23:14:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2020-09-04 23:14:50,706 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 39 [2020-09-04 23:14:50,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:50,706 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2020-09-04 23:14:50,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:14:50,707 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2020-09-04 23:14:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 23:14:50,708 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:50,708 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, 1, 1, 1, 1] [2020-09-04 23:14:50,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 23:14:50,709 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:50,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:50,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1847294180, now seen corresponding path program 1 times [2020-09-04 23:14:50,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:50,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [427282077] [2020-09-04 23:14:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:50,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:50,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:14:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:50,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:14:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:50,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-09-04 23:14:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:50,872 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:14:50,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [427282077] [2020-09-04 23:14:50,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:50,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 23:14:50,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154825755] [2020-09-04 23:14:50,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 23:14:50,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:50,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 23:14:50,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:14:50,876 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 8 states. [2020-09-04 23:14:51,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:51,129 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2020-09-04 23:14:51,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 23:14:51,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-09-04 23:14:51,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:51,132 INFO L225 Difference]: With dead ends: 81 [2020-09-04 23:14:51,132 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 23:14:51,133 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 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:14:51,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 23:14:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-09-04 23:14:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-09-04 23:14:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2020-09-04 23:14:51,144 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 44 [2020-09-04 23:14:51,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:51,145 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2020-09-04 23:14:51,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 23:14:51,145 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2020-09-04 23:14:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-04 23:14:51,147 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:51,147 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:51,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 23:14:51,147 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:51,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:51,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1076854334, now seen corresponding path program 1 times [2020-09-04 23:14:51,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:51,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2048759873] [2020-09-04 23:14:51,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:51,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:51,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 23:14:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:51,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:14:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:51,251 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:14:51,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2048759873] [2020-09-04 23:14:51,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:51,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:14:51,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198209714] [2020-09-04 23:14:51,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:14:51,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:51,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:14:51,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:14:51,261 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 7 states. [2020-09-04 23:14:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:51,367 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-09-04 23:14:51,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 23:14:51,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-09-04 23:14:51,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:51,370 INFO L225 Difference]: With dead ends: 72 [2020-09-04 23:14:51,371 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 23:14:51,374 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 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:14:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 23:14:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2020-09-04 23:14:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-09-04 23:14:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2020-09-04 23:14:51,397 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 43 [2020-09-04 23:14:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:51,397 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2020-09-04 23:14:51,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:14:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2020-09-04 23:14:51,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 23:14:51,400 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:51,400 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:51,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 23:14:51,401 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:51,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash 146364602, now seen corresponding path program 1 times [2020-09-04 23:14:51,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:51,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2058980902] [2020-09-04 23:14:51,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:51,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:51,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 23:14:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:51,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:14:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:51,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:14:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:51,572 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:14:51,572 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2058980902] [2020-09-04 23:14:51,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:51,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 23:14:51,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065384166] [2020-09-04 23:14:51,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:14:51,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:51,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:14:51,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:14:51,575 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 9 states. [2020-09-04 23:14:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:51,852 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2020-09-04 23:14:51,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 23:14:51,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-09-04 23:14:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:51,855 INFO L225 Difference]: With dead ends: 98 [2020-09-04 23:14:51,855 INFO L226 Difference]: Without dead ends: 96 [2020-09-04 23:14:51,856 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-09-04 23:14:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-09-04 23:14:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2020-09-04 23:14:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-09-04 23:14:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2020-09-04 23:14:51,871 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 48 [2020-09-04 23:14:51,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:51,871 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2020-09-04 23:14:51,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:14:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-09-04 23:14:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 23:14:51,873 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:51,873 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2020-09-04 23:14:51,873 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 23:14:51,873 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:51,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:51,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1943579560, now seen corresponding path program 1 times [2020-09-04 23:14:51,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:51,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1108406039] [2020-09-04 23:14:51,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:51,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:51,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 23:14:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:51,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:14:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:51,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:14:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:51,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:14:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-09-04 23:14:51,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1108406039] [2020-09-04 23:14:51,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:51,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:14:51,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441514390] [2020-09-04 23:14:51,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:14:51,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:51,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:14:51,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:14:51,978 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 7 states. [2020-09-04 23:14:52,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:52,086 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2020-09-04 23:14:52,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 23:14:52,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-09-04 23:14:52,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:52,091 INFO L225 Difference]: With dead ends: 83 [2020-09-04 23:14:52,091 INFO L226 Difference]: Without dead ends: 81 [2020-09-04 23:14:52,092 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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:14:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-09-04 23:14:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-09-04 23:14:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-09-04 23:14:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2020-09-04 23:14:52,106 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 56 [2020-09-04 23:14:52,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:52,106 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2020-09-04 23:14:52,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:14:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-09-04 23:14:52,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 23:14:52,108 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:52,108 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, 1, 1, 1] [2020-09-04 23:14:52,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 23:14:52,108 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:52,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:52,109 INFO L82 PathProgramCache]: Analyzing trace with hash 903884048, now seen corresponding path program 1 times [2020-09-04 23:14:52,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:52,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1597027622] [2020-09-04 23:14:52,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:52,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:52,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 23:14:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:52,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:14:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:52,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:14:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:52,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:14:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:52,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-09-04 23:14:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 23:14:52,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1597027622] [2020-09-04 23:14:52,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:52,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 23:14:52,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519307510] [2020-09-04 23:14:52,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 23:14:52,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:52,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 23:14:52,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:14:52,229 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 8 states. [2020-09-04 23:14:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:52,438 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2020-09-04 23:14:52,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 23:14:52,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-09-04 23:14:52,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:52,441 INFO L225 Difference]: With dead ends: 100 [2020-09-04 23:14:52,441 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 23:14:52,442 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 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:14:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 23:14:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2020-09-04 23:14:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-04 23:14:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2020-09-04 23:14:52,458 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 61 [2020-09-04 23:14:52,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:52,458 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2020-09-04 23:14:52,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 23:14:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2020-09-04 23:14:52,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-04 23:14:52,460 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:52,460 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 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] [2020-09-04 23:14:52,461 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 23:14:52,461 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:52,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:52,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1662212275, now seen corresponding path program 1 times [2020-09-04 23:14:52,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:52,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1047149515] [2020-09-04 23:14:52,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:52,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:52,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 23:14:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:52,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:14:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:52,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:14:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:52,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:14:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:52,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-09-04 23:14:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:52,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 23:14:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-09-04 23:14:52,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1047149515] [2020-09-04 23:14:52,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:52,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 23:14:52,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840451763] [2020-09-04 23:14:52,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:14:52,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:52,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:14:52,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:14:52,610 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 9 states. [2020-09-04 23:14:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:52,796 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2020-09-04 23:14:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 23:14:52,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-09-04 23:14:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:52,801 INFO L225 Difference]: With dead ends: 100 [2020-09-04 23:14:52,801 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 23:14:52,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-09-04 23:14:52,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 23:14:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-09-04 23:14:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-09-04 23:14:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2020-09-04 23:14:52,838 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 69 [2020-09-04 23:14:52,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:52,839 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2020-09-04 23:14:52,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:14:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-09-04 23:14:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-09-04 23:14:52,844 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:52,844 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 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] [2020-09-04 23:14:52,845 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 23:14:52,845 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:52,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:52,846 INFO L82 PathProgramCache]: Analyzing trace with hash 71900773, now seen corresponding path program 1 times [2020-09-04 23:14:52,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:52,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1312357311] [2020-09-04 23:14:52,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 23:14:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:14:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:14:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:14:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-09-04 23:14:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 23:14:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 23:14:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-09-04 23:14:53,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1312357311] [2020-09-04 23:14:53,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:53,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 23:14:53,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719857258] [2020-09-04 23:14:53,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 23:14:53,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:53,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 23:14:53,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-09-04 23:14:53,196 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 11 states. [2020-09-04 23:14:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:53,670 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2020-09-04 23:14:53,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 23:14:53,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-09-04 23:14:53,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:53,673 INFO L225 Difference]: With dead ends: 119 [2020-09-04 23:14:53,673 INFO L226 Difference]: Without dead ends: 101 [2020-09-04 23:14:53,674 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2020-09-04 23:14:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-09-04 23:14:53,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2020-09-04 23:14:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 23:14:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2020-09-04 23:14:53,687 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 74 [2020-09-04 23:14:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:53,688 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2020-09-04 23:14:53,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 23:14:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2020-09-04 23:14:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-09-04 23:14:53,689 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:53,689 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 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] [2020-09-04 23:14:53,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 23:14:53,690 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash -50388093, now seen corresponding path program 1 times [2020-09-04 23:14:53,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:53,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [380663750] [2020-09-04 23:14:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 23:14:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:14:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:14:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:14:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 23:14:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 23:14:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 23:14:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-09-04 23:14:53,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [380663750] [2020-09-04 23:14:53,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:53,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 23:14:53,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491099269] [2020-09-04 23:14:53,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 23:14:53,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:53,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 23:14:53,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-09-04 23:14:53,832 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 11 states. [2020-09-04 23:14:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:54,177 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2020-09-04 23:14:54,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 23:14:54,178 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-09-04 23:14:54,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:54,180 INFO L225 Difference]: With dead ends: 128 [2020-09-04 23:14:54,180 INFO L226 Difference]: Without dead ends: 126 [2020-09-04 23:14:54,181 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2020-09-04 23:14:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-09-04 23:14:54,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2020-09-04 23:14:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-09-04 23:14:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2020-09-04 23:14:54,201 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 78 [2020-09-04 23:14:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:54,203 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2020-09-04 23:14:54,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 23:14:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2020-09-04 23:14:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-09-04 23:14:54,204 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:54,204 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 3, 2, 2, 2, 2, 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] [2020-09-04 23:14:54,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 23:14:54,205 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:54,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:54,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1911943399, now seen corresponding path program 2 times [2020-09-04 23:14:54,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:54,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [599627628] [2020-09-04 23:14:54,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:54,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:54,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 23:14:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:54,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:14:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:54,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:14:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:54,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:14:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:54,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 23:14:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:54,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 23:14:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:54,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 23:14:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:54,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 23:14:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:54,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-04 23:14:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-09-04 23:14:54,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [599627628] [2020-09-04 23:14:54,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:54,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 23:14:54,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475715631] [2020-09-04 23:14:54,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 23:14:54,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:54,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 23:14:54,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-09-04 23:14:54,444 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 11 states. [2020-09-04 23:14:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:54,924 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2020-09-04 23:14:54,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 23:14:54,925 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-09-04 23:14:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:54,929 INFO L225 Difference]: With dead ends: 134 [2020-09-04 23:14:54,929 INFO L226 Difference]: Without dead ends: 132 [2020-09-04 23:14:54,932 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2020-09-04 23:14:54,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-09-04 23:14:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2020-09-04 23:14:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-09-04 23:14:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2020-09-04 23:14:54,949 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 91 [2020-09-04 23:14:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:54,949 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2020-09-04 23:14:54,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 23:14:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2020-09-04 23:14:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-04 23:14:54,951 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:54,951 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 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] [2020-09-04 23:14:54,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 23:14:54,952 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:54,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:54,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1949077486, now seen corresponding path program 2 times [2020-09-04 23:14:54,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:54,957 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1040356713] [2020-09-04 23:14:54,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 23:14:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:14:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:14:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:14:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 23:14:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 23:14:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 23:14:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 23:14:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-04 23:14:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 23:14:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-04 23:14:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2020-09-04 23:14:55,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1040356713] [2020-09-04 23:14:55,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:55,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 23:14:55,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524047314] [2020-09-04 23:14:55,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 23:14:55,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:55,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 23:14:55,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-09-04 23:14:55,287 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 13 states. [2020-09-04 23:14:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:55,654 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2020-09-04 23:14:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 23:14:55,655 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2020-09-04 23:14:55,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:55,657 INFO L225 Difference]: With dead ends: 126 [2020-09-04 23:14:55,657 INFO L226 Difference]: Without dead ends: 109 [2020-09-04 23:14:55,658 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2020-09-04 23:14:55,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-09-04 23:14:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2020-09-04 23:14:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-09-04 23:14:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2020-09-04 23:14:55,672 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 104 [2020-09-04 23:14:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:55,672 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2020-09-04 23:14:55,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 23:14:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2020-09-04 23:14:55,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 23:14:55,674 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:55,674 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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:14:55,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 23:14:55,675 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:55,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:55,675 INFO L82 PathProgramCache]: Analyzing trace with hash 55355532, now seen corresponding path program 2 times [2020-09-04 23:14:55,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:55,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1403438874] [2020-09-04 23:14:55,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 23:14:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:14:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:14:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:14:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 23:14:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 23:14:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 23:14:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 23:14:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:14:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 23:14:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 23:14:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-09-04 23:14:55,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1403438874] [2020-09-04 23:14:55,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:55,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 23:14:55,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518396779] [2020-09-04 23:14:55,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 23:14:55,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:55,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 23:14:55,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-09-04 23:14:55,962 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 16 states. [2020-09-04 23:14:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:56,540 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2020-09-04 23:14:56,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 23:14:56,540 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2020-09-04 23:14:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:56,542 INFO L225 Difference]: With dead ends: 130 [2020-09-04 23:14:56,542 INFO L226 Difference]: Without dead ends: 128 [2020-09-04 23:14:56,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2020-09-04 23:14:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-09-04 23:14:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2020-09-04 23:14:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-09-04 23:14:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2020-09-04 23:14:56,557 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 108 [2020-09-04 23:14:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:56,558 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2020-09-04 23:14:56,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 23:14:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2020-09-04 23:14:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-09-04 23:14:56,560 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:56,560 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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:14:56,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 23:14:56,561 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:56,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:56,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1897035733, now seen corresponding path program 3 times [2020-09-04 23:14:56,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:56,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1232151992] [2020-09-04 23:14:56,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 23:14:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:14:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:14:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:14:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 23:14:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 23:14:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 23:14:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 23:14:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:14:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 23:14:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 23:14:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-04 23:14:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-09-04 23:14:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-04 23:14:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:56,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-09-04 23:14:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 30 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-09-04 23:14:57,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1232151992] [2020-09-04 23:14:57,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:57,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-04 23:14:57,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421616338] [2020-09-04 23:14:57,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 23:14:57,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:57,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 23:14:57,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2020-09-04 23:14:57,021 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 21 states. [2020-09-04 23:14:57,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:57,651 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2020-09-04 23:14:57,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 23:14:57,652 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2020-09-04 23:14:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:57,652 INFO L225 Difference]: With dead ends: 117 [2020-09-04 23:14:57,653 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 23:14:57,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 23:14:57,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 23:14:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 23:14:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 23:14:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 23:14:57,659 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2020-09-04 23:14:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:57,659 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 23:14:57,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 23:14:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 23:14:57,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 23:14:57,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 23:14:57,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 23:14:59,318 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-09-04 23:14:59,422 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2020-09-04 23:14:59,545 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2020-09-04 23:14:59,766 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 27 [2020-09-04 23:14:59,974 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 27 [2020-09-04 23:15:00,145 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-09-04 23:15:00,562 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2020-09-04 23:15:00,567 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 23:15:00,567 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 23:15:00,567 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 23:15:00,568 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 23:15:00,568 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 23:15:00,568 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 23:15:00,568 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:15:00,568 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:15:00,568 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-09-04 23:15:00,568 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-09-04 23:15:00,569 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:15:00,569 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse1 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse0 (+ main_~buf~0 main_~inlen~0)) (.cse3 (<= 0 main_~in~0)) (.cse4 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse0) (<= 0 main_~buf~0) .cse1 .cse2 .cse3 .cse4) (and (<= 1 main_~buf~0) .cse1 .cse2 (<= (+ main_~in~0 main_~buflim~0 3) .cse0) .cse3 .cse4))) [2020-09-04 23:15:00,569 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 45) the Hoare annotation is: true [2020-09-04 23:15:00,570 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-09-04 23:15:00,570 INFO L271 CegarLoopResult]: At program point L44(lines 14 45) the Hoare annotation is: true [2020-09-04 23:15:00,570 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ |main_#t~post5| 2) main_~bufferlen~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 |main_#t~post5|)) [2020-09-04 23:15:00,570 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= (+ |main_#t~post5| 2) main_~bufferlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 |main_#t~post5|)) [2020-09-04 23:15:00,571 INFO L264 CegarLoopResult]: At program point L36(lines 26 37) the Hoare annotation is: (let ((.cse2 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse1 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 .cse1 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse2) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse2) (<= 0 main_~buf~0) .cse0 .cse1 .cse3 (<= 0 main_~in~0)))) [2020-09-04 23:15:00,571 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 (+ main_~in~0 main_~buflim~0 3))) (let ((.cse0 (<= .cse5 (+ |main_#t~post3| main_~inlen~0))) (.cse6 (+ main_~buf~0 main_~inlen~0)) (.cse1 (<= 0 |main_#t~post3|)) (.cse2 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse3 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse4 (<= (+ |main_#t~post3| 1) main_~buflim~0)) (.cse7 (<= 0 main_~in~0)) (.cse8 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= 1 main_~buf~0) .cse1 .cse2 .cse3 .cse4 (<= .cse5 .cse6) .cse7 .cse8) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) .cse6) .cse1 (<= 0 main_~buf~0) .cse2 .cse3 .cse4 .cse7 .cse8)))) [2020-09-04 23:15:00,571 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (and (<= (+ main_~in~0 main_~buflim~0 3) (+ |main_#t~post3| main_~inlen~0)) (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= 0 |main_#t~post3|) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (< main_~buf~0 (+ main_~buflim~0 1)) (<= (+ |main_#t~post3| 1) main_~buflim~0) (<= 0 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-09-04 23:15:00,571 INFO L264 CegarLoopResult]: At program point L28(lines 28 29) the Hoare annotation is: (let ((.cse2 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse1 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 .cse1 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse2) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse2) (<= 0 main_~buf~0) .cse0 .cse1 .cse3 (<= 0 main_~in~0)))) [2020-09-04 23:15:00,571 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-09-04 23:15:00,572 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-09-04 23:15:00,572 INFO L264 CegarLoopResult]: At program point L20-1(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-09-04 23:15:00,572 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 23:15:00,572 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-09-04 23:15:00,572 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-09-04 23:15:00,572 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2020-09-04 23:15:00,572 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 2 main_~bufferlen~0)) [2020-09-04 23:15:00,573 INFO L264 CegarLoopResult]: At program point L33(lines 33 34) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (< main_~buf~0 (+ main_~buflim~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 0 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-09-04 23:15:00,573 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 0 main_~in~0)) [2020-09-04 23:15:00,573 INFO L264 CegarLoopResult]: At program point L21(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-09-04 23:15:00,573 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-09-04 23:15:00,573 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-09-04 23:15:00,573 INFO L271 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-09-04 23:15:00,573 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 45) the Hoare annotation is: true [2020-09-04 23:15:00,573 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-09-04 23:15:00,574 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2020-09-04 23:15:00,574 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0))) (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~buflim~0 4) .cse0) (<= main_~buf~0 main_~buflim~0) (<= 0 |main_#t~post4|) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= (+ |main_#t~post4| main_~buflim~0 4) .cse0) (<= 0 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-09-04 23:15:00,574 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0))) (and (<= 1 main_~buf~0) (<= 0 |main_#t~post4|) (< main_~buf~0 (+ main_~buflim~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ |main_#t~post4| main_~buflim~0 4) .cse0) (<= (+ main_~in~0 main_~buflim~0 3) .cse0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-09-04 23:15:00,574 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (let ((.cse1 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse0 (+ main_~buf~0 main_~inlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse0) (<= 0 main_~buf~0) .cse1 .cse2 .cse3 (<= 0 main_~in~0)) (and (<= 1 main_~buf~0) .cse1 .cse2 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse0) .cse3))) [2020-09-04 23:15:00,574 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 45) the Hoare annotation is: true [2020-09-04 23:15:00,575 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (let ((.cse1 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse0 (+ main_~buf~0 main_~inlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse0) (<= 0 main_~buf~0) .cse1 .cse2 .cse3 (<= 0 main_~in~0)) (and (<= 1 main_~buf~0) .cse1 .cse2 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse0) .cse3))) [2020-09-04 23:15:00,575 INFO L264 CegarLoopResult]: At program point L26-1(lines 26 37) the Hoare annotation is: (let ((.cse2 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse1 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 .cse1 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse2) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse2) (<= 0 main_~buf~0) .cse0 .cse1 .cse3 (<= 0 main_~in~0)))) [2020-09-04 23:15:00,575 INFO L264 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2020-09-04 23:15:00,575 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-09-04 23:15:00,575 INFO L264 CegarLoopResult]: At program point L26-4(line 26) the Hoare annotation is: (let ((.cse2 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse1 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 .cse1 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse2) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse2) (<= 0 main_~buf~0) .cse0 .cse1 .cse3 (<= 0 main_~in~0)))) [2020-09-04 23:15:00,575 INFO L264 CegarLoopResult]: At program point L26-5(lines 26 37) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2020-09-04 23:15:00,576 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-09-04 23:15:00,576 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-09-04 23:15:00,576 INFO L271 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: true [2020-09-04 23:15:00,576 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2020-09-04 23:15:00,576 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-09-04 23:15:00,576 INFO L264 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-09-04 23:15:00,576 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-09-04 23:15:00,577 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:15:00,577 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 23:15:00,577 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:15:00,577 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:15:00,577 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:15:00,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 11:15:00 BoogieIcfgContainer [2020-09-04 23:15:00,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 23:15:00,616 INFO L168 Benchmark]: Toolchain (without parser) took 12366.79 ms. Allocated memory was 135.8 MB in the beginning and 358.6 MB in the end (delta: 222.8 MB). Free memory was 99.8 MB in the beginning and 248.8 MB in the end (delta: -149.0 MB). Peak memory consumption was 210.7 MB. Max. memory is 7.1 GB. [2020-09-04 23:15:00,620 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 23:15:00,624 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.23 ms. Allocated memory is still 135.8 MB. Free memory was 99.5 MB in the beginning and 89.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-09-04 23:15:00,629 INFO L168 Benchmark]: Boogie Preprocessor took 120.89 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 89.7 MB in the beginning and 178.0 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-09-04 23:15:00,630 INFO L168 Benchmark]: RCFGBuilder took 391.94 ms. Allocated memory is still 199.8 MB. Free memory was 178.0 MB in the beginning and 161.5 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2020-09-04 23:15:00,632 INFO L168 Benchmark]: TraceAbstraction took 11478.06 ms. Allocated memory was 199.8 MB in the beginning and 358.6 MB in the end (delta: 158.9 MB). Free memory was 161.5 MB in the beginning and 248.8 MB in the end (delta: -87.3 MB). Peak memory consumption was 208.5 MB. Max. memory is 7.1 GB. [2020-09-04 23:15:00,638 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 370.23 ms. Allocated memory is still 135.8 MB. Free memory was 99.5 MB in the beginning and 89.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.89 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 89.7 MB in the beginning and 178.0 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 391.94 ms. Allocated memory is still 199.8 MB. Free memory was 178.0 MB in the beginning and 161.5 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11478.06 ms. Allocated memory was 199.8 MB in the beginning and 358.6 MB in the end (delta: 158.9 MB). Free memory was 161.5 MB in the beginning and 248.8 MB in the end (delta: -87.3 MB). Peak memory consumption was 208.5 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: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((1 <= buf && buf <= buflim) && buflim + 2 <= bufferlen) && 1 <= in) && in + buflim + 3 <= buf + inlen) && bufferlen + 1 <= inlen) || (((((in + bufferlen + 1 <= buf + inlen && 0 <= buf) && buf <= buflim) && buflim + 2 <= bufferlen) && bufferlen + 1 <= inlen) && 0 <= in) - 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, 60 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.3s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 863 SDtfs, 907 SDslu, 3750 SDs, 0 SdLazy, 1792 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 101 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 289 PreInvPairs, 460 NumberOfFragments, 911 HoareAnnotationTreeSize, 289 FomulaSimplifications, 48419 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 55 FomulaSimplificationsInter, 3947 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1034 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1018 ConstructedInterpolants, 0 QuantifiedInterpolants, 267636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 1508/1684 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...