java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:46:16,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:46:16,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:46:16,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:46:16,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:46:16,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:46:16,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:46:16,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:46:16,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:46:16,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:46:16,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:46:16,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:46:16,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:46:16,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:46:16,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:46:16,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:46:16,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:46:16,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:46:16,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:46:16,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:46:16,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:46:16,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:46:16,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:46:16,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:46:16,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:46:16,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:46:16,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:46:16,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:46:16,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:46:16,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:46:16,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:46:16,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:46:16,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:46:16,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:46:16,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:46:16,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:46:16,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:46:16,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:46:16,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:46:16,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:46:16,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:46:16,565 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 21:46:16,579 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:46:16,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:46:16,581 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:46:16,581 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:46:16,581 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:46:16,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:46:16,582 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:46:16,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:46:16,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:46:16,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:46:16,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:46:16,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:46:16,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:46:16,583 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:46:16,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:46:16,583 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:46:16,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:46:16,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:46:16,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:46:16,584 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:46:16,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:46:16,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:46:16,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:46:16,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:46:16,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:46:16,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:46:16,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:46:16,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:46:16,586 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:46:16,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:46:16,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:46:16,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:46:16,898 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:46:16,898 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:46:16,899 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c [2019-10-14 21:46:16,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd56b2c82/61a143329b4c4b8c8f161ddeeec8e5bb/FLAG5fb0de205 [2019-10-14 21:46:17,404 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:46:17,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c [2019-10-14 21:46:17,412 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd56b2c82/61a143329b4c4b8c8f161ddeeec8e5bb/FLAG5fb0de205 [2019-10-14 21:46:17,795 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd56b2c82/61a143329b4c4b8c8f161ddeeec8e5bb [2019-10-14 21:46:17,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:46:17,807 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:46:17,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:46:17,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:46:17,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:46:17,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:46:17" (1/1) ... [2019-10-14 21:46:17,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7639f8e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:46:17, skipping insertion in model container [2019-10-14 21:46:17,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:46:17" (1/1) ... [2019-10-14 21:46:17,823 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:46:17,840 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:46:18,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:46:18,020 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:46:18,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:46:18,062 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:46:18,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:46:18 WrapperNode [2019-10-14 21:46:18,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:46:18,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:46:18,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:46:18,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:46:18,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:46:18" (1/1) ... [2019-10-14 21:46:18,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:46:18" (1/1) ... [2019-10-14 21:46:18,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:46:18" (1/1) ... [2019-10-14 21:46:18,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:46:18" (1/1) ... [2019-10-14 21:46:18,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:46:18" (1/1) ... [2019-10-14 21:46:18,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:46:18" (1/1) ... [2019-10-14 21:46:18,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:46:18" (1/1) ... [2019-10-14 21:46:18,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:46:18,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:46:18,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:46:18,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:46:18,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:46:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-10-14 21:46:18,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:46:18,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:46:18,233 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:46:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:46:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:46:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:46:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:46:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 21:46:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:46:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:46:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:46:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:46:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:46:18,443 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:46:18,443 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 21:46:18,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:46:18 BoogieIcfgContainer [2019-10-14 21:46:18,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:46:18,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:46:18,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:46:18,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:46:18,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:46:17" (1/3) ... [2019-10-14 21:46:18,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c27c9b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:46:18, skipping insertion in model container [2019-10-14 21:46:18,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:46:18" (2/3) ... [2019-10-14 21:46:18,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c27c9b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:46:18, skipping insertion in model container [2019-10-14 21:46:18,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:46:18" (3/3) ... [2019-10-14 21:46:18,453 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_sentinel.i.v+cfa-reducer.c [2019-10-14 21:46:18,462 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:46:18,475 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:46:18,487 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:46:18,521 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:46:18,521 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:46:18,521 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:46:18,522 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:46:18,522 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:46:18,522 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:46:18,522 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:46:18,522 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:46:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-14 21:46:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-14 21:46:18,554 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:18,556 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:18,559 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:18,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:18,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1429065311, now seen corresponding path program 1 times [2019-10-14 21:46:18,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:18,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85747429] [2019-10-14 21:46:18,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:18,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:18,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:46:18,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85747429] [2019-10-14 21:46:18,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:46:18,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 21:46:18,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728321198] [2019-10-14 21:46:18,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 21:46:18,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:18,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 21:46:18,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 21:46:18,807 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-14 21:46:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:18,908 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-10-14 21:46:18,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 21:46:18,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-14 21:46:18,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:18,925 INFO L225 Difference]: With dead ends: 30 [2019-10-14 21:46:18,925 INFO L226 Difference]: Without dead ends: 15 [2019-10-14 21:46:18,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 21:46:18,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-14 21:46:18,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-14 21:46:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-14 21:46:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-10-14 21:46:18,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-10-14 21:46:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:18,989 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-14 21:46:18,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 21:46:18,990 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-10-14 21:46:18,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-14 21:46:18,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:18,992 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:18,993 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:18,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:18,994 INFO L82 PathProgramCache]: Analyzing trace with hash 399010521, now seen corresponding path program 1 times [2019-10-14 21:46:18,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:18,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517268025] [2019-10-14 21:46:18,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:18,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:18,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:46:19,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517268025] [2019-10-14 21:46:19,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:46:19,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:46:19,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127413162] [2019-10-14 21:46:19,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:46:19,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:19,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:46:19,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:46:19,136 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 4 states. [2019-10-14 21:46:19,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:19,188 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-10-14 21:46:19,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:46:19,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-14 21:46:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:19,190 INFO L225 Difference]: With dead ends: 24 [2019-10-14 21:46:19,190 INFO L226 Difference]: Without dead ends: 17 [2019-10-14 21:46:19,191 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:46:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-14 21:46:19,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-10-14 21:46:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-14 21:46:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-14 21:46:19,198 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-10-14 21:46:19,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:19,198 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-14 21:46:19,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:46:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-14 21:46:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 21:46:19,199 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:19,200 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:19,200 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1207654839, now seen corresponding path program 1 times [2019-10-14 21:46:19,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:19,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146810622] [2019-10-14 21:46:19,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:19,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:19,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:46:19,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146810622] [2019-10-14 21:46:19,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:46:19,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 21:46:19,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045523756] [2019-10-14 21:46:19,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:46:19,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:19,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:46:19,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:46:19,357 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2019-10-14 21:46:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:19,437 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-10-14 21:46:19,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:46:19,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-14 21:46:19,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:19,438 INFO L225 Difference]: With dead ends: 21 [2019-10-14 21:46:19,438 INFO L226 Difference]: Without dead ends: 18 [2019-10-14 21:46:19,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:46:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-14 21:46:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-14 21:46:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-14 21:46:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-14 21:46:19,444 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2019-10-14 21:46:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:19,445 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-14 21:46:19,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:46:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-14 21:46:19,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 21:46:19,446 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:19,446 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:19,447 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:19,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:19,447 INFO L82 PathProgramCache]: Analyzing trace with hash 913042234, now seen corresponding path program 1 times [2019-10-14 21:46:19,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:19,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765472909] [2019-10-14 21:46:19,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:19,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:19,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 21:46:19,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765472909] [2019-10-14 21:46:19,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585452607] [2019-10-14 21:46:19,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:19,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 21:46:19,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 21:46:19,667 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:19,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-10-14 21:46:19,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242856562] [2019-10-14 21:46:19,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:46:19,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:19,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:46:19,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:46:19,671 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-10-14 21:46:19,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:19,723 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-10-14 21:46:19,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:46:19,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-14 21:46:19,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:19,724 INFO L225 Difference]: With dead ends: 30 [2019-10-14 21:46:19,724 INFO L226 Difference]: Without dead ends: 21 [2019-10-14 21:46:19,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:46:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-14 21:46:19,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-10-14 21:46:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-14 21:46:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-10-14 21:46:19,731 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-10-14 21:46:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:19,731 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-14 21:46:19,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:46:19,732 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-10-14 21:46:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 21:46:19,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:19,733 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:19,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:19,951 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:19,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:19,951 INFO L82 PathProgramCache]: Analyzing trace with hash 598752024, now seen corresponding path program 2 times [2019-10-14 21:46:19,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:19,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118696146] [2019-10-14 21:46:19,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:19,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:19,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 21:46:20,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118696146] [2019-10-14 21:46:20,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137751091] [2019-10-14 21:46:20,062 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:20,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:46:20,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:20,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:46:20,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 21:46:20,139 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:20,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-14 21:46:20,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644451755] [2019-10-14 21:46:20,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 21:46:20,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:20,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 21:46:20,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:46:20,141 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 7 states. [2019-10-14 21:46:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:20,196 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-10-14 21:46:20,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:46:20,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-10-14 21:46:20,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:20,199 INFO L225 Difference]: With dead ends: 32 [2019-10-14 21:46:20,199 INFO L226 Difference]: Without dead ends: 23 [2019-10-14 21:46:20,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:46:20,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-14 21:46:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-10-14 21:46:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-14 21:46:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-10-14 21:46:20,204 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2019-10-14 21:46:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:20,205 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-10-14 21:46:20,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 21:46:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-10-14 21:46:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 21:46:20,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:20,206 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:20,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:20,414 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:20,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:20,415 INFO L82 PathProgramCache]: Analyzing trace with hash -786429066, now seen corresponding path program 3 times [2019-10-14 21:46:20,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:20,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392155568] [2019-10-14 21:46:20,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:20,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:20,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 21:46:20,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392155568] [2019-10-14 21:46:20,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999847601] [2019-10-14 21:46:20,514 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:20,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-14 21:46:20,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:20,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-14 21:46:20,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:20,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 21:46:20,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:20,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:46:20,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:46:20,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-14 21:46:20,696 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:46:20,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-10-14 21:46:20,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 21:46:20,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:46:20,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:46:20,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:23 [2019-10-14 21:46:20,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:20,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-14 21:46:20,800 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:20,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-10-14 21:46:20,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279834678] [2019-10-14 21:46:20,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 21:46:20,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:20,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 21:46:20,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-10-14 21:46:20,805 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2019-10-14 21:46:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:20,948 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-10-14 21:46:20,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 21:46:20,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-10-14 21:46:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:20,950 INFO L225 Difference]: With dead ends: 37 [2019-10-14 21:46:20,950 INFO L226 Difference]: Without dead ends: 27 [2019-10-14 21:46:20,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-10-14 21:46:20,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-14 21:46:20,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-10-14 21:46:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-14 21:46:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-10-14 21:46:20,956 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2019-10-14 21:46:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:20,956 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-10-14 21:46:20,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 21:46:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-10-14 21:46:20,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 21:46:20,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:20,957 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:21,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:21,159 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:21,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:21,160 INFO L82 PathProgramCache]: Analyzing trace with hash -547382633, now seen corresponding path program 4 times [2019-10-14 21:46:21,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:21,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935240391] [2019-10-14 21:46:21,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:21,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:21,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 21:46:21,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935240391] [2019-10-14 21:46:21,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142501727] [2019-10-14 21:46:21,302 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:21,348 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:46:21,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:21,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-14 21:46:21,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 21:46:21,370 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:21,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-10-14 21:46:21,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833614028] [2019-10-14 21:46:21,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 21:46:21,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:21,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 21:46:21,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-14 21:46:21,372 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2019-10-14 21:46:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:21,431 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-10-14 21:46:21,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 21:46:21,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-10-14 21:46:21,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:21,433 INFO L225 Difference]: With dead ends: 40 [2019-10-14 21:46:21,433 INFO L226 Difference]: Without dead ends: 29 [2019-10-14 21:46:21,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-14 21:46:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-14 21:46:21,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-14 21:46:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-14 21:46:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-10-14 21:46:21,442 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2019-10-14 21:46:21,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:21,442 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-10-14 21:46:21,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 21:46:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-10-14 21:46:21,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 21:46:21,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:21,444 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:21,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:21,649 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:21,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:21,650 INFO L82 PathProgramCache]: Analyzing trace with hash -96654219, now seen corresponding path program 5 times [2019-10-14 21:46:21,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:21,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078139398] [2019-10-14 21:46:21,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:21,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:21,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 21:46:21,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078139398] [2019-10-14 21:46:21,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931422979] [2019-10-14 21:46:21,783 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:21,871 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-14 21:46:21,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:21,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-14 21:46:21,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 21:46:21,918 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:21,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-10-14 21:46:21,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178810181] [2019-10-14 21:46:21,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 21:46:21,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:21,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 21:46:21,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-10-14 21:46:21,922 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 10 states. [2019-10-14 21:46:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:21,988 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-10-14 21:46:21,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 21:46:21,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-10-14 21:46:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:21,989 INFO L225 Difference]: With dead ends: 42 [2019-10-14 21:46:21,989 INFO L226 Difference]: Without dead ends: 31 [2019-10-14 21:46:21,990 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-10-14 21:46:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-14 21:46:21,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-14 21:46:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 21:46:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-10-14 21:46:21,995 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2019-10-14 21:46:21,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:21,995 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-10-14 21:46:21,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 21:46:21,995 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-10-14 21:46:21,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 21:46:21,996 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:21,996 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:22,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:22,204 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:22,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:22,205 INFO L82 PathProgramCache]: Analyzing trace with hash -738345261, now seen corresponding path program 6 times [2019-10-14 21:46:22,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:22,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969430084] [2019-10-14 21:46:22,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:22,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:22,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 21:46:22,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969430084] [2019-10-14 21:46:22,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044667233] [2019-10-14 21:46:22,321 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:22,377 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-14 21:46:22,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:22,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-14 21:46:22,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:22,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 21:46:22,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:22,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:46:22,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:46:22,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-14 21:46:22,543 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:46:22,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 59 [2019-10-14 21:46:22,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:22,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:22,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:22,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:46:22,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:22,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-14 21:46:22,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:237 [2019-10-14 21:46:22,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:22,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-14 21:46:22,696 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:22,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-10-14 21:46:22,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499966955] [2019-10-14 21:46:22,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 21:46:22,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:22,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 21:46:22,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-14 21:46:22,698 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 17 states. [2019-10-14 21:46:22,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:22,912 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-10-14 21:46:22,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 21:46:22,913 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-10-14 21:46:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:22,914 INFO L225 Difference]: With dead ends: 47 [2019-10-14 21:46:22,914 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 21:46:22,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-10-14 21:46:22,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 21:46:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-10-14 21:46:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-14 21:46:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-10-14 21:46:22,924 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2019-10-14 21:46:22,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:22,925 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-10-14 21:46:22,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-14 21:46:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-10-14 21:46:22,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 21:46:22,926 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:22,926 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:23,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:23,131 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:23,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:23,132 INFO L82 PathProgramCache]: Analyzing trace with hash -742544204, now seen corresponding path program 7 times [2019-10-14 21:46:23,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:23,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141494762] [2019-10-14 21:46:23,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:23,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:23,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:46:23,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141494762] [2019-10-14 21:46:23,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824283301] [2019-10-14 21:46:23,301 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:23,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-14 21:46:23,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:46:23,376 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:23,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2019-10-14 21:46:23,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775546885] [2019-10-14 21:46:23,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 21:46:23,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:23,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 21:46:23,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-10-14 21:46:23,378 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 12 states. [2019-10-14 21:46:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:23,449 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-10-14 21:46:23,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 21:46:23,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-10-14 21:46:23,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:23,451 INFO L225 Difference]: With dead ends: 50 [2019-10-14 21:46:23,451 INFO L226 Difference]: Without dead ends: 37 [2019-10-14 21:46:23,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-10-14 21:46:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-14 21:46:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-10-14 21:46:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-14 21:46:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-10-14 21:46:23,464 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2019-10-14 21:46:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:23,464 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-10-14 21:46:23,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 21:46:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-10-14 21:46:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 21:46:23,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:23,466 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:23,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:23,678 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:23,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:23,679 INFO L82 PathProgramCache]: Analyzing trace with hash 399671442, now seen corresponding path program 8 times [2019-10-14 21:46:23,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:23,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113355947] [2019-10-14 21:46:23,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:23,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:23,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:46:23,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113355947] [2019-10-14 21:46:23,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586515032] [2019-10-14 21:46:23,789 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:23,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:46:23,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:23,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-14 21:46:23,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:46:23,876 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:23,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-10-14 21:46:23,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084175236] [2019-10-14 21:46:23,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 21:46:23,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:23,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 21:46:23,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-14 21:46:23,878 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 13 states. [2019-10-14 21:46:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:23,944 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-10-14 21:46:23,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 21:46:23,944 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2019-10-14 21:46:23,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:23,945 INFO L225 Difference]: With dead ends: 52 [2019-10-14 21:46:23,945 INFO L226 Difference]: Without dead ends: 39 [2019-10-14 21:46:23,946 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-14 21:46:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-14 21:46:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-10-14 21:46:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-14 21:46:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-10-14 21:46:23,951 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 35 [2019-10-14 21:46:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:23,952 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-10-14 21:46:23,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 21:46:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-10-14 21:46:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-14 21:46:23,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:23,953 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:24,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:24,160 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:24,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:24,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1442720528, now seen corresponding path program 9 times [2019-10-14 21:46:24,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:24,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500319931] [2019-10-14 21:46:24,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:24,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:24,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:46:24,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500319931] [2019-10-14 21:46:24,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41480752] [2019-10-14 21:46:24,289 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:24,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 21:46:24,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:24,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-14 21:46:24,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:24,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 21:46:24,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:24,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:46:24,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:46:24,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-14 21:46:24,603 INFO L341 Elim1Store]: treesize reduction 10, result has 87.3 percent of original size [2019-10-14 21:46:24,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 83 [2019-10-14 21:46:24,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:24,699 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.9 percent of original size [2019-10-14 21:46:24,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:46:24,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:91 [2019-10-14 21:46:24,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-14 21:46:24,857 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:24,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-10-14 21:46:24,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075661345] [2019-10-14 21:46:24,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 21:46:24,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:24,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 21:46:24,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-10-14 21:46:24,859 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 22 states. [2019-10-14 21:46:25,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:25,158 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-10-14 21:46:25,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-14 21:46:25,159 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-10-14 21:46:25,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:25,160 INFO L225 Difference]: With dead ends: 57 [2019-10-14 21:46:25,160 INFO L226 Difference]: Without dead ends: 43 [2019-10-14 21:46:25,161 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-10-14 21:46:25,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-14 21:46:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-10-14 21:46:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-14 21:46:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-10-14 21:46:25,166 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 37 [2019-10-14 21:46:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:25,166 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-10-14 21:46:25,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 21:46:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-10-14 21:46:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-14 21:46:25,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:25,167 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:25,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:25,371 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:25,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:25,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1202556527, now seen corresponding path program 10 times [2019-10-14 21:46:25,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:25,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602678382] [2019-10-14 21:46:25,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:25,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:25,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-14 21:46:25,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602678382] [2019-10-14 21:46:25,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254964013] [2019-10-14 21:46:25,508 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:25,584 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:46:25,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:25,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-14 21:46:25,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-14 21:46:25,622 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:25,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2019-10-14 21:46:25,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280152085] [2019-10-14 21:46:25,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 21:46:25,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:25,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 21:46:25,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-10-14 21:46:25,627 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 15 states. [2019-10-14 21:46:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:25,712 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-10-14 21:46:25,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 21:46:25,712 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2019-10-14 21:46:25,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:25,713 INFO L225 Difference]: With dead ends: 60 [2019-10-14 21:46:25,714 INFO L226 Difference]: Without dead ends: 45 [2019-10-14 21:46:25,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-10-14 21:46:25,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-14 21:46:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-14 21:46:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-14 21:46:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-10-14 21:46:25,728 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 41 [2019-10-14 21:46:25,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:25,729 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-10-14 21:46:25,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 21:46:25,730 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-10-14 21:46:25,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-14 21:46:25,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:25,732 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:25,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:25,945 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:25,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:25,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1556314257, now seen corresponding path program 11 times [2019-10-14 21:46:25,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:25,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518942514] [2019-10-14 21:46:25,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:25,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:25,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-14 21:46:26,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518942514] [2019-10-14 21:46:26,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676470200] [2019-10-14 21:46:26,137 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:26,224 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-14 21:46:26,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:26,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-14 21:46:26,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-14 21:46:26,253 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:26,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2019-10-14 21:46:26,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281930091] [2019-10-14 21:46:26,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 21:46:26,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:26,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 21:46:26,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-10-14 21:46:26,255 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2019-10-14 21:46:26,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:26,322 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-10-14 21:46:26,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 21:46:26,322 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-10-14 21:46:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:26,323 INFO L225 Difference]: With dead ends: 62 [2019-10-14 21:46:26,323 INFO L226 Difference]: Without dead ends: 47 [2019-10-14 21:46:26,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-10-14 21:46:26,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-14 21:46:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-10-14 21:46:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-14 21:46:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-10-14 21:46:26,329 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 43 [2019-10-14 21:46:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:26,329 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-10-14 21:46:26,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 21:46:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-10-14 21:46:26,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-14 21:46:26,330 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:26,331 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:26,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:26,535 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:26,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:26,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2079890893, now seen corresponding path program 12 times [2019-10-14 21:46:26,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:26,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360027730] [2019-10-14 21:46:26,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:26,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:26,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-14 21:46:26,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360027730] [2019-10-14 21:46:26,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323706646] [2019-10-14 21:46:26,677 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:26,759 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-14 21:46:26,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:26,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-14 21:46:26,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:26,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 21:46:26,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:26,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:46:26,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:46:26,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-14 21:46:28,206 INFO L341 Elim1Store]: treesize reduction 17, result has 88.6 percent of original size [2019-10-14 21:46:28,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 150 [2019-10-14 21:46:28,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:28,444 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2019-10-14 21:46:28,444 INFO L567 ElimStorePlain]: treesize reduction 523, result has 16.3 percent of original size [2019-10-14 21:46:28,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 1 xjuncts. [2019-10-14 21:46:28,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:545 [2019-10-14 21:46:28,639 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 30 [2019-10-14 21:46:28,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:28,703 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-14 21:46:28,703 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:28,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 27 [2019-10-14 21:46:28,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123311456] [2019-10-14 21:46:28,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-14 21:46:28,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:28,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-14 21:46:28,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=550, Unknown=3, NotChecked=0, Total=702 [2019-10-14 21:46:28,705 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 27 states. [2019-10-14 21:46:31,314 WARN L191 SmtUtils]: Spent 810.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-10-14 21:46:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:33,561 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-10-14 21:46:33,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-14 21:46:33,562 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2019-10-14 21:46:33,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:33,563 INFO L225 Difference]: With dead ends: 67 [2019-10-14 21:46:33,563 INFO L226 Difference]: Without dead ends: 51 [2019-10-14 21:46:33,564 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=195, Invalid=855, Unknown=6, NotChecked=0, Total=1056 [2019-10-14 21:46:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-14 21:46:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-10-14 21:46:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-14 21:46:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-10-14 21:46:33,570 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 45 [2019-10-14 21:46:33,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:33,570 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-10-14 21:46:33,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-14 21:46:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-10-14 21:46:33,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-14 21:46:33,571 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:33,571 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:33,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:33,772 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:33,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1240057554, now seen corresponding path program 13 times [2019-10-14 21:46:33,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:33,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233093933] [2019-10-14 21:46:33,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:33,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:33,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-14 21:46:33,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233093933] [2019-10-14 21:46:33,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797935702] [2019-10-14 21:46:33,966 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:34,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-14 21:46:34,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-14 21:46:34,052 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:34,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 18 [2019-10-14 21:46:34,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79781676] [2019-10-14 21:46:34,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 21:46:34,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:34,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 21:46:34,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-10-14 21:46:34,056 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 18 states. [2019-10-14 21:46:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:34,133 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-10-14 21:46:34,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 21:46:34,133 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2019-10-14 21:46:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:34,134 INFO L225 Difference]: With dead ends: 70 [2019-10-14 21:46:34,134 INFO L226 Difference]: Without dead ends: 53 [2019-10-14 21:46:34,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-10-14 21:46:34,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-14 21:46:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-10-14 21:46:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-14 21:46:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-10-14 21:46:34,141 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 49 [2019-10-14 21:46:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:34,142 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-10-14 21:46:34,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 21:46:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-10-14 21:46:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-14 21:46:34,142 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:34,143 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:34,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:34,347 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:34,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:34,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1198756108, now seen corresponding path program 14 times [2019-10-14 21:46:34,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:34,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63105636] [2019-10-14 21:46:34,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:34,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:34,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-14 21:46:34,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63105636] [2019-10-14 21:46:34,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972413533] [2019-10-14 21:46:34,508 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:34,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:46:34,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:34,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-14 21:46:34,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-14 21:46:34,582 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:34,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 19 [2019-10-14 21:46:34,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969546951] [2019-10-14 21:46:34,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 21:46:34,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:34,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 21:46:34,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-10-14 21:46:34,588 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 19 states. [2019-10-14 21:46:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:34,652 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-10-14 21:46:34,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 21:46:34,653 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2019-10-14 21:46:34,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:34,653 INFO L225 Difference]: With dead ends: 72 [2019-10-14 21:46:34,653 INFO L226 Difference]: Without dead ends: 55 [2019-10-14 21:46:34,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-10-14 21:46:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-14 21:46:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-10-14 21:46:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-14 21:46:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-10-14 21:46:34,659 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 51 [2019-10-14 21:46:34,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:34,660 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-10-14 21:46:34,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 21:46:34,660 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-10-14 21:46:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-14 21:46:34,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:34,661 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:34,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:34,861 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:34,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:34,862 INFO L82 PathProgramCache]: Analyzing trace with hash -153458326, now seen corresponding path program 15 times [2019-10-14 21:46:34,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:34,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742845828] [2019-10-14 21:46:34,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:34,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:34,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-14 21:46:35,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742845828] [2019-10-14 21:46:35,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178867743] [2019-10-14 21:46:35,047 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:35,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-14 21:46:35,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:35,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-14 21:46:35,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:35,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 21:46:35,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:35,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:46:35,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:46:35,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-14 21:46:35,615 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-10-14 21:46:35,615 INFO L341 Elim1Store]: treesize reduction 62, result has 71.9 percent of original size [2019-10-14 21:46:35,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 67 treesize of output 181 [2019-10-14 21:46:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:35,878 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 32 [2019-10-14 21:46:35,879 INFO L567 ElimStorePlain]: treesize reduction 1251, result has 5.2 percent of original size [2019-10-14 21:46:35,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:46:35,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:67 [2019-10-14 21:46:35,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:35,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-14 21:46:36,054 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:36,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2019-10-14 21:46:36,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028254722] [2019-10-14 21:46:36,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-14 21:46:36,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:36,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-14 21:46:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2019-10-14 21:46:36,056 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 32 states. [2019-10-14 21:46:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:36,564 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2019-10-14 21:46:36,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-14 21:46:36,564 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 53 [2019-10-14 21:46:36,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:36,565 INFO L225 Difference]: With dead ends: 77 [2019-10-14 21:46:36,565 INFO L226 Difference]: Without dead ends: 59 [2019-10-14 21:46:36,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2019-10-14 21:46:36,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-14 21:46:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-10-14 21:46:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-14 21:46:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-10-14 21:46:36,572 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2019-10-14 21:46:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:36,572 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-10-14 21:46:36,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-14 21:46:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-10-14 21:46:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-14 21:46:36,573 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:36,573 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:36,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:36,778 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:36,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:36,778 INFO L82 PathProgramCache]: Analyzing trace with hash 523064203, now seen corresponding path program 16 times [2019-10-14 21:46:36,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:36,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359519181] [2019-10-14 21:46:36,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:36,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:36,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-14 21:46:36,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359519181] [2019-10-14 21:46:36,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361277145] [2019-10-14 21:46:36,963 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:37,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:46:37,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:37,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-14 21:46:37,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-14 21:46:37,039 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:37,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 21 [2019-10-14 21:46:37,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603916067] [2019-10-14 21:46:37,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 21:46:37,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:37,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 21:46:37,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-10-14 21:46:37,041 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 21 states. [2019-10-14 21:46:37,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:37,140 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2019-10-14 21:46:37,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 21:46:37,141 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-10-14 21:46:37,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:37,142 INFO L225 Difference]: With dead ends: 80 [2019-10-14 21:46:37,142 INFO L226 Difference]: Without dead ends: 61 [2019-10-14 21:46:37,143 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-10-14 21:46:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-14 21:46:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-14 21:46:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-14 21:46:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-10-14 21:46:37,149 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2019-10-14 21:46:37,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:37,149 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-10-14 21:46:37,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 21:46:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-10-14 21:46:37,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-14 21:46:37,150 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:37,150 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:37,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:37,354 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:37,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:37,354 INFO L82 PathProgramCache]: Analyzing trace with hash -660869783, now seen corresponding path program 17 times [2019-10-14 21:46:37,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:37,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058562689] [2019-10-14 21:46:37,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:37,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:37,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-14 21:46:37,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058562689] [2019-10-14 21:46:37,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429733183] [2019-10-14 21:46:37,575 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:37,767 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-10-14 21:46:37,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:37,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-14 21:46:37,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-14 21:46:37,797 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:37,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 22 [2019-10-14 21:46:37,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472023093] [2019-10-14 21:46:37,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 21:46:37,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:37,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 21:46:37,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2019-10-14 21:46:37,799 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 22 states. [2019-10-14 21:46:37,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:37,890 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-10-14 21:46:37,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-14 21:46:37,891 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2019-10-14 21:46:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:37,892 INFO L225 Difference]: With dead ends: 82 [2019-10-14 21:46:37,892 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 21:46:37,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2019-10-14 21:46:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 21:46:37,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-10-14 21:46:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-14 21:46:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-10-14 21:46:37,907 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 59 [2019-10-14 21:46:37,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:37,907 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-10-14 21:46:37,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 21:46:37,907 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-10-14 21:46:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-14 21:46:37,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:37,908 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:38,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:38,110 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:38,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:38,111 INFO L82 PathProgramCache]: Analyzing trace with hash -255096889, now seen corresponding path program 18 times [2019-10-14 21:46:38,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:38,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723442987] [2019-10-14 21:46:38,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:38,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:38,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-14 21:46:38,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723442987] [2019-10-14 21:46:38,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436554551] [2019-10-14 21:46:38,351 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:38,605 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-14 21:46:38,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:38,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-14 21:46:38,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:38,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 21:46:38,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:38,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:46:38,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:46:38,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-14 21:46:39,293 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-10-14 21:46:39,293 INFO L341 Elim1Store]: treesize reduction 112, result has 57.7 percent of original size [2019-10-14 21:46:39,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 71 treesize of output 179 [2019-10-14 21:46:39,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:39,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:39,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:39,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:39,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:39,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:39,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:39,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:39,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:39,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:39,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:39,372 INFO L567 ElimStorePlain]: treesize reduction 135, result has 34.5 percent of original size [2019-10-14 21:46:39,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:39,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:46:39,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:71 [2019-10-14 21:46:39,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:39,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:39,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 35 proven. 42 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-10-14 21:46:39,656 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:39,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2019-10-14 21:46:39,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83082977] [2019-10-14 21:46:39,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-14 21:46:39,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:39,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-14 21:46:39,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1179, Unknown=0, NotChecked=0, Total=1482 [2019-10-14 21:46:39,659 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 39 states. [2019-10-14 21:46:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:40,674 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2019-10-14 21:46:40,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-14 21:46:40,674 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61 [2019-10-14 21:46:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:40,675 INFO L225 Difference]: With dead ends: 88 [2019-10-14 21:46:40,676 INFO L226 Difference]: Without dead ends: 68 [2019-10-14 21:46:40,677 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=405, Invalid=2457, Unknown=0, NotChecked=0, Total=2862 [2019-10-14 21:46:40,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-14 21:46:40,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-14 21:46:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-14 21:46:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-10-14 21:46:40,683 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 61 [2019-10-14 21:46:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:40,683 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-10-14 21:46:40,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-14 21:46:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-10-14 21:46:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-14 21:46:40,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:40,684 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:40,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:40,888 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:40,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:40,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1190794106, now seen corresponding path program 19 times [2019-10-14 21:46:40,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:40,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450513078] [2019-10-14 21:46:40,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:40,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:40,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-14 21:46:41,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450513078] [2019-10-14 21:46:41,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422660827] [2019-10-14 21:46:41,206 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:41,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-14 21:46:41,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-14 21:46:41,313 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:41,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 25 [2019-10-14 21:46:41,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281260728] [2019-10-14 21:46:41,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-14 21:46:41,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:41,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-14 21:46:41,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-10-14 21:46:41,315 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 25 states. [2019-10-14 21:46:41,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:41,430 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2019-10-14 21:46:41,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-14 21:46:41,430 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2019-10-14 21:46:41,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:41,431 INFO L225 Difference]: With dead ends: 92 [2019-10-14 21:46:41,431 INFO L226 Difference]: Without dead ends: 71 [2019-10-14 21:46:41,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-10-14 21:46:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-14 21:46:41,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-10-14 21:46:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-14 21:46:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-10-14 21:46:41,437 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 67 [2019-10-14 21:46:41,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:41,437 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-10-14 21:46:41,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-14 21:46:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-10-14 21:46:41,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-14 21:46:41,438 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:41,438 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:41,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:41,642 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:41,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:41,643 INFO L82 PathProgramCache]: Analyzing trace with hash -837007132, now seen corresponding path program 20 times [2019-10-14 21:46:41,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:41,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615907907] [2019-10-14 21:46:41,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:41,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:41,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-14 21:46:41,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615907907] [2019-10-14 21:46:41,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000081998] [2019-10-14 21:46:41,966 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:42,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:46:42,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:42,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-14 21:46:42,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-14 21:46:42,059 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:42,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 26 [2019-10-14 21:46:42,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598325872] [2019-10-14 21:46:42,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-14 21:46:42,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:42,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-14 21:46:42,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2019-10-14 21:46:42,063 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 26 states. [2019-10-14 21:46:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:42,193 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2019-10-14 21:46:42,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-14 21:46:42,193 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2019-10-14 21:46:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:42,194 INFO L225 Difference]: With dead ends: 94 [2019-10-14 21:46:42,194 INFO L226 Difference]: Without dead ends: 73 [2019-10-14 21:46:42,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2019-10-14 21:46:42,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-14 21:46:42,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-10-14 21:46:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-14 21:46:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-10-14 21:46:42,199 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2019-10-14 21:46:42,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:42,200 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-10-14 21:46:42,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-14 21:46:42,200 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-10-14 21:46:42,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-14 21:46:42,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:42,201 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:42,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:42,405 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:42,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:42,406 INFO L82 PathProgramCache]: Analyzing trace with hash -150141502, now seen corresponding path program 21 times [2019-10-14 21:46:42,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:42,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632800774] [2019-10-14 21:46:42,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:42,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:42,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:42,757 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-14 21:46:42,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632800774] [2019-10-14 21:46:42,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806490858] [2019-10-14 21:46:42,758 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:42,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-14 21:46:42,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:42,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-14 21:46:42,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:42,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 21:46:42,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:42,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:46:42,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:46:42,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-14 21:46:43,791 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 78 [2019-10-14 21:46:43,791 INFO L341 Elim1Store]: treesize reduction 170, result has 51.6 percent of original size [2019-10-14 21:46:43,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 81 treesize of output 211 [2019-10-14 21:46:43,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:43,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:43,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:43,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:43,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:43,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:43,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:43,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:43,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:43,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:43,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:43,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:43,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:43,890 INFO L567 ElimStorePlain]: treesize reduction 150, result has 35.1 percent of original size [2019-10-14 21:46:43,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:43,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:46:43,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:87, output treesize:81 [2019-10-14 21:46:43,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:43,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:44,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-10-14 21:46:44,365 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:44,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 43 [2019-10-14 21:46:44,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311389108] [2019-10-14 21:46:44,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-14 21:46:44,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:44,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-14 21:46:44,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1449, Unknown=0, NotChecked=0, Total=1806 [2019-10-14 21:46:44,367 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 43 states. [2019-10-14 21:46:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:45,430 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2019-10-14 21:46:45,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-14 21:46:45,430 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 71 [2019-10-14 21:46:45,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:45,431 INFO L225 Difference]: With dead ends: 99 [2019-10-14 21:46:45,431 INFO L226 Difference]: Without dead ends: 77 [2019-10-14 21:46:45,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=367, Invalid=1613, Unknown=0, NotChecked=0, Total=1980 [2019-10-14 21:46:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-14 21:46:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-10-14 21:46:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-14 21:46:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-10-14 21:46:45,438 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2019-10-14 21:46:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:45,438 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-10-14 21:46:45,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-14 21:46:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-10-14 21:46:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-14 21:46:45,439 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:45,439 INFO L380 BasicCegarLoop]: trace histogram [23, 23, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:45,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:45,644 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:45,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:45,644 INFO L82 PathProgramCache]: Analyzing trace with hash -30548381, now seen corresponding path program 22 times [2019-10-14 21:46:45,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:45,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334480530] [2019-10-14 21:46:45,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:45,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:45,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-14 21:46:46,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334480530] [2019-10-14 21:46:46,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714123216] [2019-10-14 21:46:46,000 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:46,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:46:46,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:46,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-14 21:46:46,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-14 21:46:46,132 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:46,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 28 [2019-10-14 21:46:46,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942738363] [2019-10-14 21:46:46,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-14 21:46:46,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:46,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-14 21:46:46,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2019-10-14 21:46:46,134 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 28 states. [2019-10-14 21:46:46,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:46,262 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-10-14 21:46:46,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-14 21:46:46,263 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 75 [2019-10-14 21:46:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:46,263 INFO L225 Difference]: With dead ends: 102 [2019-10-14 21:46:46,264 INFO L226 Difference]: Without dead ends: 79 [2019-10-14 21:46:46,264 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2019-10-14 21:46:46,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-14 21:46:46,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-10-14 21:46:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-14 21:46:46,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-10-14 21:46:46,271 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2019-10-14 21:46:46,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:46,271 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-10-14 21:46:46,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-14 21:46:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-10-14 21:46:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-14 21:46:46,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:46,272 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:46,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:46,475 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:46,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:46,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1505166143, now seen corresponding path program 23 times [2019-10-14 21:46:46,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:46,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143464900] [2019-10-14 21:46:46,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:46,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:46,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-14 21:46:46,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143464900] [2019-10-14 21:46:46,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343134628] [2019-10-14 21:46:46,992 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:47,365 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-10-14 21:46:47,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:47,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-14 21:46:47,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-14 21:46:47,384 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:47,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 29 [2019-10-14 21:46:47,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466470754] [2019-10-14 21:46:47,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-14 21:46:47,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:47,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-14 21:46:47,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-10-14 21:46:47,386 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 29 states. [2019-10-14 21:46:47,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:47,538 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2019-10-14 21:46:47,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-14 21:46:47,538 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 77 [2019-10-14 21:46:47,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:47,539 INFO L225 Difference]: With dead ends: 104 [2019-10-14 21:46:47,539 INFO L226 Difference]: Without dead ends: 81 [2019-10-14 21:46:47,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-10-14 21:46:47,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-14 21:46:47,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-10-14 21:46:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-14 21:46:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-10-14 21:46:47,547 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 77 [2019-10-14 21:46:47,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:47,547 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-10-14 21:46:47,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-14 21:46:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-10-14 21:46:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-14 21:46:47,548 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:47,548 INFO L380 BasicCegarLoop]: trace histogram [25, 25, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:47,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:47,749 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:47,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:47,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1273627745, now seen corresponding path program 24 times [2019-10-14 21:46:47,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:47,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218131015] [2019-10-14 21:46:47,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:47,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:47,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-14 21:46:48,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218131015] [2019-10-14 21:46:48,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859719046] [2019-10-14 21:46:48,095 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:48,680 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-10-14 21:46:48,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:48,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-14 21:46:48,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:48,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 21:46:48,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:48,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:46:48,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:46:48,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-14 21:46:49,843 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 89 [2019-10-14 21:46:49,844 INFO L341 Elim1Store]: treesize reduction 240, result has 46.5 percent of original size [2019-10-14 21:46:49,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 91 treesize of output 243 [2019-10-14 21:46:49,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:49,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:49,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:49,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:49,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:49,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:49,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:49,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:49,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:49,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:49,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:49,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:49,936 INFO L567 ElimStorePlain]: treesize reduction 149, result has 37.9 percent of original size [2019-10-14 21:46:49,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:49,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:46:49,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:97, output treesize:91 [2019-10-14 21:46:49,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:50,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:50,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-10-14 21:46:50,545 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:50,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21] total 48 [2019-10-14 21:46:50,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607917634] [2019-10-14 21:46:50,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-14 21:46:50,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:50,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-14 21:46:50,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1814, Unknown=0, NotChecked=0, Total=2256 [2019-10-14 21:46:50,548 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 48 states. [2019-10-14 21:46:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:51,569 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-10-14 21:46:51,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-14 21:46:51,569 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 79 [2019-10-14 21:46:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:51,570 INFO L225 Difference]: With dead ends: 109 [2019-10-14 21:46:51,570 INFO L226 Difference]: Without dead ends: 85 [2019-10-14 21:46:51,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=452, Invalid=1998, Unknown=0, NotChecked=0, Total=2450 [2019-10-14 21:46:51,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-14 21:46:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-10-14 21:46:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-14 21:46:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-10-14 21:46:51,576 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 79 [2019-10-14 21:46:51,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:51,576 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-10-14 21:46:51,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-14 21:46:51,576 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-10-14 21:46:51,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-14 21:46:51,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:51,577 INFO L380 BasicCegarLoop]: trace histogram [26, 26, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:51,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:51,787 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:51,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:51,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1438388992, now seen corresponding path program 25 times [2019-10-14 21:46:51,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:51,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706478725] [2019-10-14 21:46:51,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:51,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:51,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-14 21:46:52,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706478725] [2019-10-14 21:46:52,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448916373] [2019-10-14 21:46:52,146 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:52,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-14 21:46:52,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-14 21:46:52,297 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:52,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 31 [2019-10-14 21:46:52,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845686177] [2019-10-14 21:46:52,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-14 21:46:52,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:52,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-14 21:46:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-10-14 21:46:52,299 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 31 states. [2019-10-14 21:46:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:52,433 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2019-10-14 21:46:52,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-14 21:46:52,434 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 83 [2019-10-14 21:46:52,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:52,435 INFO L225 Difference]: With dead ends: 112 [2019-10-14 21:46:52,435 INFO L226 Difference]: Without dead ends: 87 [2019-10-14 21:46:52,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-10-14 21:46:52,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-14 21:46:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-10-14 21:46:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-14 21:46:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-10-14 21:46:52,441 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 83 [2019-10-14 21:46:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:52,441 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-10-14 21:46:52,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-14 21:46:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-10-14 21:46:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-14 21:46:52,442 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:52,442 INFO L380 BasicCegarLoop]: trace histogram [27, 27, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:52,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:52,646 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:52,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:52,646 INFO L82 PathProgramCache]: Analyzing trace with hash 687469406, now seen corresponding path program 26 times [2019-10-14 21:46:52,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:52,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744591627] [2019-10-14 21:46:52,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:52,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:52,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:53,058 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-14 21:46:53,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744591627] [2019-10-14 21:46:53,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035987280] [2019-10-14 21:46:53,059 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:53,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:46:53,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:53,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-14 21:46:53,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-14 21:46:53,223 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:53,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 32 [2019-10-14 21:46:53,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348861167] [2019-10-14 21:46:53,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-14 21:46:53,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:53,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-14 21:46:53,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2019-10-14 21:46:53,224 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 32 states. [2019-10-14 21:46:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:53,360 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-10-14 21:46:53,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-14 21:46:53,361 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 85 [2019-10-14 21:46:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:53,362 INFO L225 Difference]: With dead ends: 114 [2019-10-14 21:46:53,362 INFO L226 Difference]: Without dead ends: 89 [2019-10-14 21:46:53,363 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2019-10-14 21:46:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-14 21:46:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-10-14 21:46:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-14 21:46:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-10-14 21:46:53,367 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 85 [2019-10-14 21:46:53,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:53,367 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-10-14 21:46:53,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-14 21:46:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-10-14 21:46:53,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-14 21:46:53,368 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:53,368 INFO L380 BasicCegarLoop]: trace histogram [28, 28, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:53,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:53,572 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:53,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:53,572 INFO L82 PathProgramCache]: Analyzing trace with hash 608252988, now seen corresponding path program 27 times [2019-10-14 21:46:53,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:53,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772284055] [2019-10-14 21:46:53,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:53,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:53,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-14 21:46:54,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772284055] [2019-10-14 21:46:54,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093691789] [2019-10-14 21:46:54,102 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:54,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-14 21:46:54,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:54,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-14 21:46:54,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:54,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 21:46:54,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:54,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:46:54,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:46:54,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-10-14 21:46:55,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:46:55,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:46:55,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:46:55,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:46:55,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:46:55,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:46:55,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:46:55,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:46:55,444 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:46:55,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 83 treesize of output 131 [2019-10-14 21:46:55,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:55,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:55,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:55,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:55,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:55,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:55,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:55,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:55,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:46:55,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:46:55,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:46:55,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:89, output treesize:67 [2019-10-14 21:46:55,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:55,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:46:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-10-14 21:46:56,665 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:56,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 26] total 56 [2019-10-14 21:46:56,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587606392] [2019-10-14 21:46:56,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-14 21:46:56,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:56,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-14 21:46:56,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=2463, Unknown=0, NotChecked=0, Total=3080 [2019-10-14 21:46:56,667 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 56 states. [2019-10-14 21:46:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:58,474 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2019-10-14 21:46:58,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-14 21:46:58,474 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 87 [2019-10-14 21:46:58,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:58,475 INFO L225 Difference]: With dead ends: 119 [2019-10-14 21:46:58,475 INFO L226 Difference]: Without dead ends: 93 [2019-10-14 21:46:58,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1499, Invalid=5811, Unknown=0, NotChecked=0, Total=7310 [2019-10-14 21:46:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-14 21:46:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-10-14 21:46:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-14 21:46:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-10-14 21:46:58,484 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2019-10-14 21:46:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:58,484 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-10-14 21:46:58,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-14 21:46:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-10-14 21:46:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-14 21:46:58,485 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:58,485 INFO L380 BasicCegarLoop]: trace histogram [29, 29, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:58,685 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:58,686 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:58,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:58,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1434133923, now seen corresponding path program 28 times [2019-10-14 21:46:58,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:58,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233733125] [2019-10-14 21:46:58,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:58,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:58,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:46:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-14 21:46:59,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233733125] [2019-10-14 21:46:59,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484732842] [2019-10-14 21:46:59,215 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:59,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:46:59,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:46:59,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-14 21:46:59,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:46:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-14 21:46:59,420 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:46:59,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 34 [2019-10-14 21:46:59,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850044624] [2019-10-14 21:46:59,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-14 21:46:59,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:46:59,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-14 21:46:59,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2019-10-14 21:46:59,422 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 34 states. [2019-10-14 21:46:59,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:46:59,566 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2019-10-14 21:46:59,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-14 21:46:59,567 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 91 [2019-10-14 21:46:59,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:46:59,568 INFO L225 Difference]: With dead ends: 122 [2019-10-14 21:46:59,568 INFO L226 Difference]: Without dead ends: 95 [2019-10-14 21:46:59,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2019-10-14 21:46:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-14 21:46:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-10-14 21:46:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-14 21:46:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-10-14 21:46:59,574 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 91 [2019-10-14 21:46:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:46:59,574 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-10-14 21:46:59,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-14 21:46:59,575 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-10-14 21:46:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-14 21:46:59,575 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:46:59,575 INFO L380 BasicCegarLoop]: trace histogram [30, 30, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:46:59,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:46:59,780 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:46:59,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:46:59,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1124302011, now seen corresponding path program 29 times [2019-10-14 21:46:59,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:46:59,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034938302] [2019-10-14 21:46:59,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:59,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:46:59,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:46:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:47:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:47:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-14 21:47:00,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034938302] [2019-10-14 21:47:00,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811401931] [2019-10-14 21:47:00,519 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:47:01,169 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-10-14 21:47:01,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:47:01,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-14 21:47:01,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:47:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-14 21:47:01,192 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:47:01,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 35 [2019-10-14 21:47:01,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703609564] [2019-10-14 21:47:01,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-14 21:47:01,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:47:01,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-14 21:47:01,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-10-14 21:47:01,193 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 35 states. [2019-10-14 21:47:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:47:01,358 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2019-10-14 21:47:01,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-14 21:47:01,358 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 93 [2019-10-14 21:47:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:47:01,359 INFO L225 Difference]: With dead ends: 124 [2019-10-14 21:47:01,359 INFO L226 Difference]: Without dead ends: 97 [2019-10-14 21:47:01,360 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-10-14 21:47:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-14 21:47:01,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-10-14 21:47:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-14 21:47:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-10-14 21:47:01,366 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2019-10-14 21:47:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:47:01,366 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-10-14 21:47:01,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-14 21:47:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-10-14 21:47:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-14 21:47:01,367 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:47:01,367 INFO L380 BasicCegarLoop]: trace histogram [31, 31, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:47:01,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:47:01,572 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:47:01,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:47:01,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1235026023, now seen corresponding path program 30 times [2019-10-14 21:47:01,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:47:01,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096085635] [2019-10-14 21:47:01,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:47:01,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:47:01,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:47:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat