/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.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i20_o20-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-89f541c [2020-08-27 21:49:51,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-27 21:49:51,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-27 21:49:51,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-27 21:49:51,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-27 21:49:51,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-27 21:49:51,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-27 21:49:51,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-27 21:49:51,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-27 21:49:51,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-27 21:49:51,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-27 21:49:51,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-27 21:49:51,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-27 21:49:51,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-27 21:49:51,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-27 21:49:51,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-27 21:49:51,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-27 21:49:51,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-27 21:49:51,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-27 21:49:51,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-27 21:49:51,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-27 21:49:51,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-27 21:49:51,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-27 21:49:51,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-27 21:49:51,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-27 21:49:51,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-27 21:49:51,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-27 21:49:51,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-27 21:49:51,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-27 21:49:51,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-27 21:49:51,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-27 21:49:51,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-27 21:49:51,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-27 21:49:51,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-27 21:49:51,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-27 21:49:51,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-27 21:49:51,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-27 21:49:51,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-27 21:49:51,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-27 21:49:51,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-27 21:49:51,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-27 21:49:51,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-27 21:49:51,550 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-27 21:49:51,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-27 21:49:51,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-27 21:49:51,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-27 21:49:51,552 INFO L138 SettingsManager]: * Use SBE=true [2020-08-27 21:49:51,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-27 21:49:51,552 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-27 21:49:51,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-27 21:49:51,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-27 21:49:51,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-27 21:49:51,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-27 21:49:51,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-27 21:49:51,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-27 21:49:51,554 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-27 21:49:51,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-27 21:49:51,554 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-27 21:49:51,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-27 21:49:51,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-27 21:49:51,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-27 21:49:51,555 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-27 21:49:51,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-27 21:49:51,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:49:51,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-27 21:49:51,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-27 21:49:51,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-27 21:49:51,556 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-27 21:49:51,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-27 21:49:51,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-27 21:49:51,557 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-27 21:49:51,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES 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: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-08-27 21:49:52,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-27 21:49:52,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-27 21:49:52,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-27 21:49:52,079 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-27 21:49:52,079 INFO L275 PluginConnector]: CDTParser initialized [2020-08-27 21:49:52,081 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i20_o20-1.c [2020-08-27 21:49:52,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e7f0e66f2/4489eef9532749afaa01235187cf3f08/FLAG112b4349d [2020-08-27 21:49:52,675 INFO L306 CDTParser]: Found 1 translation units. [2020-08-27 21:49:52,676 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i20_o20-1.c [2020-08-27 21:49:52,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e7f0e66f2/4489eef9532749afaa01235187cf3f08/FLAG112b4349d [2020-08-27 21:49:53,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e7f0e66f2/4489eef9532749afaa01235187cf3f08 [2020-08-27 21:49:53,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-27 21:49:53,035 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-27 21:49:53,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-27 21:49:53,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-27 21:49:53,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-27 21:49:53,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:49:53" (1/1) ... [2020-08-27 21:49:53,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ef1162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53, skipping insertion in model container [2020-08-27 21:49:53,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:49:53" (1/1) ... [2020-08-27 21:49:53,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-27 21:49:53,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-27 21:49:53,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:49:53,359 INFO L203 MainTranslator]: Completed pre-run [2020-08-27 21:49:53,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:49:53,390 INFO L208 MainTranslator]: Completed translation [2020-08-27 21:49:53,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53 WrapperNode [2020-08-27 21:49:53,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-27 21:49:53,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-27 21:49:53,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-27 21:49:53,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-27 21:49:53,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53" (1/1) ... [2020-08-27 21:49:53,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53" (1/1) ... [2020-08-27 21:49:53,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53" (1/1) ... [2020-08-27 21:49:53,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53" (1/1) ... [2020-08-27 21:49:53,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53" (1/1) ... [2020-08-27 21:49:53,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53" (1/1) ... [2020-08-27 21:49:53,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53" (1/1) ... [2020-08-27 21:49:53,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-27 21:49:53,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-27 21:49:53,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-27 21:49:53,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-27 21:49:53,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53" (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-08-27 21:49:53,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-27 21:49:53,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-27 21:49:53,574 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-08-27 21:49:53,574 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-27 21:49:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-27 21:49:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-27 21:49:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-08-27 21:49:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-27 21:49:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-27 21:49:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-27 21:49:53,759 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-27 21:49:53,759 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-27 21:49:53,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:49:53 BoogieIcfgContainer [2020-08-27 21:49:53,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-27 21:49:53,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-27 21:49:53,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-27 21:49:53,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-27 21:49:53,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:49:53" (1/3) ... [2020-08-27 21:49:53,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9b2550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:49:53, skipping insertion in model container [2020-08-27 21:49:53,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53" (2/3) ... [2020-08-27 21:49:53,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9b2550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:49:53, skipping insertion in model container [2020-08-27 21:49:53,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:49:53" (3/3) ... [2020-08-27 21:49:53,774 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i20_o20-1.c [2020-08-27 21:49:53,786 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-27 21:49:53,796 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-27 21:49:53,820 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-27 21:49:53,851 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-27 21:49:53,852 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-27 21:49:53,852 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-27 21:49:53,852 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-27 21:49:53,852 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-27 21:49:53,852 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-27 21:49:53,853 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-27 21:49:53,853 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-27 21:49:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-08-27 21:49:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-27 21:49:53,881 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:53,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:53,882 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:53,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:53,889 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2020-08-27 21:49:53,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:53,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [114218771] [2020-08-27 21:49:53,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:49:54,291 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [114218771] [2020-08-27 21:49:54,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:49:54,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-27 21:49:54,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245635334] [2020-08-27 21:49:54,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:49:54,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:54,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:49:54,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:49:54,323 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-08-27 21:49:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:54,403 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-08-27 21:49:54,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:49:54,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-27 21:49:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:54,418 INFO L225 Difference]: With dead ends: 30 [2020-08-27 21:49:54,419 INFO L226 Difference]: Without dead ends: 18 [2020-08-27 21:49:54,423 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:49:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-08-27 21:49:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-08-27 21:49:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-08-27 21:49:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-08-27 21:49:54,468 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-08-27 21:49:54,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:54,468 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-08-27 21:49:54,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:49:54,469 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-08-27 21:49:54,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-08-27 21:49:54,471 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:54,471 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:54,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-27 21:49:54,472 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:54,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:54,472 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2020-08-27 21:49:54,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:54,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [636279779] [2020-08-27 21:49:54,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-08-27 21:49:54,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [636279779] [2020-08-27 21:49:54,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:54,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-27 21:49:54,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126660664] [2020-08-27 21:49:54,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-27 21:49:54,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:54,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-27 21:49:54,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:49:54,606 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-08-27 21:49:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:54,681 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-08-27 21:49:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-27 21:49:54,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-08-27 21:49:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:54,684 INFO L225 Difference]: With dead ends: 25 [2020-08-27 21:49:54,684 INFO L226 Difference]: Without dead ends: 21 [2020-08-27 21:49:54,685 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:49:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-27 21:49:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-27 21:49:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-27 21:49:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-08-27 21:49:54,693 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-08-27 21:49:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:54,694 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-08-27 21:49:54,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-27 21:49:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-08-27 21:49:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-08-27 21:49:54,696 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:54,696 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:54,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-27 21:49:54,697 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:54,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:54,697 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2020-08-27 21:49:54,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:54,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [193583074] [2020-08-27 21:49:54,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,892 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-08-27 21:49:54,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [193583074] [2020-08-27 21:49:54,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:54,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:49:54,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056250284] [2020-08-27 21:49:54,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:49:54,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:54,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:49:54,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:49:54,895 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2020-08-27 21:49:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:54,961 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-08-27 21:49:54,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-27 21:49:54,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-08-27 21:49:54,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:54,963 INFO L225 Difference]: With dead ends: 28 [2020-08-27 21:49:54,963 INFO L226 Difference]: Without dead ends: 24 [2020-08-27 21:49:54,964 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:49:54,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-08-27 21:49:54,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-08-27 21:49:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-08-27 21:49:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-08-27 21:49:54,972 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-08-27 21:49:54,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:54,972 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-08-27 21:49:54,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:49:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-08-27 21:49:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-08-27 21:49:54,974 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:54,974 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:54,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-27 21:49:54,975 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:54,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:54,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2020-08-27 21:49:54,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:54,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [700011758] [2020-08-27 21:49:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-08-27 21:49:55,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [700011758] [2020-08-27 21:49:55,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:55,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-27 21:49:55,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242192188] [2020-08-27 21:49:55,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:49:55,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:55,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:49:55,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:49:55,237 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2020-08-27 21:49:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:55,334 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-08-27 21:49:55,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-27 21:49:55,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-08-27 21:49:55,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:55,336 INFO L225 Difference]: With dead ends: 31 [2020-08-27 21:49:55,336 INFO L226 Difference]: Without dead ends: 27 [2020-08-27 21:49:55,337 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:49:55,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-08-27 21:49:55,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-08-27 21:49:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-08-27 21:49:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-08-27 21:49:55,345 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-08-27 21:49:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:55,347 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-08-27 21:49:55,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:49:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-08-27 21:49:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-27 21:49:55,349 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:55,349 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:55,349 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-27 21:49:55,350 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:55,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2020-08-27 21:49:55,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:55,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [462075587] [2020-08-27 21:49:55,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-08-27 21:49:55,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [462075587] [2020-08-27 21:49:55,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:55,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-27 21:49:55,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700497200] [2020-08-27 21:49:55,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-27 21:49:55,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:55,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-27 21:49:55,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-27 21:49:55,565 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-08-27 21:49:55,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:55,657 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-08-27 21:49:55,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-27 21:49:55,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-08-27 21:49:55,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:55,659 INFO L225 Difference]: With dead ends: 34 [2020-08-27 21:49:55,659 INFO L226 Difference]: Without dead ends: 30 [2020-08-27 21:49:55,660 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-27 21:49:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-27 21:49:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-27 21:49:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-27 21:49:55,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-08-27 21:49:55,668 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-08-27 21:49:55,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:55,668 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-08-27 21:49:55,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-27 21:49:55,669 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-08-27 21:49:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-08-27 21:49:55,670 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:55,670 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:55,670 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-27 21:49:55,671 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:55,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:55,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2020-08-27 21:49:55,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:55,672 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1640987377] [2020-08-27 21:49:55,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-08-27 21:49:55,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1640987377] [2020-08-27 21:49:55,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:55,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-27 21:49:55,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442871119] [2020-08-27 21:49:55,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-27 21:49:55,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:55,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-27 21:49:55,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:49:55,872 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2020-08-27 21:49:55,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:55,985 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-08-27 21:49:55,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:49:55,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-08-27 21:49:55,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:55,988 INFO L225 Difference]: With dead ends: 37 [2020-08-27 21:49:55,988 INFO L226 Difference]: Without dead ends: 33 [2020-08-27 21:49:55,989 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-27 21:49:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-08-27 21:49:55,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-08-27 21:49:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-08-27 21:49:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-08-27 21:49:55,996 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-08-27 21:49:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:55,997 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-08-27 21:49:55,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-27 21:49:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-08-27 21:49:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-08-27 21:49:55,999 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:55,999 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:55,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-27 21:49:56,000 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:56,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:56,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2020-08-27 21:49:56,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:56,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1997813921] [2020-08-27 21:49:56,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-08-27 21:49:56,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1997813921] [2020-08-27 21:49:56,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:56,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-27 21:49:56,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906116008] [2020-08-27 21:49:56,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-27 21:49:56,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:56,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-27 21:49:56,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-27 21:49:56,252 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-08-27 21:49:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:56,431 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-08-27 21:49:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-27 21:49:56,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-08-27 21:49:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:56,433 INFO L225 Difference]: With dead ends: 40 [2020-08-27 21:49:56,433 INFO L226 Difference]: Without dead ends: 36 [2020-08-27 21:49:56,434 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-27 21:49:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-08-27 21:49:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-08-27 21:49:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-08-27 21:49:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-08-27 21:49:56,448 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-08-27 21:49:56,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:56,449 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-08-27 21:49:56,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-27 21:49:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-08-27 21:49:56,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-27 21:49:56,450 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:56,450 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:56,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-27 21:49:56,451 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:56,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:56,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2020-08-27 21:49:56,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:56,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [701544648] [2020-08-27 21:49:56,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-08-27 21:49:56,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [701544648] [2020-08-27 21:49:56,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:56,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-27 21:49:56,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726150875] [2020-08-27 21:49:56,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-27 21:49:56,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:56,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-27 21:49:56,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:49:56,751 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2020-08-27 21:49:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:56,879 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-08-27 21:49:56,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-27 21:49:56,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2020-08-27 21:49:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:56,881 INFO L225 Difference]: With dead ends: 43 [2020-08-27 21:49:56,882 INFO L226 Difference]: Without dead ends: 39 [2020-08-27 21:49:56,882 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-08-27 21:49:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-08-27 21:49:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-08-27 21:49:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-27 21:49:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-08-27 21:49:56,890 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-08-27 21:49:56,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:56,891 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-08-27 21:49:56,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-27 21:49:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-08-27 21:49:56,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-27 21:49:56,892 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:56,893 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:56,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-27 21:49:56,893 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:56,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:56,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2020-08-27 21:49:56,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:56,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [412862768] [2020-08-27 21:49:56,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-08-27 21:49:57,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [412862768] [2020-08-27 21:49:57,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:57,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-27 21:49:57,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155570325] [2020-08-27 21:49:57,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-27 21:49:57,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:57,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-27 21:49:57,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-27 21:49:57,217 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2020-08-27 21:49:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:57,352 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-08-27 21:49:57,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-27 21:49:57,353 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2020-08-27 21:49:57,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:57,354 INFO L225 Difference]: With dead ends: 46 [2020-08-27 21:49:57,355 INFO L226 Difference]: Without dead ends: 42 [2020-08-27 21:49:57,356 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-08-27 21:49:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-08-27 21:49:57,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-08-27 21:49:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-27 21:49:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-08-27 21:49:57,363 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-08-27 21:49:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:57,363 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-08-27 21:49:57,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-27 21:49:57,364 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-08-27 21:49:57,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-08-27 21:49:57,365 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:57,365 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:57,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-27 21:49:57,366 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:57,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:57,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2020-08-27 21:49:57,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:57,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [585675167] [2020-08-27 21:49:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-08-27 21:49:57,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [585675167] [2020-08-27 21:49:57,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:57,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-08-27 21:49:57,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180321611] [2020-08-27 21:49:57,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-27 21:49:57,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:57,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-27 21:49:57,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-08-27 21:49:57,713 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2020-08-27 21:49:57,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:57,857 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-08-27 21:49:57,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-27 21:49:57,858 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2020-08-27 21:49:57,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:57,859 INFO L225 Difference]: With dead ends: 49 [2020-08-27 21:49:57,859 INFO L226 Difference]: Without dead ends: 45 [2020-08-27 21:49:57,860 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-08-27 21:49:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-27 21:49:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-08-27 21:49:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-08-27 21:49:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-08-27 21:49:57,866 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-08-27 21:49:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:57,867 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-08-27 21:49:57,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-27 21:49:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-08-27 21:49:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-08-27 21:49:57,868 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:57,868 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:57,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-27 21:49:57,869 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:57,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:57,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2020-08-27 21:49:57,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:57,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1125041275] [2020-08-27 21:49:57,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-08-27 21:49:58,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1125041275] [2020-08-27 21:49:58,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:58,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-27 21:49:58,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983479142] [2020-08-27 21:49:58,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-27 21:49:58,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:58,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-27 21:49:58,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-08-27 21:49:58,315 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2020-08-27 21:49:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:58,481 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-08-27 21:49:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-27 21:49:58,481 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-08-27 21:49:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:58,483 INFO L225 Difference]: With dead ends: 52 [2020-08-27 21:49:58,483 INFO L226 Difference]: Without dead ends: 48 [2020-08-27 21:49:58,484 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-08-27 21:49:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-27 21:49:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-08-27 21:49:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-08-27 21:49:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-08-27 21:49:58,490 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2020-08-27 21:49:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:58,490 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-08-27 21:49:58,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-27 21:49:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-08-27 21:49:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-08-27 21:49:58,492 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:58,492 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:58,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-27 21:49:58,492 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:58,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:58,493 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2020-08-27 21:49:58,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:58,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [126920466] [2020-08-27 21:49:58,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-08-27 21:49:59,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [126920466] [2020-08-27 21:49:59,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:59,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-08-27 21:49:59,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509308394] [2020-08-27 21:49:59,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-27 21:49:59,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:59,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-27 21:49:59,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-08-27 21:49:59,042 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2020-08-27 21:49:59,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:59,244 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-08-27 21:49:59,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-27 21:49:59,245 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2020-08-27 21:49:59,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:59,246 INFO L225 Difference]: With dead ends: 55 [2020-08-27 21:49:59,246 INFO L226 Difference]: Without dead ends: 51 [2020-08-27 21:49:59,248 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-08-27 21:49:59,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-08-27 21:49:59,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-08-27 21:49:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-08-27 21:49:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-08-27 21:49:59,261 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2020-08-27 21:49:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:59,263 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-08-27 21:49:59,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-27 21:49:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-08-27 21:49:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-08-27 21:49:59,267 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:59,267 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:59,267 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-27 21:49:59,267 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:59,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:59,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2020-08-27 21:49:59,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:59,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [955358212] [2020-08-27 21:49:59,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-08-27 21:49:59,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [955358212] [2020-08-27 21:49:59,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:59,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-27 21:49:59,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949220269] [2020-08-27 21:49:59,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-27 21:49:59,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:59,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-27 21:49:59,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-08-27 21:49:59,871 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2020-08-27 21:50:00,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:00,079 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-08-27 21:50:00,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-08-27 21:50:00,080 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-08-27 21:50:00,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:00,081 INFO L225 Difference]: With dead ends: 58 [2020-08-27 21:50:00,081 INFO L226 Difference]: Without dead ends: 54 [2020-08-27 21:50:00,083 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-08-27 21:50:00,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-08-27 21:50:00,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-08-27 21:50:00,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-27 21:50:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-08-27 21:50:00,089 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2020-08-27 21:50:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:00,090 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-08-27 21:50:00,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-27 21:50:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-08-27 21:50:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-08-27 21:50:00,091 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:00,091 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:00,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-27 21:50:00,092 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:00,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:00,092 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2020-08-27 21:50:00,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:00,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1627862803] [2020-08-27 21:50:00,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-08-27 21:50:00,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1627862803] [2020-08-27 21:50:00,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:00,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-27 21:50:00,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022591517] [2020-08-27 21:50:00,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-27 21:50:00,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:00,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-27 21:50:00,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-08-27 21:50:00,676 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2020-08-27 21:50:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:00,875 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-08-27 21:50:00,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-27 21:50:00,876 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2020-08-27 21:50:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:00,877 INFO L225 Difference]: With dead ends: 61 [2020-08-27 21:50:00,877 INFO L226 Difference]: Without dead ends: 57 [2020-08-27 21:50:00,879 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-08-27 21:50:00,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-27 21:50:00,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-08-27 21:50:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-08-27 21:50:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-08-27 21:50:00,885 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2020-08-27 21:50:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:00,885 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-08-27 21:50:00,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-27 21:50:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-08-27 21:50:00,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-08-27 21:50:00,886 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:00,887 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:00,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-27 21:50:00,887 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:00,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:00,888 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2020-08-27 21:50:00,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:00,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1965548219] [2020-08-27 21:50:00,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-08-27 21:50:01,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1965548219] [2020-08-27 21:50:01,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:01,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-27 21:50:01,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392848149] [2020-08-27 21:50:01,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-27 21:50:01,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:01,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-27 21:50:01,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-08-27 21:50:01,564 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2020-08-27 21:50:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:01,800 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-08-27 21:50:01,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-27 21:50:01,801 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2020-08-27 21:50:01,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:01,802 INFO L225 Difference]: With dead ends: 64 [2020-08-27 21:50:01,802 INFO L226 Difference]: Without dead ends: 60 [2020-08-27 21:50:01,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-08-27 21:50:01,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-08-27 21:50:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-08-27 21:50:01,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-08-27 21:50:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-08-27 21:50:01,809 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2020-08-27 21:50:01,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:01,809 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-08-27 21:50:01,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-27 21:50:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-08-27 21:50:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-08-27 21:50:01,811 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:01,811 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:01,811 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-27 21:50:01,811 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:01,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:01,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2020-08-27 21:50:01,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:01,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2054651499] [2020-08-27 21:50:01,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-08-27 21:50:02,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2054651499] [2020-08-27 21:50:02,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:02,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-08-27 21:50:02,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660496890] [2020-08-27 21:50:02,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-08-27 21:50:02,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:02,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-08-27 21:50:02,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-08-27 21:50:02,509 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2020-08-27 21:50:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:02,764 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-08-27 21:50:02,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-27 21:50:02,765 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2020-08-27 21:50:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:02,767 INFO L225 Difference]: With dead ends: 67 [2020-08-27 21:50:02,767 INFO L226 Difference]: Without dead ends: 63 [2020-08-27 21:50:02,770 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2020-08-27 21:50:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-08-27 21:50:02,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-08-27 21:50:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-08-27 21:50:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-08-27 21:50:02,784 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2020-08-27 21:50:02,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:02,785 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-08-27 21:50:02,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-08-27 21:50:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-08-27 21:50:02,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-27 21:50:02,790 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:02,790 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:02,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-27 21:50:02,792 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:02,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:02,792 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2020-08-27 21:50:02,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:02,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1593105725] [2020-08-27 21:50:02,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-08-27 21:50:03,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1593105725] [2020-08-27 21:50:03,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:03,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-08-27 21:50:03,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428926010] [2020-08-27 21:50:03,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-08-27 21:50:03,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:03,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-08-27 21:50:03,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-08-27 21:50:03,618 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 21 states. [2020-08-27 21:50:03,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:03,934 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2020-08-27 21:50:03,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-27 21:50:03,934 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2020-08-27 21:50:03,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:03,936 INFO L225 Difference]: With dead ends: 70 [2020-08-27 21:50:03,936 INFO L226 Difference]: Without dead ends: 66 [2020-08-27 21:50:03,938 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2020-08-27 21:50:03,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-08-27 21:50:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-08-27 21:50:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-08-27 21:50:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2020-08-27 21:50:03,944 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2020-08-27 21:50:03,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:03,945 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2020-08-27 21:50:03,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-08-27 21:50:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2020-08-27 21:50:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-08-27 21:50:03,947 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:03,948 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:03,948 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-27 21:50:03,948 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:03,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:03,949 INFO L82 PathProgramCache]: Analyzing trace with hash -464475409, now seen corresponding path program 17 times [2020-08-27 21:50:03,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:03,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [897244225] [2020-08-27 21:50:03,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-08-27 21:50:04,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [897244225] [2020-08-27 21:50:04,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:04,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-08-27 21:50:04,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652714393] [2020-08-27 21:50:04,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-08-27 21:50:04,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:04,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-08-27 21:50:04,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-08-27 21:50:04,915 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 22 states. [2020-08-27 21:50:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:05,280 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2020-08-27 21:50:05,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-08-27 21:50:05,281 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2020-08-27 21:50:05,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:05,282 INFO L225 Difference]: With dead ends: 73 [2020-08-27 21:50:05,282 INFO L226 Difference]: Without dead ends: 69 [2020-08-27 21:50:05,284 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-08-27 21:50:05,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-08-27 21:50:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-08-27 21:50:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-08-27 21:50:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-08-27 21:50:05,295 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2020-08-27 21:50:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:05,296 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-08-27 21:50:05,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-08-27 21:50:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-08-27 21:50:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-08-27 21:50:05,299 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:05,299 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:05,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-08-27 21:50:05,300 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:05,300 INFO L82 PathProgramCache]: Analyzing trace with hash 130115453, now seen corresponding path program 18 times [2020-08-27 21:50:05,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:05,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [127447213] [2020-08-27 21:50:05,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-08-27 21:50:06,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [127447213] [2020-08-27 21:50:06,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:06,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-08-27 21:50:06,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034007793] [2020-08-27 21:50:06,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-08-27 21:50:06,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:06,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-08-27 21:50:06,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-08-27 21:50:06,209 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 23 states. [2020-08-27 21:50:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:06,583 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-08-27 21:50:06,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-27 21:50:06,583 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 121 [2020-08-27 21:50:06,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:06,585 INFO L225 Difference]: With dead ends: 76 [2020-08-27 21:50:06,586 INFO L226 Difference]: Without dead ends: 72 [2020-08-27 21:50:06,588 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-08-27 21:50:06,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-08-27 21:50:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-08-27 21:50:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-08-27 21:50:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-08-27 21:50:06,602 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2020-08-27 21:50:06,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:06,603 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-08-27 21:50:06,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-08-27 21:50:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-08-27 21:50:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-08-27 21:50:06,605 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:06,605 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:06,605 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-08-27 21:50:06,606 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:06,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:06,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2010955025, now seen corresponding path program 19 times [2020-08-27 21:50:06,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:06,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1493358235] [2020-08-27 21:50:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-08-27 21:50:07,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1493358235] [2020-08-27 21:50:07,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:07,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-08-27 21:50:07,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873146568] [2020-08-27 21:50:07,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-08-27 21:50:07,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:07,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-08-27 21:50:07,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-08-27 21:50:07,685 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 24 states. [2020-08-27 21:50:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:08,045 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-08-27 21:50:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-27 21:50:08,046 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2020-08-27 21:50:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:08,047 INFO L225 Difference]: With dead ends: 79 [2020-08-27 21:50:08,047 INFO L226 Difference]: Without dead ends: 75 [2020-08-27 21:50:08,048 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2020-08-27 21:50:08,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-08-27 21:50:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-08-27 21:50:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-08-27 21:50:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-08-27 21:50:08,052 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2020-08-27 21:50:08,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:08,053 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-08-27 21:50:08,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-08-27 21:50:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-08-27 21:50:08,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-08-27 21:50:08,054 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:08,055 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:08,055 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-08-27 21:50:08,055 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:08,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:08,055 INFO L82 PathProgramCache]: Analyzing trace with hash -799288067, now seen corresponding path program 20 times [2020-08-27 21:50:08,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:08,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [67724792] [2020-08-27 21:50:08,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-08-27 21:50:10,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [67724792] [2020-08-27 21:50:10,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:10,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2020-08-27 21:50:10,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492861872] [2020-08-27 21:50:10,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2020-08-27 21:50:10,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:10,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2020-08-27 21:50:10,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2020-08-27 21:50:10,633 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 45 states. [2020-08-27 21:50:11,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:11,684 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2020-08-27 21:50:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-08-27 21:50:11,685 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 133 [2020-08-27 21:50:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:11,686 INFO L225 Difference]: With dead ends: 82 [2020-08-27 21:50:11,686 INFO L226 Difference]: Without dead ends: 78 [2020-08-27 21:50:11,687 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2020-08-27 21:50:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-08-27 21:50:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-08-27 21:50:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-08-27 21:50:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2020-08-27 21:50:11,706 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 133 [2020-08-27 21:50:11,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:11,708 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2020-08-27 21:50:11,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 45 states. [2020-08-27 21:50:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2020-08-27 21:50:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-08-27 21:50:11,710 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:11,710 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:11,710 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-08-27 21:50:11,710 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:11,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:11,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1226192145, now seen corresponding path program 21 times [2020-08-27 21:50:11,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:11,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1021803145] [2020-08-27 21:50:11,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:11,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:11,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:11,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:11,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 630 proven. 42 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-08-27 21:50:13,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1021803145] [2020-08-27 21:50:13,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:13,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-08-27 21:50:13,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232360750] [2020-08-27 21:50:13,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-08-27 21:50:13,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:13,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-08-27 21:50:13,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2020-08-27 21:50:13,103 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 26 states. [2020-08-27 21:50:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:15,051 INFO L93 Difference]: Finished difference Result 197 states and 638 transitions. [2020-08-27 21:50:15,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-08-27 21:50:15,053 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 139 [2020-08-27 21:50:15,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:15,054 INFO L225 Difference]: With dead ends: 197 [2020-08-27 21:50:15,054 INFO L226 Difference]: Without dead ends: 0 [2020-08-27 21:50:15,062 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=767, Invalid=1489, Unknown=0, NotChecked=0, Total=2256 [2020-08-27 21:50:15,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-27 21:50:15,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-27 21:50:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-27 21:50:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-27 21:50:15,063 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2020-08-27 21:50:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:15,064 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-27 21:50:15,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-08-27 21:50:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-27 21:50:15,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-27 21:50:15,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-08-27 21:50:15,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-27 21:50:15,297 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 3 [2020-08-27 21:50:15,303 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-27 21:50:15,303 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-08-27 21:50:15,303 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-08-27 21:50:15,303 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-27 21:50:15,303 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-27 21:50:15,304 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-08-27 21:50:15,306 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2020-08-27 21:50:15,306 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-08-27 21:50:15,306 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 9 15) no Hoare annotation was computed. [2020-08-27 21:50:15,306 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-08-27 21:50:15,307 INFO L268 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-08-27 21:50:15,307 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= main_~input~0 20) (<= 20 main_~input~0)) [2020-08-27 21:50:15,307 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-08-27 21:50:15,307 INFO L268 CegarLoopResult]: For program point L12-2(lines 9 15) no Hoare annotation was computed. [2020-08-27 21:50:15,307 INFO L268 CegarLoopResult]: For program point idFINAL(lines 4 7) no Hoare annotation was computed. [2020-08-27 21:50:15,308 INFO L268 CegarLoopResult]: For program point idEXIT(lines 4 7) no Hoare annotation was computed. [2020-08-27 21:50:15,308 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-08-27 21:50:15,308 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-08-27 21:50:15,308 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-08-27 21:50:15,308 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-08-27 21:50:15,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:50:15 BoogieIcfgContainer [2020-08-27 21:50:15,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-27 21:50:15,335 INFO L168 Benchmark]: Toolchain (without parser) took 22300.26 ms. Allocated memory was 138.9 MB in the beginning and 529.5 MB in the end (delta: 390.6 MB). Free memory was 102.3 MB in the beginning and 187.7 MB in the end (delta: -85.4 MB). Peak memory consumption was 305.2 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:15,338 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-27 21:50:15,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.00 ms. Allocated memory is still 138.9 MB. Free memory was 102.1 MB in the beginning and 92.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:15,339 INFO L168 Benchmark]: Boogie Preprocessor took 31.76 ms. Allocated memory is still 138.9 MB. Free memory was 92.9 MB in the beginning and 91.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:15,346 INFO L168 Benchmark]: RCFGBuilder took 340.61 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 91.5 MB in the beginning and 170.2 MB in the end (delta: -78.7 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:15,347 INFO L168 Benchmark]: TraceAbstraction took 21567.06 ms. Allocated memory was 201.9 MB in the beginning and 529.5 MB in the end (delta: 327.7 MB). Free memory was 169.5 MB in the beginning and 187.7 MB in the end (delta: -18.3 MB). Peak memory consumption was 309.4 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:15,351 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.25 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 355.00 ms. Allocated memory is still 138.9 MB. Free memory was 102.1 MB in the beginning and 92.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.76 ms. Allocated memory is still 138.9 MB. Free memory was 92.9 MB in the beginning and 91.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 340.61 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 91.5 MB in the beginning and 170.2 MB in the end (delta: -78.7 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21567.06 ms. Allocated memory was 201.9 MB in the beginning and 529.5 MB in the end (delta: 327.7 MB). Free memory was 169.5 MB in the beginning and 187.7 MB in the end (delta: -18.3 MB). Peak memory consumption was 309.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 21.2s, OverallIterations: 22, TraceHistogramMax: 22, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 369 SDtfs, 657 SDslu, 3302 SDs, 0 SdLazy, 3411 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1122 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 549 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2720 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 49 PreInvPairs, 49 NumberOfFragments, 15 HoareAnnotationTreeSize, 49 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 241 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 1672 NumberOfCodeBlocks, 1672 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1650 ConstructedInterpolants, 0 QuantifiedInterpolants, 417408 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 1 PerfectInterpolantSequences, 5712/10164 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...