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-tiling/rewnifrev.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:50:37,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:50:37,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:50:37,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:50:37,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:50:37,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:50:37,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:50:37,093 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:50:37,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:50:37,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:50:37,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:50:37,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:50:37,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:50:37,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:50:37,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:50:37,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:50:37,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:50:37,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:50:37,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:50:37,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:50:37,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:50:37,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:50:37,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:50:37,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:50:37,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:50:37,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:50:37,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:50:37,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:50:37,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:50:37,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:50:37,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:50:37,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:50:37,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:50:37,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:50:37,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:50:37,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:50:37,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:50:37,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:50:37,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:50:37,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:50:37,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:50:37,143 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:50:37,157 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:50:37,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:50:37,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:50:37,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:50:37,158 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:50:37,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:50:37,159 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:50:37,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:50:37,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:50:37,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:50:37,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:50:37,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:50:37,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:50:37,160 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:50:37,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:50:37,160 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:50:37,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:50:37,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:50:37,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:50:37,161 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:50:37,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:50:37,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:50:37,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:50:37,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:50:37,162 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:50:37,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:50:37,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:50:37,163 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:50:37,163 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:50:37,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:50:37,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:50:37,463 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:50:37,465 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:50:37,465 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:50:37,466 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewnifrev.c [2019-10-14 21:50:37,521 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8567386/2800330c88cc44688dda9c432bf09867/FLAG8490cfc4a [2019-10-14 21:50:37,915 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:50:37,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewnifrev.c [2019-10-14 21:50:37,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8567386/2800330c88cc44688dda9c432bf09867/FLAG8490cfc4a [2019-10-14 21:50:38,282 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8567386/2800330c88cc44688dda9c432bf09867 [2019-10-14 21:50:38,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:50:38,291 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:50:38,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:38,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:50:38,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:50:38,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:38" (1/1) ... [2019-10-14 21:50:38,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54268d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:38, skipping insertion in model container [2019-10-14 21:50:38,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:38" (1/1) ... [2019-10-14 21:50:38,307 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:50:38,330 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:50:38,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:38,507 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:50:38,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:38,536 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:50:38,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:38 WrapperNode [2019-10-14 21:50:38,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:38,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:50:38,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:50:38,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:50:38,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:38" (1/1) ... [2019-10-14 21:50:38,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:38" (1/1) ... [2019-10-14 21:50:38,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:38" (1/1) ... [2019-10-14 21:50:38,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:38" (1/1) ... [2019-10-14 21:50:38,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:38" (1/1) ... [2019-10-14 21:50:38,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:38" (1/1) ... [2019-10-14 21:50:38,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:38" (1/1) ... [2019-10-14 21:50:38,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:50:38,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:50:38,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:50:38,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:50:38,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:38" (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:50:38,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:50:38,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:50:38,726 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 21:50:38,727 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:50:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:50:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 21:50:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:50:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:50:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 21:50:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:50:38,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 21:50:38,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:50:38,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:50:38,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:50:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:50:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:50:39,020 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:50:39,020 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 21:50:39,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:39 BoogieIcfgContainer [2019-10-14 21:50:39,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:50:39,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:50:39,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:50:39,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:50:39,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:50:38" (1/3) ... [2019-10-14 21:50:39,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d721895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:39, skipping insertion in model container [2019-10-14 21:50:39,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:38" (2/3) ... [2019-10-14 21:50:39,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d721895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:39, skipping insertion in model container [2019-10-14 21:50:39,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:39" (3/3) ... [2019-10-14 21:50:39,030 INFO L109 eAbstractionObserver]: Analyzing ICFG rewnifrev.c [2019-10-14 21:50:39,039 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:50:39,047 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:50:39,065 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:50:39,093 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:50:39,093 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:50:39,093 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:50:39,093 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:50:39,093 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:50:39,093 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:50:39,093 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:50:39,093 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:50:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-14 21:50:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 21:50:39,113 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:39,114 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:39,116 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:39,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:39,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1294486485, now seen corresponding path program 1 times [2019-10-14 21:50:39,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:39,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21515400] [2019-10-14 21:50:39,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:39,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:39,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,294 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:50:39,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21515400] [2019-10-14 21:50:39,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:39,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 21:50:39,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522090825] [2019-10-14 21:50:39,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 21:50:39,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:39,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 21:50:39,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 21:50:39,317 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-10-14 21:50:39,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:39,418 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-10-14 21:50:39,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 21:50:39,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-14 21:50:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:39,430 INFO L225 Difference]: With dead ends: 43 [2019-10-14 21:50:39,431 INFO L226 Difference]: Without dead ends: 22 [2019-10-14 21:50:39,435 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:50:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-14 21:50:39,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-14 21:50:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-14 21:50:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-14 21:50:39,481 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-10-14 21:50:39,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:39,481 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-14 21:50:39,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 21:50:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-14 21:50:39,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 21:50:39,491 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:39,491 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:39,491 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:39,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1653126776, now seen corresponding path program 1 times [2019-10-14 21:50:39,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:39,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029463600] [2019-10-14 21:50:39,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:39,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:39,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,589 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:50:39,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029463600] [2019-10-14 21:50:39,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:39,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:39,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330724172] [2019-10-14 21:50:39,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:39,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:39,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:39,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:39,597 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 4 states. [2019-10-14 21:50:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:39,691 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-10-14 21:50:39,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:39,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-14 21:50:39,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:39,694 INFO L225 Difference]: With dead ends: 41 [2019-10-14 21:50:39,694 INFO L226 Difference]: Without dead ends: 26 [2019-10-14 21:50:39,696 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:50:39,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-14 21:50:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-10-14 21:50:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-14 21:50:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-14 21:50:39,709 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-14 21:50:39,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:39,710 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-14 21:50:39,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-14 21:50:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 21:50:39,712 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:39,713 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:39,714 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:39,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1007604157, now seen corresponding path program 1 times [2019-10-14 21:50:39,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:39,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522596449] [2019-10-14 21:50:39,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:39,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:39,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:39,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522596449] [2019-10-14 21:50:39,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:39,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:50:39,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673547117] [2019-10-14 21:50:39,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:50:39,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:39,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:50:39,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:39,837 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2019-10-14 21:50:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:39,946 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-10-14 21:50:39,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:50:39,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-14 21:50:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:39,950 INFO L225 Difference]: With dead ends: 42 [2019-10-14 21:50:39,951 INFO L226 Difference]: Without dead ends: 31 [2019-10-14 21:50:39,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-14 21:50:39,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-10-14 21:50:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-14 21:50:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-14 21:50:39,973 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-10-14 21:50:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:39,974 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-14 21:50:39,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:50:39,974 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-14 21:50:39,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:50:39,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:39,976 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:39,976 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:39,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:39,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2051596356, now seen corresponding path program 1 times [2019-10-14 21:50:39,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:39,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771583] [2019-10-14 21:50:39,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:39,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:39,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:50:40,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771583] [2019-10-14 21:50:40,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:40,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-14 21:50:40,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688837038] [2019-10-14 21:50:40,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 21:50:40,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:40,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 21:50:40,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-14 21:50:40,343 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 11 states. [2019-10-14 21:50:40,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:40,621 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-10-14 21:50:40,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 21:50:40,621 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-10-14 21:50:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:40,623 INFO L225 Difference]: With dead ends: 39 [2019-10-14 21:50:40,623 INFO L226 Difference]: Without dead ends: 37 [2019-10-14 21:50:40,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-10-14 21:50:40,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-14 21:50:40,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-10-14 21:50:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 21:50:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-14 21:50:40,632 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2019-10-14 21:50:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:40,633 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-14 21:50:40,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 21:50:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-14 21:50:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 21:50:40,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:40,634 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:40,634 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:40,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:40,635 INFO L82 PathProgramCache]: Analyzing trace with hash -730987952, now seen corresponding path program 1 times [2019-10-14 21:50:40,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:40,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183683523] [2019-10-14 21:50:40,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:40,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:40,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:40,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183683523] [2019-10-14 21:50:40,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147450985] [2019-10-14 21:50:40,944 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:50:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-14 21:50:41,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:41,083 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 19 treesize of output 15 [2019-10-14 21:50:41,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:41,088 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 19 treesize of output 15 [2019-10-14 21:50:41,089 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:41,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:41,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 21:50:41,108 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2019-10-14 21:50:41,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,239 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-10-14 21:50:41,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2019-10-14 21:50:41,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:41,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:41,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:41,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-10-14 21:50:41,538 INFO L341 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2019-10-14 21:50:41,539 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 28 treesize of output 36 [2019-10-14 21:50:41,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 21:50:41,559 INFO L567 ElimStorePlain]: treesize reduction 31, result has 18.4 percent of original size [2019-10-14 21:50:41,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:41,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2019-10-14 21:50:41,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:41,641 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:41,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2019-10-14 21:50:41,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542568745] [2019-10-14 21:50:41,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-14 21:50:41,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:41,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-14 21:50:41,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2019-10-14 21:50:41,646 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 24 states. [2019-10-14 21:50:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:42,361 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-10-14 21:50:42,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 21:50:42,361 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-10-14 21:50:42,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:42,363 INFO L225 Difference]: With dead ends: 48 [2019-10-14 21:50:42,363 INFO L226 Difference]: Without dead ends: 46 [2019-10-14 21:50:42,364 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2019-10-14 21:50:42,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-14 21:50:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2019-10-14 21:50:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-14 21:50:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-14 21:50:42,381 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 30 [2019-10-14 21:50:42,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:42,381 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-14 21:50:42,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-14 21:50:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-14 21:50:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 21:50:42,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:42,384 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:42,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:42,586 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:42,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:42,587 INFO L82 PathProgramCache]: Analyzing trace with hash 783487204, now seen corresponding path program 2 times [2019-10-14 21:50:42,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:42,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467700082] [2019-10-14 21:50:42,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:42,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:42,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:42,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467700082] [2019-10-14 21:50:42,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198476987] [2019-10-14 21:50:42,682 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:50:42,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:42,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:42,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-14 21:50:42,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:42,800 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:42,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-10-14 21:50:42,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915527735] [2019-10-14 21:50:42,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 21:50:42,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:42,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 21:50:42,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-14 21:50:42,802 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 11 states. [2019-10-14 21:50:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:43,021 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2019-10-14 21:50:43,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 21:50:43,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-10-14 21:50:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:43,024 INFO L225 Difference]: With dead ends: 84 [2019-10-14 21:50:43,024 INFO L226 Difference]: Without dead ends: 47 [2019-10-14 21:50:43,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-10-14 21:50:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-14 21:50:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-10-14 21:50:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-14 21:50:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-10-14 21:50:43,033 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 38 [2019-10-14 21:50:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:43,034 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-10-14 21:50:43,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 21:50:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-10-14 21:50:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-14 21:50:43,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:43,035 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:43,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:43,240 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:43,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:43,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1309226143, now seen corresponding path program 3 times [2019-10-14 21:50:43,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:43,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437975820] [2019-10-14 21:50:43,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:43,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:43,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,555 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:43,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437975820] [2019-10-14 21:50:43,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530803226] [2019-10-14 21:50:43,556 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:50:43,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 21:50:43,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:43,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-14 21:50:43,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:43,629 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:50:43,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:43,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:43,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:43,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-14 21:50:43,699 INFO L341 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2019-10-14 21:50:43,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2019-10-14 21:50:43,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:43,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:43,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:43,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-10-14 21:50:43,756 INFO L341 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-10-14 21:50:43,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2019-10-14 21:50:43,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:43,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:43,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:43,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-10-14 21:50:43,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:43,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:43,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:43,970 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:43,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 51 [2019-10-14 21:50:43,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:43,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:43,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:50:43,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:49 [2019-10-14 21:50:44,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:44,529 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:50:44,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:44,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:44,533 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:44,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 20 [2019-10-14 21:50:44,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:44,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:44,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:44,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:7 [2019-10-14 21:50:44,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:50:44,627 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:44,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 32 [2019-10-14 21:50:44,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691100118] [2019-10-14 21:50:44,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-14 21:50:44,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:44,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-14 21:50:44,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2019-10-14 21:50:44,630 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 32 states. [2019-10-14 21:50:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:45,869 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-10-14 21:50:45,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-14 21:50:45,869 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2019-10-14 21:50:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:45,871 INFO L225 Difference]: With dead ends: 60 [2019-10-14 21:50:45,871 INFO L226 Difference]: Without dead ends: 58 [2019-10-14 21:50:45,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=354, Invalid=1998, Unknown=0, NotChecked=0, Total=2352 [2019-10-14 21:50:45,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-14 21:50:45,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2019-10-14 21:50:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 21:50:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-10-14 21:50:45,882 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 42 [2019-10-14 21:50:45,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:45,883 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-10-14 21:50:45,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-14 21:50:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-10-14 21:50:45,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 21:50:45,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:45,885 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:46,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:46,092 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:46,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:46,093 INFO L82 PathProgramCache]: Analyzing trace with hash -65371085, now seen corresponding path program 4 times [2019-10-14 21:50:46,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:46,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139093890] [2019-10-14 21:50:46,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:46,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:46,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:46,197 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:46,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139093890] [2019-10-14 21:50:46,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778743323] [2019-10-14 21:50:46,198 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:50:46,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:50:46,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:46,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-14 21:50:46,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:46,326 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:46,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2019-10-14 21:50:46,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234150467] [2019-10-14 21:50:46,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 21:50:46,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:46,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 21:50:46,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-10-14 21:50:46,328 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 13 states. [2019-10-14 21:50:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:46,582 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2019-10-14 21:50:46,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 21:50:46,582 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2019-10-14 21:50:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:46,583 INFO L225 Difference]: With dead ends: 104 [2019-10-14 21:50:46,583 INFO L226 Difference]: Without dead ends: 59 [2019-10-14 21:50:46,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-14 21:50:46,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-14 21:50:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-10-14 21:50:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-14 21:50:46,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-10-14 21:50:46,594 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 50 [2019-10-14 21:50:46,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:46,594 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-10-14 21:50:46,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 21:50:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-10-14 21:50:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-14 21:50:46,596 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:46,596 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:46,808 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:46,808 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:46,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:46,809 INFO L82 PathProgramCache]: Analyzing trace with hash -301340818, now seen corresponding path program 5 times [2019-10-14 21:50:46,809 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:46,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619984075] [2019-10-14 21:50:46,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:46,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:46,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 16 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:47,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619984075] [2019-10-14 21:50:47,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997969301] [2019-10-14 21:50:47,096 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:50:47,167 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-14 21:50:47,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:47,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-14 21:50:47,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:47,197 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:50:47,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:47,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-14 21:50:47,254 INFO L341 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2019-10-14 21:50:47,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2019-10-14 21:50:47,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:47,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-10-14 21:50:47,330 INFO L341 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-10-14 21:50:47,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2019-10-14 21:50:47,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:47,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-10-14 21:50:47,453 INFO L341 Elim1Store]: treesize reduction 178, result has 16.8 percent of original size [2019-10-14 21:50:47,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 65 [2019-10-14 21:50:47,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:47,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:59 [2019-10-14 21:50:47,572 INFO L341 Elim1Store]: treesize reduction 222, result has 14.3 percent of original size [2019-10-14 21:50:47,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 71 treesize of output 68 [2019-10-14 21:50:47,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:47,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:57 [2019-10-14 21:50:47,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:47,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:47,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:47,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:47,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:47,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:47,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:47,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 68 [2019-10-14 21:50:47,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:47,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:50:47,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:80, output treesize:63 [2019-10-14 21:50:48,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:48,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:48,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:48,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:48,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:48,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:48,765 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:50:48,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:48,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:48,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 25 [2019-10-14 21:50:48,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:48,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:48,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:48,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:7 [2019-10-14 21:50:48,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 35 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 21:50:48,892 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:48,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24] total 37 [2019-10-14 21:50:48,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124399997] [2019-10-14 21:50:48,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-14 21:50:48,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:48,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-14 21:50:48,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1137, Unknown=0, NotChecked=0, Total=1332 [2019-10-14 21:50:48,894 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 37 states. [2019-10-14 21:50:51,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:51,335 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2019-10-14 21:50:51,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-14 21:50:51,336 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 54 [2019-10-14 21:50:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:51,338 INFO L225 Difference]: With dead ends: 124 [2019-10-14 21:50:51,338 INFO L226 Difference]: Without dead ends: 122 [2019-10-14 21:50:51,340 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 38 SyntacticMatches, 11 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=704, Invalid=4698, Unknown=0, NotChecked=0, Total=5402 [2019-10-14 21:50:51,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-14 21:50:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 65. [2019-10-14 21:50:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-14 21:50:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-10-14 21:50:51,352 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 54 [2019-10-14 21:50:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:51,352 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-10-14 21:50:51,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-14 21:50:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-10-14 21:50:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-14 21:50:51,353 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:51,354 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:51,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:51,557 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:51,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:51,558 INFO L82 PathProgramCache]: Analyzing trace with hash 345962498, now seen corresponding path program 6 times [2019-10-14 21:50:51,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:51,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538986529] [2019-10-14 21:50:51,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:51,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:51,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 27 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:51,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538986529] [2019-10-14 21:50:51,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888711915] [2019-10-14 21:50:51,656 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:50:51,717 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-14 21:50:51,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:51,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-14 21:50:51,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:51,803 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:51,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2019-10-14 21:50:51,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869183179] [2019-10-14 21:50:51,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 21:50:51,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:51,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 21:50:51,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-10-14 21:50:51,804 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 15 states. [2019-10-14 21:50:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:52,046 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-10-14 21:50:52,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 21:50:52,046 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2019-10-14 21:50:52,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:52,048 INFO L225 Difference]: With dead ends: 124 [2019-10-14 21:50:52,048 INFO L226 Difference]: Without dead ends: 71 [2019-10-14 21:50:52,049 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-10-14 21:50:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-14 21:50:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-10-14 21:50:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-14 21:50:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-10-14 21:50:52,060 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 62 [2019-10-14 21:50:52,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:52,061 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-10-14 21:50:52,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 21:50:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-10-14 21:50:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-14 21:50:52,062 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:52,062 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:52,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:52,267 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:52,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1002724029, now seen corresponding path program 7 times [2019-10-14 21:50:52,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:52,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727725545] [2019-10-14 21:50:52,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:52,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:52,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 23 proven. 62 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:52,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727725545] [2019-10-14 21:50:52,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232831739] [2019-10-14 21:50:52,854 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:50:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-14 21:50:52,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:52,931 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:50:52,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:52,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-14 21:50:52,979 INFO L341 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2019-10-14 21:50:52,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2019-10-14 21:50:52,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:52,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-10-14 21:50:53,030 INFO L341 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-10-14 21:50:53,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2019-10-14 21:50:53,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:53,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:53,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:53,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-10-14 21:50:53,132 INFO L341 Elim1Store]: treesize reduction 178, result has 16.8 percent of original size [2019-10-14 21:50:53,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 65 [2019-10-14 21:50:53,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:53,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:53,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:53,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2019-10-14 21:50:53,215 INFO L341 Elim1Store]: treesize reduction 222, result has 14.3 percent of original size [2019-10-14 21:50:53,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 71 treesize of output 68 [2019-10-14 21:50:53,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:53,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:53,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:53,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:54 [2019-10-14 21:50:53,351 INFO L341 Elim1Store]: treesize reduction 274, result has 14.9 percent of original size [2019-10-14 21:50:53,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 82 [2019-10-14 21:50:53,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:53,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:53,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:53,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:73 [2019-10-14 21:50:53,470 INFO L341 Elim1Store]: treesize reduction 332, result has 12.9 percent of original size [2019-10-14 21:50:53,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 85 treesize of output 85 [2019-10-14 21:50:53,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:53,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:53,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:53,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:88, output treesize:71 [2019-10-14 21:50:53,826 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-10-14 21:50:53,827 INFO L341 Elim1Store]: treesize reduction 176, result has 58.9 percent of original size [2019-10-14 21:50:53,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 286 [2019-10-14 21:50:53,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:53,921 INFO L567 ElimStorePlain]: treesize reduction 205, result has 27.3 percent of original size [2019-10-14 21:50:53,922 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:50:53,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:94, output treesize:83 [2019-10-14 21:50:55,202 INFO L341 Elim1Store]: treesize reduction 176, result has 32.6 percent of original size [2019-10-14 21:50:55,203 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 91 treesize of output 114 [2019-10-14 21:50:55,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:55,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:55,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:55,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:55,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:55,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:55,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:55,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:55,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:55,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 21:50:55,274 INFO L567 ElimStorePlain]: treesize reduction 306, result has 5.0 percent of original size [2019-10-14 21:50:55,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:55,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:7 [2019-10-14 21:50:55,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 28 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-14 21:50:55,409 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:55,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 42 [2019-10-14 21:50:55,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668747453] [2019-10-14 21:50:55,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-14 21:50:55,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:55,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-14 21:50:55,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1561, Unknown=0, NotChecked=0, Total=1722 [2019-10-14 21:50:55,411 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 42 states. [2019-10-14 21:51:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:00,114 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2019-10-14 21:51:00,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-14 21:51:00,114 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 66 [2019-10-14 21:51:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:00,117 INFO L225 Difference]: With dead ends: 149 [2019-10-14 21:51:00,117 INFO L226 Difference]: Without dead ends: 147 [2019-10-14 21:51:00,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 54 SyntacticMatches, 15 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2867 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=944, Invalid=7428, Unknown=0, NotChecked=0, Total=8372 [2019-10-14 21:51:00,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-14 21:51:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 77. [2019-10-14 21:51:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-14 21:51:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2019-10-14 21:51:00,132 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 66 [2019-10-14 21:51:00,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:00,133 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2019-10-14 21:51:00,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-14 21:51:00,133 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2019-10-14 21:51:00,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-14 21:51:00,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:00,135 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:00,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:00,339 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:00,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:00,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2024493999, now seen corresponding path program 8 times [2019-10-14 21:51:00,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:00,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126338723] [2019-10-14 21:51:00,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:00,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:00,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 43 proven. 62 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-14 21:51:00,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126338723] [2019-10-14 21:51:00,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154855509] [2019-10-14 21:51:00,443 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:51:00,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:51:00,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:00,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-14 21:51:00,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:00,645 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 60 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-14 21:51:00,646 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:00,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 17 [2019-10-14 21:51:00,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750522034] [2019-10-14 21:51:00,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 21:51:00,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:00,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 21:51:00,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-10-14 21:51:00,649 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 17 states. [2019-10-14 21:51:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:00,961 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2019-10-14 21:51:00,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 21:51:00,961 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2019-10-14 21:51:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:00,962 INFO L225 Difference]: With dead ends: 144 [2019-10-14 21:51:00,962 INFO L226 Difference]: Without dead ends: 83 [2019-10-14 21:51:00,963 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2019-10-14 21:51:00,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-14 21:51:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-14 21:51:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-14 21:51:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2019-10-14 21:51:00,981 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 74 [2019-10-14 21:51:00,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:00,981 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2019-10-14 21:51:00,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-14 21:51:00,982 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2019-10-14 21:51:00,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-14 21:51:00,985 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:00,985 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:01,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:01,191 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:01,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:01,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2127769972, now seen corresponding path program 9 times [2019-10-14 21:51:01,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:01,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043337929] [2019-10-14 21:51:01,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:01,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:01,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:01,605 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 26 proven. 100 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-14 21:51:01,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043337929] [2019-10-14 21:51:01,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797491546] [2019-10-14 21:51:01,606 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:51:01,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-14 21:51:01,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:01,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-14 21:51:01,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:01,724 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:51:01,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:01,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:01,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:01,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-14 21:51:01,795 INFO L341 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2019-10-14 21:51:01,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2019-10-14 21:51:01,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:01,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:01,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:01,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-10-14 21:51:01,859 INFO L341 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-10-14 21:51:01,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2019-10-14 21:51:01,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:01,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:01,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:01,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-10-14 21:51:01,970 INFO L341 Elim1Store]: treesize reduction 178, result has 16.8 percent of original size [2019-10-14 21:51:01,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 65 [2019-10-14 21:51:01,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:01,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:01,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:01,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:59 [2019-10-14 21:51:02,076 INFO L341 Elim1Store]: treesize reduction 222, result has 14.3 percent of original size [2019-10-14 21:51:02,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 71 treesize of output 68 [2019-10-14 21:51:02,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:02,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:02,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:02,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:57 [2019-10-14 21:51:02,306 INFO L341 Elim1Store]: treesize reduction 274, result has 14.9 percent of original size [2019-10-14 21:51:02,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 82 [2019-10-14 21:51:02,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:02,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:02,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:02,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:73 [2019-10-14 21:51:02,494 INFO L341 Elim1Store]: treesize reduction 332, result has 12.9 percent of original size [2019-10-14 21:51:02,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 85 treesize of output 85 [2019-10-14 21:51:02,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:02,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:02,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:02,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:88, output treesize:71 [2019-10-14 21:51:02,799 INFO L341 Elim1Store]: treesize reduction 388, result has 13.4 percent of original size [2019-10-14 21:51:02,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 99 [2019-10-14 21:51:02,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:02,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:02,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:02,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:91, output treesize:87 [2019-10-14 21:51:03,073 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 32 [2019-10-14 21:51:03,073 INFO L341 Elim1Store]: treesize reduction 460, result has 11.7 percent of original size [2019-10-14 21:51:03,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 99 treesize of output 102 [2019-10-14 21:51:03,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:03,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:03,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:03,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:85 [2019-10-14 21:51:03,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,623 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:03,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 102 [2019-10-14 21:51:03,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:03,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:03,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:51:03,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:108, output treesize:91 [2019-10-14 21:51:05,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:05,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:05,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:05,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:05,410 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:51:05,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:05,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:05,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:05,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:05,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:05,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:05,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:05,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:05,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:05,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:05,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:05,423 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:05,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 84 treesize of output 35 [2019-10-14 21:51:05,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:05,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:05,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:05,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:93, output treesize:7 [2019-10-14 21:51:05,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 64 proven. 74 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-14 21:51:05,612 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:05,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 32] total 47 [2019-10-14 21:51:05,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480392596] [2019-10-14 21:51:05,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-14 21:51:05,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:05,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-14 21:51:05,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1845, Unknown=0, NotChecked=0, Total=2162 [2019-10-14 21:51:05,614 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 47 states. [2019-10-14 21:51:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:09,621 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2019-10-14 21:51:09,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-14 21:51:09,622 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 78 [2019-10-14 21:51:09,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:09,625 INFO L225 Difference]: With dead ends: 174 [2019-10-14 21:51:09,625 INFO L226 Difference]: Without dead ends: 172 [2019-10-14 21:51:09,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 56 SyntacticMatches, 21 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3272 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1211, Invalid=8689, Unknown=0, NotChecked=0, Total=9900 [2019-10-14 21:51:09,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-14 21:51:09,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 89. [2019-10-14 21:51:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-14 21:51:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2019-10-14 21:51:09,647 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 78 [2019-10-14 21:51:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:09,648 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2019-10-14 21:51:09,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-14 21:51:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2019-10-14 21:51:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-14 21:51:09,649 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:09,650 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:09,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:09,852 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:09,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:09,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2047876832, now seen corresponding path program 10 times [2019-10-14 21:51:09,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:09,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443124063] [2019-10-14 21:51:09,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:09,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:09,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 63 proven. 87 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-14 21:51:09,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443124063] [2019-10-14 21:51:09,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919654071] [2019-10-14 21:51:09,978 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:51:10,044 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:51:10,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:10,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-14 21:51:10,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 84 proven. 66 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-14 21:51:10,154 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:10,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 19 [2019-10-14 21:51:10,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791442675] [2019-10-14 21:51:10,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 21:51:10,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:10,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 21:51:10,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-10-14 21:51:10,155 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 19 states. [2019-10-14 21:51:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:10,575 INFO L93 Difference]: Finished difference Result 164 states and 169 transitions. [2019-10-14 21:51:10,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 21:51:10,576 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2019-10-14 21:51:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:10,578 INFO L225 Difference]: With dead ends: 164 [2019-10-14 21:51:10,578 INFO L226 Difference]: Without dead ends: 95 [2019-10-14 21:51:10,579 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2019-10-14 21:51:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-14 21:51:10,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-10-14 21:51:10,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-14 21:51:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2019-10-14 21:51:10,593 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 86 [2019-10-14 21:51:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:10,593 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2019-10-14 21:51:10,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 21:51:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2019-10-14 21:51:10,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 21:51:10,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:10,594 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:10,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:10,795 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:10,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:10,796 INFO L82 PathProgramCache]: Analyzing trace with hash -623410469, now seen corresponding path program 11 times [2019-10-14 21:51:10,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:10,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448321944] [2019-10-14 21:51:10,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:10,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:10,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 33 proven. 142 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-14 21:51:11,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448321944] [2019-10-14 21:51:11,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809339635] [2019-10-14 21:51:11,259 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:51:11,370 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-10-14 21:51:11,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:11,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-14 21:51:11,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:11,396 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:51:11,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:11,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-14 21:51:11,456 INFO L341 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2019-10-14 21:51:11,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2019-10-14 21:51:11,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:11,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-10-14 21:51:11,517 INFO L341 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-10-14 21:51:11,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2019-10-14 21:51:11,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:11,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-10-14 21:51:11,630 INFO L341 Elim1Store]: treesize reduction 178, result has 16.8 percent of original size [2019-10-14 21:51:11,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 65 [2019-10-14 21:51:11,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:11,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:59 [2019-10-14 21:51:11,739 INFO L341 Elim1Store]: treesize reduction 222, result has 14.3 percent of original size [2019-10-14 21:51:11,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 71 treesize of output 68 [2019-10-14 21:51:11,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:11,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:57 [2019-10-14 21:51:11,897 INFO L341 Elim1Store]: treesize reduction 274, result has 14.9 percent of original size [2019-10-14 21:51:11,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 82 [2019-10-14 21:51:11,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:11,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:73 [2019-10-14 21:51:12,018 INFO L341 Elim1Store]: treesize reduction 332, result has 12.9 percent of original size [2019-10-14 21:51:12,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 85 treesize of output 85 [2019-10-14 21:51:12,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:12,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:12,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:12,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:88, output treesize:71 [2019-10-14 21:51:12,212 INFO L341 Elim1Store]: treesize reduction 388, result has 13.4 percent of original size [2019-10-14 21:51:12,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 99 [2019-10-14 21:51:12,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:12,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:12,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:12,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:91, output treesize:87 [2019-10-14 21:51:12,378 INFO L341 Elim1Store]: treesize reduction 460, result has 11.7 percent of original size [2019-10-14 21:51:12,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 99 treesize of output 102 [2019-10-14 21:51:12,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:12,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:12,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:12,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:85 [2019-10-14 21:51:12,611 INFO L341 Elim1Store]: treesize reduction 520, result has 12.2 percent of original size [2019-10-14 21:51:12,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 102 treesize of output 116 [2019-10-14 21:51:12,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:12,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:12,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:12,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:105, output treesize:101 [2019-10-14 21:51:12,818 INFO L341 Elim1Store]: treesize reduction 606, result has 10.8 percent of original size [2019-10-14 21:51:12,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 113 treesize of output 119 [2019-10-14 21:51:12,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:12,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:12,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:12,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:116, output treesize:99 [2019-10-14 21:51:13,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,256 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:13,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 113 treesize of output 119 [2019-10-14 21:51:13,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:13,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:13,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:51:13,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:122, output treesize:105 [2019-10-14 21:51:15,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,476 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:51:15,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:15,488 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:15,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 97 treesize of output 40 [2019-10-14 21:51:15,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:15,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:15,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:15,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:106, output treesize:7 [2019-10-14 21:51:15,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 77 proven. 113 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-14 21:51:15,721 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:15,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 36] total 53 [2019-10-14 21:51:15,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19013819] [2019-10-14 21:51:15,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-14 21:51:15,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:15,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-14 21:51:15,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=2341, Unknown=0, NotChecked=0, Total=2756 [2019-10-14 21:51:15,723 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 53 states.