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/pr5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:38:27,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:38:27,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:38:27,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:38:27,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:38:27,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:38:27,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:38:27,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:38:27,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:38:27,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:38:27,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:38:27,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:38:27,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:38:27,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:38:27,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:38:27,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:38:27,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:38:27,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:38:27,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:38:27,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:38:27,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:38:27,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:38:27,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:38:27,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:38:27,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:38:27,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:38:27,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:38:27,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:38:27,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:38:27,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:38:27,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:38:27,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:38:27,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:38:27,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:38:27,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:38:27,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:38:27,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:38:27,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:38:27,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:38:27,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:38:27,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:38:27,243 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-02 00:38:27,270 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:38:27,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:38:27,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:38:27,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:38:27,275 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:38:27,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:38:27,275 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:38:27,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:38:27,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:38:27,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:38:27,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:38:27,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:38:27,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:38:27,278 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:38:27,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:38:27,278 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:38:27,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:38:27,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:38:27,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:38:27,279 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:38:27,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:38:27,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:38:27,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:38:27,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:38:27,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:38:27,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:38:27,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:38:27,282 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:38:27,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:38:27,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:38:27,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:38:27,358 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:38:27,359 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:38:27,360 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:38:27,360 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr5.c [2019-10-02 00:38:27,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67bb1add5/8f88c2c56760456698ab884ce756a441/FLAG998c289fa [2019-10-02 00:38:27,883 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:38:27,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr5.c [2019-10-02 00:38:27,891 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67bb1add5/8f88c2c56760456698ab884ce756a441/FLAG998c289fa [2019-10-02 00:38:28,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67bb1add5/8f88c2c56760456698ab884ce756a441 [2019-10-02 00:38:28,267 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:38:28,268 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:38:28,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:38:28,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:38:28,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:38:28,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:38:28" (1/1) ... [2019-10-02 00:38:28,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a02677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:28, skipping insertion in model container [2019-10-02 00:38:28,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:38:28" (1/1) ... [2019-10-02 00:38:28,280 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:38:28,297 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:38:28,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:38:28,532 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:38:28,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:38:28,669 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:38:28,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:28 WrapperNode [2019-10-02 00:38:28,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:38:28,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:38:28,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:38:28,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:38:28,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:28" (1/1) ... [2019-10-02 00:38:28,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:28" (1/1) ... [2019-10-02 00:38:28,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:28" (1/1) ... [2019-10-02 00:38:28,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:28" (1/1) ... [2019-10-02 00:38:28,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:28" (1/1) ... [2019-10-02 00:38:28,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:28" (1/1) ... [2019-10-02 00:38:28,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:28" (1/1) ... [2019-10-02 00:38:28,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:38:28,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:38:28,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:38:28,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:38:28,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:28" (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-02 00:38:28,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:38:28,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:38:28,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 00:38:28,775 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:38:28,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:38:28,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 00:38:28,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 00:38:28,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:38:28,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:38:28,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 00:38:28,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 00:38:28,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 00:38:28,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 00:38:28,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:38:28,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:38:29,144 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:38:29,145 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 00:38:29,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:38:29 BoogieIcfgContainer [2019-10-02 00:38:29,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:38:29,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:38:29,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:38:29,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:38:29,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:38:28" (1/3) ... [2019-10-02 00:38:29,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e62fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:38:29, skipping insertion in model container [2019-10-02 00:38:29,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:28" (2/3) ... [2019-10-02 00:38:29,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e62fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:38:29, skipping insertion in model container [2019-10-02 00:38:29,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:38:29" (3/3) ... [2019-10-02 00:38:29,154 INFO L109 eAbstractionObserver]: Analyzing ICFG pr5.c [2019-10-02 00:38:29,167 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:38:29,175 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:38:29,192 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:38:29,222 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:38:29,222 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:38:29,222 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:38:29,223 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:38:29,223 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:38:29,223 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:38:29,223 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:38:29,223 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:38:29,223 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:38:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-02 00:38:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 00:38:29,248 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:29,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:29,250 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:29,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:29,254 INFO L82 PathProgramCache]: Analyzing trace with hash 65656709, now seen corresponding path program 1 times [2019-10-02 00:38:29,256 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:29,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:29,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:29,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:29,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:29,471 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-02 00:38:29,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:38:29,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:38:29,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:38:29,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:38:29,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:38:29,495 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2019-10-02 00:38:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:29,572 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2019-10-02 00:38:29,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 00:38:29,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-02 00:38:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:29,587 INFO L225 Difference]: With dead ends: 57 [2019-10-02 00:38:29,588 INFO L226 Difference]: Without dead ends: 33 [2019-10-02 00:38:29,593 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:38:29,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-02 00:38:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-02 00:38:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-02 00:38:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-10-02 00:38:29,633 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 16 [2019-10-02 00:38:29,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:29,634 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-10-02 00:38:29,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:38:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-10-02 00:38:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 00:38:29,636 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:29,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:29,636 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:29,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:29,637 INFO L82 PathProgramCache]: Analyzing trace with hash 67503751, now seen corresponding path program 1 times [2019-10-02 00:38:29,637 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:29,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:29,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:29,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:29,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:29,864 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-02 00:38:29,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:38:29,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 00:38:29,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 00:38:29,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 00:38:29,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 00:38:29,867 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 4 states. [2019-10-02 00:38:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:29,969 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2019-10-02 00:38:29,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:38:29,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-02 00:38:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:29,973 INFO L225 Difference]: With dead ends: 56 [2019-10-02 00:38:29,974 INFO L226 Difference]: Without dead ends: 39 [2019-10-02 00:38:29,975 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 00:38:29,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-02 00:38:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-10-02 00:38:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 00:38:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-10-02 00:38:29,984 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 16 [2019-10-02 00:38:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:29,984 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-10-02 00:38:29,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 00:38:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-10-02 00:38:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 00:38:29,985 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:29,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:29,986 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:29,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:29,986 INFO L82 PathProgramCache]: Analyzing trace with hash -335534155, now seen corresponding path program 1 times [2019-10-02 00:38:29,987 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:29,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:29,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:29,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:29,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:38:30,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:38:30,341 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:38:30,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:30,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 00:38:30,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:38:30,481 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 16 treesize of output 12 [2019-10-02 00:38:30,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:30,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:30,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:30,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:38:30,517 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-02 00:38:30,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:30,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:30,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:30,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-10-02 00:38:30,537 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:30,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:30,543 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:30,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:30,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:30,554 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:19 [2019-10-02 00:38:30,577 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-02 00:38:30,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:30,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:30,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:30,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:30,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-10-02 00:38:30,594 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:30,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:30,601 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:30,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:30,612 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-02 00:38:30,612 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2019-10-02 00:38:30,636 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-02 00:38:30,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:30,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:30,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:30,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:30,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-10-02 00:38:30,648 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:30,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:30,657 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:30,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:30,671 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-02 00:38:30,672 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2019-10-02 00:38:30,688 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 0 case distinctions, treesize of input 26 treesize of output 21 [2019-10-02 00:38:30,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:30,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:30,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:30,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:30,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2019-10-02 00:38:30,700 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:30,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:30,706 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:30,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:30,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:30,715 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:20 [2019-10-02 00:38:30,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:38:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:38:30,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:38:30,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-10-02 00:38:30,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 00:38:30,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 00:38:30,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-10-02 00:38:30,785 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 11 states. [2019-10-02 00:38:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:31,354 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2019-10-02 00:38:31,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 00:38:31,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-10-02 00:38:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:31,358 INFO L225 Difference]: With dead ends: 116 [2019-10-02 00:38:31,359 INFO L226 Difference]: Without dead ends: 100 [2019-10-02 00:38:31,360 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-10-02 00:38:31,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-02 00:38:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 43. [2019-10-02 00:38:31,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 00:38:31,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2019-10-02 00:38:31,377 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 23 [2019-10-02 00:38:31,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:31,378 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2019-10-02 00:38:31,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 00:38:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2019-10-02 00:38:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 00:38:31,379 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:31,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:31,380 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:31,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:31,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1346651405, now seen corresponding path program 1 times [2019-10-02 00:38:31,381 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:31,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:31,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:31,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:31,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:38:31,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:38:31,681 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:38:31,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:38:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:31,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 00:38:31,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:38:31,756 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 16 treesize of output 12 [2019-10-02 00:38:31,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:31,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-02 00:38:31,775 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-02 00:38:31,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:31,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:31,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:31,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-10-02 00:38:31,786 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:31,792 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:31,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,803 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:19 [2019-10-02 00:38:31,826 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-02 00:38:31,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:31,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:31,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:31,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:31,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-10-02 00:38:31,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:31,851 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:31,860 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-02 00:38:31,860 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2019-10-02 00:38:31,871 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-02 00:38:31,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:31,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:31,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:31,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:31,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-10-02 00:38:31,881 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:31,893 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:31,903 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-02 00:38:31,904 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2019-10-02 00:38:31,917 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 0 case distinctions, treesize of input 26 treesize of output 21 [2019-10-02 00:38:31,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:31,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:31,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:31,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:31,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2019-10-02 00:38:31,933 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:31,938 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:31,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:31,954 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:20 [2019-10-02 00:38:32,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:38:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:38:32,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:38:32,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-10-02 00:38:32,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 00:38:32,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 00:38:32,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-10-02 00:38:32,047 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand 14 states. [2019-10-02 00:38:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:32,617 INFO L93 Difference]: Finished difference Result 118 states and 169 transitions. [2019-10-02 00:38:32,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 00:38:32,617 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-10-02 00:38:32,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:32,619 INFO L225 Difference]: With dead ends: 118 [2019-10-02 00:38:32,619 INFO L226 Difference]: Without dead ends: 116 [2019-10-02 00:38:32,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2019-10-02 00:38:32,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-02 00:38:32,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 54. [2019-10-02 00:38:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-02 00:38:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 75 transitions. [2019-10-02 00:38:32,633 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 75 transitions. Word has length 23 [2019-10-02 00:38:32,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:32,633 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 75 transitions. [2019-10-02 00:38:32,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 00:38:32,633 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 75 transitions. [2019-10-02 00:38:32,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 00:38:32,634 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:32,635 INFO L411 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-02 00:38:32,635 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:32,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:32,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1807780357, now seen corresponding path program 1 times [2019-10-02 00:38:32,635 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:32,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:32,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:32,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:32,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:38:32,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:38:32,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:38:32,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:38:32,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:38:32,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:38:32,688 INFO L87 Difference]: Start difference. First operand 54 states and 75 transitions. Second operand 3 states. [2019-10-02 00:38:32,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:32,724 INFO L93 Difference]: Finished difference Result 84 states and 115 transitions. [2019-10-02 00:38:32,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:38:32,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-02 00:38:32,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:32,726 INFO L225 Difference]: With dead ends: 84 [2019-10-02 00:38:32,726 INFO L226 Difference]: Without dead ends: 60 [2019-10-02 00:38:32,726 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 00:38:32,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-02 00:38:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-10-02 00:38:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-02 00:38:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2019-10-02 00:38:32,735 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 30 [2019-10-02 00:38:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:32,736 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2019-10-02 00:38:32,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:38:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2019-10-02 00:38:32,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 00:38:32,739 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:32,739 INFO L411 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-02 00:38:32,739 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:32,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:32,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1053367863, now seen corresponding path program 2 times [2019-10-02 00:38:32,740 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:32,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:32,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:32,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:32,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:38:32,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:38:32,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:38:32,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:38:32,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:38:32,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:38:32,795 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand 3 states. [2019-10-02 00:38:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:32,848 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2019-10-02 00:38:32,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:38:32,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-02 00:38:32,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:32,849 INFO L225 Difference]: With dead ends: 76 [2019-10-02 00:38:32,849 INFO L226 Difference]: Without dead ends: 52 [2019-10-02 00:38:32,850 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 00:38:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-02 00:38:32,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-10-02 00:38:32,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-02 00:38:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2019-10-02 00:38:32,858 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 30 [2019-10-02 00:38:32,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:32,858 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2019-10-02 00:38:32,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:38:32,859 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2019-10-02 00:38:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 00:38:32,860 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:32,860 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:32,860 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:32,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:32,861 INFO L82 PathProgramCache]: Analyzing trace with hash 290616554, now seen corresponding path program 1 times [2019-10-02 00:38:32,861 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:32,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:32,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:32,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:38:32,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:38:33,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:38:33,031 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:38:33,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:33,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 00:38:33,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:38:33,141 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 16 treesize of output 12 [2019-10-02 00:38:33,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:33,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:33,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:33,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-02 00:38:33,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:33,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:38:33,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:33,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:33,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:33,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:38:33,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:33,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:38:33,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:33,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:33,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:33,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:38:33,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:33,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:38:33,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:33,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:33,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:33,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-10-02 00:38:33,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:38:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:38:33,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:38:33,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-10-02 00:38:33,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 00:38:33,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 00:38:33,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-10-02 00:38:33,377 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand 18 states. [2019-10-02 00:38:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:34,139 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2019-10-02 00:38:34,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 00:38:34,139 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-10-02 00:38:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:34,141 INFO L225 Difference]: With dead ends: 142 [2019-10-02 00:38:34,141 INFO L226 Difference]: Without dead ends: 116 [2019-10-02 00:38:34,144 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 00:38:34,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-02 00:38:34,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 61. [2019-10-02 00:38:34,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-02 00:38:34,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2019-10-02 00:38:34,156 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 32 [2019-10-02 00:38:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:34,156 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2019-10-02 00:38:34,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 00:38:34,156 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2019-10-02 00:38:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 00:38:34,158 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:34,159 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:34,159 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:34,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:34,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1514821780, now seen corresponding path program 1 times [2019-10-02 00:38:34,159 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:34,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:34,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:34,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:34,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:38:34,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:38:34,280 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:38:34,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:34,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 00:38:34,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:38:34,361 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 16 treesize of output 12 [2019-10-02 00:38:34,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:34,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:34,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:34,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:38:34,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:34,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:38:34,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:34,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:34,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:34,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:38:34,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:34,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:38:34,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:34,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:34,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:34,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:38:34,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:34,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:38:34,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:34,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:34,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:34,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-02 00:38:34,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:38:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:38:34,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:38:34,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-10-02 00:38:34,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 00:38:34,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 00:38:34,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-10-02 00:38:34,575 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand 17 states. [2019-10-02 00:38:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:36,132 INFO L93 Difference]: Finished difference Result 233 states and 313 transitions. [2019-10-02 00:38:36,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 00:38:36,133 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-10-02 00:38:36,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:36,135 INFO L225 Difference]: With dead ends: 233 [2019-10-02 00:38:36,135 INFO L226 Difference]: Without dead ends: 217 [2019-10-02 00:38:36,137 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 00:38:36,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-02 00:38:36,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 77. [2019-10-02 00:38:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-02 00:38:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 107 transitions. [2019-10-02 00:38:36,152 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 107 transitions. Word has length 32 [2019-10-02 00:38:36,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:36,153 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 107 transitions. [2019-10-02 00:38:36,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 00:38:36,153 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 107 transitions. [2019-10-02 00:38:36,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 00:38:36,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:36,154 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:36,155 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:36,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:36,155 INFO L82 PathProgramCache]: Analyzing trace with hash -643526488, now seen corresponding path program 1 times [2019-10-02 00:38:36,155 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:36,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:36,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:36,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:36,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 00:38:36,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:38:36,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:38:36,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:38:36,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:38:36,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:38:36,206 INFO L87 Difference]: Start difference. First operand 77 states and 107 transitions. Second operand 5 states. [2019-10-02 00:38:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:36,302 INFO L93 Difference]: Finished difference Result 145 states and 202 transitions. [2019-10-02 00:38:36,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 00:38:36,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-02 00:38:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:36,304 INFO L225 Difference]: With dead ends: 145 [2019-10-02 00:38:36,304 INFO L226 Difference]: Without dead ends: 119 [2019-10-02 00:38:36,305 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 00:38:36,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-02 00:38:36,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-10-02 00:38:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-02 00:38:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2019-10-02 00:38:36,318 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 32 [2019-10-02 00:38:36,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:36,319 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2019-10-02 00:38:36,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:38:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2019-10-02 00:38:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 00:38:36,320 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:36,320 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:36,320 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:36,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:36,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1295967062, now seen corresponding path program 1 times [2019-10-02 00:38:36,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:36,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:36,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:36,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:36,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 00:38:36,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:38:36,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 00:38:36,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 00:38:36,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 00:38:36,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 00:38:36,366 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand 4 states. [2019-10-02 00:38:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:36,417 INFO L93 Difference]: Finished difference Result 162 states and 231 transitions. [2019-10-02 00:38:36,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:38:36,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-02 00:38:36,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:36,419 INFO L225 Difference]: With dead ends: 162 [2019-10-02 00:38:36,419 INFO L226 Difference]: Without dead ends: 119 [2019-10-02 00:38:36,420 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:38:36,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-02 00:38:36,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2019-10-02 00:38:36,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-02 00:38:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2019-10-02 00:38:36,433 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 32 [2019-10-02 00:38:36,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:36,433 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2019-10-02 00:38:36,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 00:38:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2019-10-02 00:38:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 00:38:36,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:36,435 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:36,435 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:36,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:36,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2113615512, now seen corresponding path program 1 times [2019-10-02 00:38:36,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:36,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:36,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:36,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:36,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:38:36,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:38:36,541 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:38:36,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:36,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 00:38:36,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:38:36,667 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 16 treesize of output 12 [2019-10-02 00:38:36,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:36,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:36,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:36,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-02 00:38:36,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:36,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:38:36,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:36,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:36,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:36,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:38:36,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:36,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:38:36,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:36,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:36,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:36,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-02 00:38:36,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:36,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:36,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:36,754 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:36,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-10-02 00:38:36,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:36,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:36,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:36,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-02 00:38:36,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:38:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:38:36,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:38:36,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2019-10-02 00:38:36,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 00:38:36,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 00:38:36,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-10-02 00:38:36,922 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand 20 states. [2019-10-02 00:38:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:37,495 INFO L93 Difference]: Finished difference Result 174 states and 232 transitions. [2019-10-02 00:38:37,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 00:38:37,495 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2019-10-02 00:38:37,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:37,497 INFO L225 Difference]: With dead ends: 174 [2019-10-02 00:38:37,497 INFO L226 Difference]: Without dead ends: 172 [2019-10-02 00:38:37,498 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-10-02 00:38:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-02 00:38:37,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 144. [2019-10-02 00:38:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-02 00:38:37,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 197 transitions. [2019-10-02 00:38:37,521 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 197 transitions. Word has length 32 [2019-10-02 00:38:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:37,522 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 197 transitions. [2019-10-02 00:38:37,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 00:38:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 197 transitions. [2019-10-02 00:38:37,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 00:38:37,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:37,525 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:37,525 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:37,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:37,526 INFO L82 PathProgramCache]: Analyzing trace with hash 633197530, now seen corresponding path program 1 times [2019-10-02 00:38:37,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:37,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:37,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:37,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:37,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 00:38:37,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:38:37,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:38:37,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:38:37,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:38:37,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:38:37,561 INFO L87 Difference]: Start difference. First operand 144 states and 197 transitions. Second operand 3 states. [2019-10-02 00:38:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:37,612 INFO L93 Difference]: Finished difference Result 218 states and 297 transitions. [2019-10-02 00:38:37,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:38:37,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-02 00:38:37,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:37,614 INFO L225 Difference]: With dead ends: 218 [2019-10-02 00:38:37,614 INFO L226 Difference]: Without dead ends: 157 [2019-10-02 00:38:37,618 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 00:38:37,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-02 00:38:37,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 137. [2019-10-02 00:38:37,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-02 00:38:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 181 transitions. [2019-10-02 00:38:37,639 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 181 transitions. Word has length 39 [2019-10-02 00:38:37,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:37,639 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 181 transitions. [2019-10-02 00:38:37,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:38:37,639 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2019-10-02 00:38:37,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 00:38:37,641 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:37,642 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:37,642 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:37,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:37,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1972826024, now seen corresponding path program 1 times [2019-10-02 00:38:37,642 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:37,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:37,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:38:37,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:38:37,879 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:38:37,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:37,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 00:38:37,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:38:38,018 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 16 treesize of output 12 [2019-10-02 00:38:38,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-10-02 00:38:38,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:38:38,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-10-02 00:38:38,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2019-10-02 00:38:38,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-10-02 00:38:38,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,245 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 58 [2019-10-02 00:38:38,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:64 [2019-10-02 00:38:38,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,390 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 61 [2019-10-02 00:38:38,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:70 [2019-10-02 00:38:38,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 79 [2019-10-02 00:38:38,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:89, output treesize:85 [2019-10-02 00:38:38,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,598 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 91 [2019-10-02 00:38:38,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:97 [2019-10-02 00:38:38,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,709 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 104 treesize of output 103 [2019-10-02 00:38:38,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:110, output treesize:103 [2019-10-02 00:38:38,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:38,844 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 110 treesize of output 115 [2019-10-02 00:38:38,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:38,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:38,871 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-02 00:38:38,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:116, output treesize:112 [2019-10-02 00:38:39,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:38:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:38:39,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:38:39,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 28 [2019-10-02 00:38:39,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 00:38:39,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 00:38:39,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2019-10-02 00:38:39,223 INFO L87 Difference]: Start difference. First operand 137 states and 181 transitions. Second operand 28 states. [2019-10-02 00:38:41,250 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-10-02 00:38:42,054 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-10-02 00:38:42,349 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-10-02 00:38:44,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:44,032 INFO L93 Difference]: Finished difference Result 347 states and 458 transitions. [2019-10-02 00:38:44,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 00:38:44,032 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-10-02 00:38:44,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:44,037 INFO L225 Difference]: With dead ends: 347 [2019-10-02 00:38:44,037 INFO L226 Difference]: Without dead ends: 321 [2019-10-02 00:38:44,041 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=820, Invalid=4436, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 00:38:44,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-10-02 00:38:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 178. [2019-10-02 00:38:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-10-02 00:38:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 240 transitions. [2019-10-02 00:38:44,069 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 240 transitions. Word has length 39 [2019-10-02 00:38:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:44,069 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 240 transitions. [2019-10-02 00:38:44,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 00:38:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 240 transitions. [2019-10-02 00:38:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 00:38:44,070 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:44,071 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:44,071 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:44,071 INFO L82 PathProgramCache]: Analyzing trace with hash 601374806, now seen corresponding path program 1 times [2019-10-02 00:38:44,071 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:44,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:44,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:44,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:44,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 00:38:44,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:38:44,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:38:44,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:38:44,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:38:44,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:38:44,102 INFO L87 Difference]: Start difference. First operand 178 states and 240 transitions. Second operand 3 states. [2019-10-02 00:38:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:44,142 INFO L93 Difference]: Finished difference Result 253 states and 335 transitions. [2019-10-02 00:38:44,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:38:44,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-02 00:38:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:44,144 INFO L225 Difference]: With dead ends: 253 [2019-10-02 00:38:44,145 INFO L226 Difference]: Without dead ends: 202 [2019-10-02 00:38:44,145 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 00:38:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-02 00:38:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 171. [2019-10-02 00:38:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-02 00:38:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 227 transitions. [2019-10-02 00:38:44,163 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 227 transitions. Word has length 39 [2019-10-02 00:38:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:44,163 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 227 transitions. [2019-10-02 00:38:44,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:38:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2019-10-02 00:38:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 00:38:44,165 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:44,165 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:44,165 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:44,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:44,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1686362668, now seen corresponding path program 1 times [2019-10-02 00:38:44,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:44,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:44,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:44,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:44,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 00:38:44,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:38:44,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:38:44,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:38:44,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:38:44,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:38:44,188 INFO L87 Difference]: Start difference. First operand 171 states and 227 transitions. Second operand 3 states. [2019-10-02 00:38:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:44,221 INFO L93 Difference]: Finished difference Result 200 states and 261 transitions. [2019-10-02 00:38:44,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:38:44,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-02 00:38:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:44,223 INFO L225 Difference]: With dead ends: 200 [2019-10-02 00:38:44,223 INFO L226 Difference]: Without dead ends: 164 [2019-10-02 00:38:44,226 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 00:38:44,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-02 00:38:44,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-10-02 00:38:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-02 00:38:44,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 214 transitions. [2019-10-02 00:38:44,244 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 214 transitions. Word has length 39 [2019-10-02 00:38:44,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:44,244 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 214 transitions. [2019-10-02 00:38:44,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:38:44,244 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 214 transitions. [2019-10-02 00:38:44,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 00:38:44,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:44,245 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:44,246 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:44,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:44,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1404214042, now seen corresponding path program 1 times [2019-10-02 00:38:44,246 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:44,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:44,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:44,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:44,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 00:38:44,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:38:44,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:38:44,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:38:44,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:38:44,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:38:44,272 INFO L87 Difference]: Start difference. First operand 164 states and 214 transitions. Second operand 3 states. [2019-10-02 00:38:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:44,306 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2019-10-02 00:38:44,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:38:44,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-02 00:38:44,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:44,308 INFO L225 Difference]: With dead ends: 183 [2019-10-02 00:38:44,308 INFO L226 Difference]: Without dead ends: 157 [2019-10-02 00:38:44,308 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 00:38:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-02 00:38:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-02 00:38:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-02 00:38:44,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 204 transitions. [2019-10-02 00:38:44,329 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 204 transitions. Word has length 39 [2019-10-02 00:38:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:44,331 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 204 transitions. [2019-10-02 00:38:44,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:38:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 204 transitions. [2019-10-02 00:38:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 00:38:44,332 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:44,332 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:44,333 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:44,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:44,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1920676693, now seen corresponding path program 2 times [2019-10-02 00:38:44,333 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:44,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:44,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:44,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:44,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:38:44,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:38:44,518 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:38:44,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:38:44,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:38:44,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:38:44,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 00:38:44,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:38:44,678 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 16 treesize of output 12 [2019-10-02 00:38:44,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:44,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:44,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:44,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-02 00:38:44,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:44,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:38:44,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:44,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:44,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:44,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:38:44,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:44,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:38:44,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:44,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:44,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:44,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-10-02 00:38:44,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:38:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:38:44,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:38:44,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-10-02 00:38:44,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 00:38:44,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 00:38:44,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-10-02 00:38:44,985 INFO L87 Difference]: Start difference. First operand 157 states and 204 transitions. Second operand 20 states. [2019-10-02 00:38:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:45,988 INFO L93 Difference]: Finished difference Result 295 states and 378 transitions. [2019-10-02 00:38:45,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 00:38:45,988 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-10-02 00:38:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:45,990 INFO L225 Difference]: With dead ends: 295 [2019-10-02 00:38:45,991 INFO L226 Difference]: Without dead ends: 238 [2019-10-02 00:38:45,992 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 00:38:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-02 00:38:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 164. [2019-10-02 00:38:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-02 00:38:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 210 transitions. [2019-10-02 00:38:46,012 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 210 transitions. Word has length 41 [2019-10-02 00:38:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:46,013 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 210 transitions. [2019-10-02 00:38:46,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 00:38:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 210 transitions. [2019-10-02 00:38:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 00:38:46,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:46,014 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:46,014 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:46,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2099530989, now seen corresponding path program 2 times [2019-10-02 00:38:46,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:46,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:46,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:46,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:38:46,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:38:46,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:38:46,129 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:38:46,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:38:46,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:38:46,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:38:46,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 00:38:46,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:38:46,233 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 16 treesize of output 12 [2019-10-02 00:38:46,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:46,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:46,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:46,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-02 00:38:46,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:46,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:38:46,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:46,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:46,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:46,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:38:46,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:46,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:38:46,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:46,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:46,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:46,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-10-02 00:38:46,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:38:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:38:46,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:38:46,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-10-02 00:38:46,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 00:38:46,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 00:38:46,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-10-02 00:38:46,515 INFO L87 Difference]: Start difference. First operand 164 states and 210 transitions. Second operand 20 states. [2019-10-02 00:38:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:48,608 INFO L93 Difference]: Finished difference Result 408 states and 518 transitions. [2019-10-02 00:38:48,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 00:38:48,609 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-10-02 00:38:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:48,612 INFO L225 Difference]: With dead ends: 408 [2019-10-02 00:38:48,612 INFO L226 Difference]: Without dead ends: 349 [2019-10-02 00:38:48,614 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=495, Invalid=2261, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 00:38:48,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-10-02 00:38:48,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 167. [2019-10-02 00:38:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-02 00:38:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 212 transitions. [2019-10-02 00:38:48,638 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 212 transitions. Word has length 41 [2019-10-02 00:38:48,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:48,638 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 212 transitions. [2019-10-02 00:38:48,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 00:38:48,639 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 212 transitions. [2019-10-02 00:38:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 00:38:48,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:48,640 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:48,640 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:48,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:48,640 INFO L82 PathProgramCache]: Analyzing trace with hash -11727721, now seen corresponding path program 2 times [2019-10-02 00:38:48,640 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:48,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:48,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:48,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:38:48,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:38:48,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:38:48,727 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:38:48,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:38:48,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:38:48,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:38:48,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 00:38:48,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:38:48,833 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 16 treesize of output 12 [2019-10-02 00:38:48,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:48,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:48,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:48,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:38:48,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:48,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:38:48,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:48,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:48,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:48,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-02 00:38:48,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:48,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:48,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:48,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:48,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-10-02 00:38:48,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:48,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:48,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:48,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-02 00:38:49,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:38:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:38:49,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:38:49,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2019-10-02 00:38:49,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 00:38:49,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 00:38:49,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-10-02 00:38:49,222 INFO L87 Difference]: Start difference. First operand 167 states and 212 transitions. Second operand 18 states. [2019-10-02 00:38:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:50,390 INFO L93 Difference]: Finished difference Result 486 states and 612 transitions. [2019-10-02 00:38:50,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 00:38:50,390 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-10-02 00:38:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:50,393 INFO L225 Difference]: With dead ends: 486 [2019-10-02 00:38:50,394 INFO L226 Difference]: Without dead ends: 456 [2019-10-02 00:38:50,394 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 00:38:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-10-02 00:38:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 346. [2019-10-02 00:38:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-10-02 00:38:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 441 transitions. [2019-10-02 00:38:50,444 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 441 transitions. Word has length 41 [2019-10-02 00:38:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:50,444 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 441 transitions. [2019-10-02 00:38:50,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 00:38:50,444 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 441 transitions. [2019-10-02 00:38:50,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 00:38:50,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:50,446 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:50,446 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:50,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:50,446 INFO L82 PathProgramCache]: Analyzing trace with hash 10904533, now seen corresponding path program 1 times [2019-10-02 00:38:50,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:50,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:50,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:50,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:38:50,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:38:50,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:38:50,542 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:38:50,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:50,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 00:38:50,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:38:50,671 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 16 treesize of output 12 [2019-10-02 00:38:50,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:50,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:50,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:50,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-02 00:38:50,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:50,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:38:50,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:50,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:50,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:50,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-02 00:38:50,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:50,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:50,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:38:50,744 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:50,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-10-02 00:38:50,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:50,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:50,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:50,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-02 00:38:50,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:38:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:38:50,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:38:50,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 22 [2019-10-02 00:38:50,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 00:38:50,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 00:38:50,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-10-02 00:38:50,990 INFO L87 Difference]: Start difference. First operand 346 states and 441 transitions. Second operand 22 states. [2019-10-02 00:38:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:52,072 INFO L93 Difference]: Finished difference Result 475 states and 594 transitions. [2019-10-02 00:38:52,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 00:38:52,072 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-10-02 00:38:52,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:52,075 INFO L225 Difference]: With dead ends: 475 [2019-10-02 00:38:52,075 INFO L226 Difference]: Without dead ends: 473 [2019-10-02 00:38:52,076 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=1288, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 00:38:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-10-02 00:38:52,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 419. [2019-10-02 00:38:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-10-02 00:38:52,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 531 transitions. [2019-10-02 00:38:52,135 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 531 transitions. Word has length 41 [2019-10-02 00:38:52,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:52,135 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 531 transitions. [2019-10-02 00:38:52,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 00:38:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 531 transitions. [2019-10-02 00:38:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 00:38:52,137 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:52,137 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:52,138 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:52,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:52,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1116400357, now seen corresponding path program 1 times [2019-10-02 00:38:52,138 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:52,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:52,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:52,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:52,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 00:38:52,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:38:52,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:38:52,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:38:52,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:38:52,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:38:52,162 INFO L87 Difference]: Start difference. First operand 419 states and 531 transitions. Second operand 3 states. [2019-10-02 00:38:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:52,261 INFO L93 Difference]: Finished difference Result 627 states and 790 transitions. [2019-10-02 00:38:52,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:38:52,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-02 00:38:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:52,263 INFO L225 Difference]: With dead ends: 627 [2019-10-02 00:38:52,264 INFO L226 Difference]: Without dead ends: 392 [2019-10-02 00:38:52,264 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 00:38:52,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-02 00:38:52,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 348. [2019-10-02 00:38:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-02 00:38:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 425 transitions. [2019-10-02 00:38:52,324 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 425 transitions. Word has length 48 [2019-10-02 00:38:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:52,324 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 425 transitions. [2019-10-02 00:38:52,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:38:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 425 transitions. [2019-10-02 00:38:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 00:38:52,326 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:52,326 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:52,326 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:52,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:52,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2063236426, now seen corresponding path program 3 times [2019-10-02 00:38:52,327 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:52,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:52,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:52,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:38:52,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:38:52,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:38:52,470 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:38:52,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:38:52,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 00:38:52,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:38:52,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 00:38:52,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:38:52,597 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 16 treesize of output 12 [2019-10-02 00:38:52,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:52,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:52,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:52,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:38:52,645 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:38:52,645 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 29 treesize of output 28 [2019-10-02 00:38:52,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:52,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:52,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:52,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:38:52,669 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:38:52,669 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 29 treesize of output 28 [2019-10-02 00:38:52,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:52,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:52,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:52,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:38:52,697 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:38:52,697 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 29 treesize of output 28 [2019-10-02 00:38:52,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:52,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:52,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:52,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2019-10-02 00:38:52,754 INFO L341 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2019-10-02 00:38:52,755 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 30 treesize of output 32 [2019-10-02 00:38:52,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:52,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:52,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:52,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-10-02 00:38:52,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:38:53,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:38:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:38:53,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:38:53,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 24 [2019-10-02 00:38:53,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 00:38:53,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 00:38:53,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-10-02 00:38:53,338 INFO L87 Difference]: Start difference. First operand 348 states and 425 transitions. Second operand 24 states. [2019-10-02 00:38:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:38:56,020 INFO L93 Difference]: Finished difference Result 550 states and 668 transitions. [2019-10-02 00:38:56,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 00:38:56,021 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-10-02 00:38:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:38:56,023 INFO L225 Difference]: With dead ends: 550 [2019-10-02 00:38:56,023 INFO L226 Difference]: Without dead ends: 441 [2019-10-02 00:38:56,025 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=540, Invalid=2882, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 00:38:56,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-10-02 00:38:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 362. [2019-10-02 00:38:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-10-02 00:38:56,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 438 transitions. [2019-10-02 00:38:56,096 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 438 transitions. Word has length 50 [2019-10-02 00:38:56,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:38:56,097 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 438 transitions. [2019-10-02 00:38:56,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 00:38:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 438 transitions. [2019-10-02 00:38:56,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 00:38:56,098 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:38:56,099 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:38:56,099 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:38:56,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:38:56,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1533324534, now seen corresponding path program 3 times [2019-10-02 00:38:56,099 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:38:56,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:38:56,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:56,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:38:56,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:38:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:38:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:38:56,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:38:56,215 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:38:56,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:38:56,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 00:38:56,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:38:56,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 00:38:56,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:38:56,304 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 16 treesize of output 12 [2019-10-02 00:38:56,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:56,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:56,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:56,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2019-10-02 00:38:56,323 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 0 case distinctions, treesize of input 28 treesize of output 23 [2019-10-02 00:38:56,333 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:38:56,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 43 [2019-10-02 00:38:56,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:38:56,350 INFO L567 ElimStorePlain]: treesize reduction 21, result has 47.5 percent of original size [2019-10-02 00:38:56,350 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:56,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:38:56,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:38:56,355 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-10-02 00:38:56,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:38:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:38:56,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:38:56,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2019-10-02 00:38:56,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 00:38:56,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 00:38:56,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-10-02 00:38:56,671 INFO L87 Difference]: Start difference. First operand 362 states and 438 transitions. Second operand 16 states. [2019-10-02 00:39:08,919 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-10-02 00:39:24,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:24,808 INFO L93 Difference]: Finished difference Result 824 states and 994 transitions. [2019-10-02 00:39:24,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 00:39:24,808 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-10-02 00:39:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:24,811 INFO L225 Difference]: With dead ends: 824 [2019-10-02 00:39:24,811 INFO L226 Difference]: Without dead ends: 794 [2019-10-02 00:39:24,812 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=351, Invalid=1717, Unknown=2, NotChecked=0, Total=2070 [2019-10-02 00:39:24,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-10-02 00:39:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 406. [2019-10-02 00:39:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-10-02 00:39:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 495 transitions. [2019-10-02 00:39:24,891 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 495 transitions. Word has length 50 [2019-10-02 00:39:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:24,891 INFO L475 AbstractCegarLoop]: Abstraction has 406 states and 495 transitions. [2019-10-02 00:39:24,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 00:39:24,891 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 495 transitions. [2019-10-02 00:39:24,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 00:39:24,893 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:24,893 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:24,893 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:24,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1457523850, now seen corresponding path program 1 times [2019-10-02 00:39:24,893 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:24,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:24,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:24,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:39:24,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:39:25,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:39:25,011 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:39:25,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:39:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:25,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 00:39:25,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:39:25,105 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 16 treesize of output 12 [2019-10-02 00:39:25,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:25,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:25,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:39:25,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-02 00:39:25,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:39:25,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:39:25,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:25,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:25,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:39:25,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-02 00:39:25,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:39:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:39:25,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:39:25,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2019-10-02 00:39:25,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 00:39:25,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 00:39:25,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-10-02 00:39:25,424 INFO L87 Difference]: Start difference. First operand 406 states and 495 transitions. Second operand 23 states. [2019-10-02 00:39:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:27,102 INFO L93 Difference]: Finished difference Result 676 states and 825 transitions. [2019-10-02 00:39:27,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 00:39:27,103 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-10-02 00:39:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:27,105 INFO L225 Difference]: With dead ends: 676 [2019-10-02 00:39:27,105 INFO L226 Difference]: Without dead ends: 674 [2019-10-02 00:39:27,106 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=352, Invalid=1810, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 00:39:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-10-02 00:39:27,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 500. [2019-10-02 00:39:27,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-10-02 00:39:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 619 transitions. [2019-10-02 00:39:27,204 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 619 transitions. Word has length 50 [2019-10-02 00:39:27,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:27,204 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 619 transitions. [2019-10-02 00:39:27,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 00:39:27,204 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 619 transitions. [2019-10-02 00:39:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 00:39:27,206 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:27,206 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:27,206 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:27,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:27,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1475969496, now seen corresponding path program 1 times [2019-10-02 00:39:27,206 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:27,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:27,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:27,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:39:27,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 00:39:27,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:39:27,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 00:39:27,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 00:39:27,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 00:39:27,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 00:39:27,252 INFO L87 Difference]: Start difference. First operand 500 states and 619 transitions. Second operand 4 states. [2019-10-02 00:39:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:27,393 INFO L93 Difference]: Finished difference Result 572 states and 705 transitions. [2019-10-02 00:39:27,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:39:27,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-10-02 00:39:27,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:27,396 INFO L225 Difference]: With dead ends: 572 [2019-10-02 00:39:27,396 INFO L226 Difference]: Without dead ends: 500 [2019-10-02 00:39:27,397 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:39:27,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-10-02 00:39:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 427. [2019-10-02 00:39:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-10-02 00:39:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 528 transitions. [2019-10-02 00:39:27,482 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 528 transitions. Word has length 53 [2019-10-02 00:39:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:27,483 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 528 transitions. [2019-10-02 00:39:27,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 00:39:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 528 transitions. [2019-10-02 00:39:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 00:39:27,485 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:27,486 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:27,486 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:27,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:27,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1627206315, now seen corresponding path program 1 times [2019-10-02 00:39:27,486 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:27,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:27,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:27,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:39:27,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 00:39:27,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:39:27,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:39:27,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:39:27,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:39:27,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:39:27,524 INFO L87 Difference]: Start difference. First operand 427 states and 528 transitions. Second operand 3 states. [2019-10-02 00:39:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:27,606 INFO L93 Difference]: Finished difference Result 487 states and 599 transitions. [2019-10-02 00:39:27,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:39:27,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-02 00:39:27,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:27,608 INFO L225 Difference]: With dead ends: 487 [2019-10-02 00:39:27,608 INFO L226 Difference]: Without dead ends: 362 [2019-10-02 00:39:27,609 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 00:39:27,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-10-02 00:39:27,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 359. [2019-10-02 00:39:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-10-02 00:39:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 443 transitions. [2019-10-02 00:39:27,680 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 443 transitions. Word has length 55 [2019-10-02 00:39:27,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:27,681 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 443 transitions. [2019-10-02 00:39:27,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:39:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 443 transitions. [2019-10-02 00:39:27,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 00:39:27,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:27,683 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:27,683 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:27,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:27,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1704694390, now seen corresponding path program 1 times [2019-10-02 00:39:27,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:27,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:27,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:27,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:39:27,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 00:39:27,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:39:27,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:39:27,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:39:27,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:39:27,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:39:27,706 INFO L87 Difference]: Start difference. First operand 359 states and 443 transitions. Second operand 3 states. [2019-10-02 00:39:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:27,816 INFO L93 Difference]: Finished difference Result 545 states and 674 transitions. [2019-10-02 00:39:27,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:39:27,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-02 00:39:27,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:27,819 INFO L225 Difference]: With dead ends: 545 [2019-10-02 00:39:27,819 INFO L226 Difference]: Without dead ends: 383 [2019-10-02 00:39:27,820 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 00:39:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-02 00:39:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 320. [2019-10-02 00:39:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:39:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 387 transitions. [2019-10-02 00:39:27,899 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 387 transitions. Word has length 57 [2019-10-02 00:39:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:27,899 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 387 transitions. [2019-10-02 00:39:27,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:39:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 387 transitions. [2019-10-02 00:39:27,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 00:39:27,901 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:27,902 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:27,902 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:27,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:27,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1290180341, now seen corresponding path program 4 times [2019-10-02 00:39:27,903 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:27,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:27,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:27,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:39:27,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 00:39:28,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:39:28,071 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:39:28,115 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:39:28,146 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:39:28,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:39:28,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 00:39:28,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:39:28,189 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 13 treesize of output 9 [2019-10-02 00:39:28,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:28,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:28,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:39:28,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-02 00:39:28,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:39:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 00:39:28,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:39:28,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-10-02 00:39:28,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 00:39:28,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 00:39:28,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-10-02 00:39:28,519 INFO L87 Difference]: Start difference. First operand 320 states and 387 transitions. Second operand 24 states. [2019-10-02 00:39:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:31,062 INFO L93 Difference]: Finished difference Result 650 states and 778 transitions. [2019-10-02 00:39:31,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-02 00:39:31,063 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2019-10-02 00:39:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:31,066 INFO L225 Difference]: With dead ends: 650 [2019-10-02 00:39:31,066 INFO L226 Difference]: Without dead ends: 648 [2019-10-02 00:39:31,068 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=535, Invalid=3371, Unknown=0, NotChecked=0, Total=3906 [2019-10-02 00:39:31,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-02 00:39:31,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 471. [2019-10-02 00:39:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-10-02 00:39:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 577 transitions. [2019-10-02 00:39:31,195 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 577 transitions. Word has length 59 [2019-10-02 00:39:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:31,196 INFO L475 AbstractCegarLoop]: Abstraction has 471 states and 577 transitions. [2019-10-02 00:39:31,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 00:39:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 577 transitions. [2019-10-02 00:39:31,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 00:39:31,198 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:31,198 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:31,198 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:31,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:31,199 INFO L82 PathProgramCache]: Analyzing trace with hash -638092361, now seen corresponding path program 2 times [2019-10-02 00:39:31,199 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:31,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:31,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:31,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:39:31,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 00:39:31,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:39:31,409 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:39:31,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:39:31,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:39:31,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:39:31,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 00:39:31,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:39:31,539 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 13 treesize of output 9 [2019-10-02 00:39:31,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:31,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:31,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:39:31,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-10-02 00:39:31,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:39:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 00:39:31,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:39:31,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-10-02 00:39:31,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 00:39:31,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 00:39:31,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2019-10-02 00:39:31,899 INFO L87 Difference]: Start difference. First operand 471 states and 577 transitions. Second operand 22 states. [2019-10-02 00:39:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:33,003 INFO L93 Difference]: Finished difference Result 550 states and 662 transitions. [2019-10-02 00:39:33,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 00:39:33,004 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2019-10-02 00:39:33,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:33,007 INFO L225 Difference]: With dead ends: 550 [2019-10-02 00:39:33,007 INFO L226 Difference]: Without dead ends: 534 [2019-10-02 00:39:33,008 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=223, Invalid=967, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 00:39:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-02 00:39:33,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 476. [2019-10-02 00:39:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-02 00:39:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 583 transitions. [2019-10-02 00:39:33,134 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 583 transitions. Word has length 59 [2019-10-02 00:39:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:33,135 INFO L475 AbstractCegarLoop]: Abstraction has 476 states and 583 transitions. [2019-10-02 00:39:33,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 00:39:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 583 transitions. [2019-10-02 00:39:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 00:39:33,138 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:33,138 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:33,138 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:33,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:33,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1033186730, now seen corresponding path program 5 times [2019-10-02 00:39:33,139 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:33,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:33,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:33,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:39:33,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 54 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 00:39:33,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:39:33,566 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:39:33,618 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:39:33,659 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-02 00:39:33,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:39:33,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 00:39:33,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:39:33,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:39:33,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:39:33,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:39:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 75 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 00:39:33,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:39:33,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-10-02 00:39:33,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 00:39:33,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 00:39:33,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-10-02 00:39:33,977 INFO L87 Difference]: Start difference. First operand 476 states and 583 transitions. Second operand 22 states. [2019-10-02 00:39:34,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:34,462 INFO L93 Difference]: Finished difference Result 769 states and 918 transitions. [2019-10-02 00:39:34,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 00:39:34,462 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2019-10-02 00:39:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:34,464 INFO L225 Difference]: With dead ends: 769 [2019-10-02 00:39:34,465 INFO L226 Difference]: Without dead ends: 485 [2019-10-02 00:39:34,465 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2019-10-02 00:39:34,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-10-02 00:39:34,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 467. [2019-10-02 00:39:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-10-02 00:39:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 563 transitions. [2019-10-02 00:39:34,578 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 563 transitions. Word has length 68 [2019-10-02 00:39:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:34,578 INFO L475 AbstractCegarLoop]: Abstraction has 467 states and 563 transitions. [2019-10-02 00:39:34,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 00:39:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 563 transitions. [2019-10-02 00:39:34,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 00:39:34,580 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:34,581 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:34,581 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:34,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:34,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1503533126, now seen corresponding path program 1 times [2019-10-02 00:39:34,581 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:34,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:34,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:34,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:39:34,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 00:39:34,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:39:34,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:39:34,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:39:34,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:39:34,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:39:34,612 INFO L87 Difference]: Start difference. First operand 467 states and 563 transitions. Second operand 3 states. [2019-10-02 00:39:34,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:34,747 INFO L93 Difference]: Finished difference Result 565 states and 680 transitions. [2019-10-02 00:39:34,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:39:34,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-02 00:39:34,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:34,750 INFO L225 Difference]: With dead ends: 565 [2019-10-02 00:39:34,750 INFO L226 Difference]: Without dead ends: 426 [2019-10-02 00:39:34,753 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 00:39:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-10-02 00:39:34,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 422. [2019-10-02 00:39:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-10-02 00:39:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 506 transitions. [2019-10-02 00:39:34,857 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 506 transitions. Word has length 71 [2019-10-02 00:39:34,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:34,857 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 506 transitions. [2019-10-02 00:39:34,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:39:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 506 transitions. [2019-10-02 00:39:34,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 00:39:34,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:34,859 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:34,860 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:34,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:34,860 INFO L82 PathProgramCache]: Analyzing trace with hash -302205992, now seen corresponding path program 6 times [2019-10-02 00:39:34,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:34,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:34,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:34,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:39:34,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 15 proven. 69 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 00:39:35,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:39:35,073 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:39:35,121 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:39:35,204 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-10-02 00:39:35,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:39:35,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 00:39:35,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:39:35,237 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 16 treesize of output 12 [2019-10-02 00:39:35,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:35,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:35,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:39:35,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-02 00:39:35,304 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-10-02 00:39:35,304 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 26 treesize of output 25 [2019-10-02 00:39:35,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:35,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:35,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:39:35,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2019-10-02 00:39:35,323 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-10-02 00:39:35,323 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 26 treesize of output 25 [2019-10-02 00:39:35,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:35,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:35,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:39:35,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2019-10-02 00:39:35,346 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-10-02 00:39:35,346 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 26 treesize of output 25 [2019-10-02 00:39:35,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:35,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:35,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:39:35,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2019-10-02 00:39:35,372 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-10-02 00:39:35,373 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 26 treesize of output 25 [2019-10-02 00:39:35,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:35,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:35,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:39:35,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2019-10-02 00:39:35,398 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:35,399 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 26 treesize of output 57 [2019-10-02 00:39:35,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:35,425 INFO L567 ElimStorePlain]: treesize reduction 32, result has 46.7 percent of original size [2019-10-02 00:39:35,426 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-02 00:39:35,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-10-02 00:39:35,670 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:39:35,824 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-10-02 00:39:47,912 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-10-02 00:39:48,454 WARN L191 SmtUtils]: Spent 516.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-10-02 00:39:49,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:39:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 50 proven. 47 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 00:39:49,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:39:49,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-10-02 00:39:49,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 00:39:49,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 00:39:49,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=625, Unknown=1, NotChecked=0, Total=702 [2019-10-02 00:39:49,564 INFO L87 Difference]: Start difference. First operand 422 states and 506 transitions. Second operand 27 states. [2019-10-02 00:39:51,649 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-10-02 00:39:52,051 WARN L191 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-10-02 00:39:54,650 WARN L191 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-10-02 00:39:55,182 WARN L191 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-10-02 00:39:55,664 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-10-02 00:39:56,382 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-10-02 00:39:57,142 WARN L191 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-10-02 00:39:57,786 WARN L191 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-10-02 00:39:58,163 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-10-02 00:39:58,785 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-10-02 00:39:59,731 WARN L191 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-10-02 00:40:00,041 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-10-02 00:40:00,414 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-10-02 00:40:00,977 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-10-02 00:40:01,543 WARN L191 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-10-02 00:40:03,922 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 00:40:06,445 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-10-02 00:40:06,696 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-10-02 00:40:07,651 WARN L191 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-10-02 00:40:08,452 WARN L191 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-10-02 00:40:09,055 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-10-02 00:40:09,852 WARN L191 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-10-02 00:40:10,439 WARN L191 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-10-02 00:40:12,310 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-10-02 00:40:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:16,509 INFO L93 Difference]: Finished difference Result 688 states and 796 transitions. [2019-10-02 00:40:16,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-02 00:40:16,509 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 75 [2019-10-02 00:40:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:16,512 INFO L225 Difference]: With dead ends: 688 [2019-10-02 00:40:16,512 INFO L226 Difference]: Without dead ends: 616 [2019-10-02 00:40:16,515 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3152 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=938, Invalid=8763, Unknown=1, NotChecked=0, Total=9702 [2019-10-02 00:40:16,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-10-02 00:40:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 305. [2019-10-02 00:40:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-10-02 00:40:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 351 transitions. [2019-10-02 00:40:16,592 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 351 transitions. Word has length 75 [2019-10-02 00:40:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:16,593 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 351 transitions. [2019-10-02 00:40:16,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 00:40:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 351 transitions. [2019-10-02 00:40:16,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 00:40:16,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:16,595 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:16,595 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:16,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:16,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1484590890, now seen corresponding path program 4 times [2019-10-02 00:40:16,595 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:16,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:16,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:16,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:40:16,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 00:40:16,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:16,794 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:16,876 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:40:16,920 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:40:16,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:40:16,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 00:40:16,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:16,999 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 16 treesize of output 12 [2019-10-02 00:40:17,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:17,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:17,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:17,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-02 00:40:17,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:17,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:40:17,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:17,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:17,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:17,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:40:17,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:17,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:40:17,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:17,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:17,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:17,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:40:17,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:17,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:40:17,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:17,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:17,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:17,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:40:17,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:17,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:40:17,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:17,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:17,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:17,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-02 00:40:17,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:40:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 00:40:17,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:17,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2019-10-02 00:40:17,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 00:40:17,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 00:40:17,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-10-02 00:40:17,640 INFO L87 Difference]: Start difference. First operand 305 states and 351 transitions. Second operand 29 states. [2019-10-02 00:40:22,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:22,057 INFO L93 Difference]: Finished difference Result 775 states and 922 transitions. [2019-10-02 00:40:22,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-02 00:40:22,057 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2019-10-02 00:40:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:22,062 INFO L225 Difference]: With dead ends: 775 [2019-10-02 00:40:22,062 INFO L226 Difference]: Without dead ends: 773 [2019-10-02 00:40:22,066 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 54 SyntacticMatches, 13 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2639 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=938, Invalid=7072, Unknown=0, NotChecked=0, Total=8010 [2019-10-02 00:40:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-10-02 00:40:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 571. [2019-10-02 00:40:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-02 00:40:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 698 transitions. [2019-10-02 00:40:22,221 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 698 transitions. Word has length 75 [2019-10-02 00:40:22,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:22,221 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 698 transitions. [2019-10-02 00:40:22,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 00:40:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 698 transitions. [2019-10-02 00:40:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 00:40:22,224 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:22,225 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:22,225 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:22,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:22,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1356787031, now seen corresponding path program 7 times [2019-10-02 00:40:22,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:22,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:22,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:22,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:40:22,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 00:40:22,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:22,493 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:22,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:40:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:22,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 00:40:22,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:22,695 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 16 treesize of output 12 [2019-10-02 00:40:22,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:22,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:22,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:22,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-02 00:40:22,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:22,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:40:22,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:22,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:22,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:22,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:40:22,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:22,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:40:22,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:22,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:22,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:22,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:40:22,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:22,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:40:22,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:22,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:22,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:22,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-10-02 00:40:23,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:40:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 00:40:23,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:23,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2019-10-02 00:40:23,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 00:40:23,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 00:40:23,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2019-10-02 00:40:23,429 INFO L87 Difference]: Start difference. First operand 571 states and 698 transitions. Second operand 30 states. [2019-10-02 00:40:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:26,405 INFO L93 Difference]: Finished difference Result 729 states and 876 transitions. [2019-10-02 00:40:26,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 00:40:26,405 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 84 [2019-10-02 00:40:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:26,408 INFO L225 Difference]: With dead ends: 729 [2019-10-02 00:40:26,409 INFO L226 Difference]: Without dead ends: 699 [2019-10-02 00:40:26,411 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 60 SyntacticMatches, 14 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1291 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=523, Invalid=3767, Unknown=0, NotChecked=0, Total=4290 [2019-10-02 00:40:26,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-10-02 00:40:26,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 588. [2019-10-02 00:40:26,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-02 00:40:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 717 transitions. [2019-10-02 00:40:26,617 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 717 transitions. Word has length 84 [2019-10-02 00:40:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:26,617 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 717 transitions. [2019-10-02 00:40:26,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 00:40:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 717 transitions. [2019-10-02 00:40:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 00:40:26,620 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:26,620 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:26,620 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:26,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:26,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1331257577, now seen corresponding path program 5 times [2019-10-02 00:40:26,621 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:26,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:26,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:26,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:40:26,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 44 proven. 69 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 00:40:26,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:26,860 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:26,922 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:40:26,990 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-02 00:40:26,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:40:26,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 00:40:26,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:27,010 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 16 treesize of output 12 [2019-10-02 00:40:27,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:27,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:27,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:27,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-02 00:40:27,027 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-02 00:40:27,038 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:40:27,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 57 treesize of output 61 [2019-10-02 00:40:27,039 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:27,051 INFO L567 ElimStorePlain]: treesize reduction 33, result has 43.1 percent of original size [2019-10-02 00:40:27,051 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:27,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:27,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:27,065 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2019-10-02 00:40:27,075 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-02 00:40:27,089 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:40:27,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 57 treesize of output 61 [2019-10-02 00:40:27,090 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:27,106 INFO L567 ElimStorePlain]: treesize reduction 33, result has 43.1 percent of original size [2019-10-02 00:40:27,107 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:27,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:27,118 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-02 00:40:27,119 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:22 [2019-10-02 00:40:27,128 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-02 00:40:27,141 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:40:27,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 57 treesize of output 61 [2019-10-02 00:40:27,142 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:27,158 INFO L567 ElimStorePlain]: treesize reduction 33, result has 43.1 percent of original size [2019-10-02 00:40:27,158 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:27,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:27,169 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-02 00:40:27,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:22 [2019-10-02 00:40:27,184 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-02 00:40:27,204 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:40:27,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 57 treesize of output 61 [2019-10-02 00:40:27,205 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:27,222 INFO L567 ElimStorePlain]: treesize reduction 33, result has 43.1 percent of original size [2019-10-02 00:40:27,222 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:27,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:27,233 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-02 00:40:27,233 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:34 [2019-10-02 00:40:29,580 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2019-10-02 00:40:42,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:40:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 62 proven. 69 refuted. 32 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 00:40:42,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:42,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 26 [2019-10-02 00:40:42,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 00:40:42,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 00:40:42,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=538, Unknown=6, NotChecked=0, Total=650 [2019-10-02 00:40:42,905 INFO L87 Difference]: Start difference. First operand 588 states and 717 transitions. Second operand 26 states. [2019-10-02 00:43:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:43:00,490 INFO L93 Difference]: Finished difference Result 812 states and 970 transitions. [2019-10-02 00:43:00,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-02 00:43:00,491 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2019-10-02 00:43:00,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:43:00,494 INFO L225 Difference]: With dead ends: 812 [2019-10-02 00:43:00,494 INFO L226 Difference]: Without dead ends: 743 [2019-10-02 00:43:00,497 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 63 SyntacticMatches, 17 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1801 ImplicationChecksByTransitivity, 94.0s TimeCoverageRelationStatistics Valid=780, Invalid=4579, Unknown=43, NotChecked=0, Total=5402 [2019-10-02 00:43:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-10-02 00:43:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 579. [2019-10-02 00:43:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-02 00:43:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 702 transitions. [2019-10-02 00:43:00,648 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 702 transitions. Word has length 84 [2019-10-02 00:43:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:43:00,648 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 702 transitions. [2019-10-02 00:43:00,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 00:43:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 702 transitions. [2019-10-02 00:43:00,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 00:43:00,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:43:00,651 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:43:00,651 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:43:00,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:43:00,651 INFO L82 PathProgramCache]: Analyzing trace with hash 320140327, now seen corresponding path program 6 times [2019-10-02 00:43:00,651 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:43:00,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:43:00,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:00,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:43:00,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:00,907 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 00:43:00,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:43:00,908 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:43:00,971 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:43:01,022 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 00:43:01,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:43:01,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 00:43:01,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:43:01,110 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 16 treesize of output 12 [2019-10-02 00:43:01,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-10-02 00:43:01,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:43:01,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-10-02 00:43:01,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,240 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2019-10-02 00:43:01,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,255 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-10-02 00:43:01,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,313 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 58 [2019-10-02 00:43:01,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2019-10-02 00:43:01,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,410 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 73 [2019-10-02 00:43:01,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:75 [2019-10-02 00:43:01,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,559 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 71 [2019-10-02 00:43:01,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2019-10-02 00:43:01,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,668 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 83 [2019-10-02 00:43:01,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:83, output treesize:79 [2019-10-02 00:43:01,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,790 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 78 treesize of output 95 [2019-10-02 00:43:01,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:92, output treesize:88 [2019-10-02 00:43:01,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:01,931 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 87 treesize of output 107 [2019-10-02 00:43:01,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:01,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:01,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:97 [2019-10-02 00:43:02,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:02,104 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:02,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 99 treesize of output 122 [2019-10-02 00:43:02,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:02,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:02,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:02,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:109 [2019-10-02 00:43:02,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:02,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:02,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:03,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:03,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,093 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 00:43:03,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:03,114 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:03,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 113 treesize of output 50 [2019-10-02 00:43:03,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:03,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:03,120 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-02 00:43:03,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:120, output treesize:6 [2019-10-02 00:43:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-02 00:43:03,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:43:03,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 34 [2019-10-02 00:43:03,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 00:43:03,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 00:43:03,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1019, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 00:43:03,199 INFO L87 Difference]: Start difference. First operand 579 states and 702 transitions. Second operand 34 states. [2019-10-02 00:43:05,091 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-10-02 00:43:10,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:43:10,911 INFO L93 Difference]: Finished difference Result 900 states and 1095 transitions. [2019-10-02 00:43:10,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-02 00:43:10,912 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 84 [2019-10-02 00:43:10,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:43:10,914 INFO L225 Difference]: With dead ends: 900 [2019-10-02 00:43:10,915 INFO L226 Difference]: Without dead ends: 802 [2019-10-02 00:43:10,916 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1014, Invalid=8886, Unknown=0, NotChecked=0, Total=9900 [2019-10-02 00:43:10,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-10-02 00:43:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 610. [2019-10-02 00:43:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-02 00:43:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 735 transitions. [2019-10-02 00:43:11,105 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 735 transitions. Word has length 84 [2019-10-02 00:43:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:43:11,105 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 735 transitions. [2019-10-02 00:43:11,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 00:43:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 735 transitions. [2019-10-02 00:43:11,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 00:43:11,107 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:43:11,107 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:43:11,107 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:43:11,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:43:11,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1014379099, now seen corresponding path program 2 times [2019-10-02 00:43:11,107 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:43:11,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:43:11,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:11,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:43:11,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 00:43:11,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:43:11,305 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:43:11,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:43:11,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:43:11,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:43:11,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 00:43:11,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:43:11,488 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 16 treesize of output 12 [2019-10-02 00:43:11,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:11,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:11,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:11,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:43:11,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:11,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:43:11,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:11,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:11,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:11,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:43:11,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:11,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:43:11,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:11,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:11,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:11,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-02 00:43:11,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:11,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:11,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:11,586 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:11,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-10-02 00:43:11,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:11,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:11,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:11,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-02 00:43:12,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 00:43:12,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:43:12,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2019-10-02 00:43:12,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 00:43:12,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 00:43:12,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2019-10-02 00:43:12,261 INFO L87 Difference]: Start difference. First operand 610 states and 735 transitions. Second operand 30 states. [2019-10-02 00:43:16,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:43:16,429 INFO L93 Difference]: Finished difference Result 952 states and 1133 transitions. [2019-10-02 00:43:16,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-10-02 00:43:16,429 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 84 [2019-10-02 00:43:16,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:43:16,432 INFO L225 Difference]: With dead ends: 952 [2019-10-02 00:43:16,433 INFO L226 Difference]: Without dead ends: 900 [2019-10-02 00:43:16,433 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 59 SyntacticMatches, 14 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2596 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=903, Invalid=6579, Unknown=0, NotChecked=0, Total=7482 [2019-10-02 00:43:16,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-10-02 00:43:16,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 662. [2019-10-02 00:43:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-10-02 00:43:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 795 transitions. [2019-10-02 00:43:16,609 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 795 transitions. Word has length 84 [2019-10-02 00:43:16,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:43:16,609 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 795 transitions. [2019-10-02 00:43:16,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 00:43:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 795 transitions. [2019-10-02 00:43:16,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 00:43:16,611 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:43:16,611 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:43:16,611 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:43:16,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:43:16,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1343309979, now seen corresponding path program 3 times [2019-10-02 00:43:16,612 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:43:16,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:43:16,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:16,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:43:16,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:16,801 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 48 proven. 11 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-02 00:43:16,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:43:16,802 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:43:16,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:43:16,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 00:43:16,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:43:16,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 00:43:16,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:43:17,001 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 16 treesize of output 12 [2019-10-02 00:43:17,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-10-02 00:43:17,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:43:17,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-10-02 00:43:17,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,103 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2019-10-02 00:43:17,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-10-02 00:43:17,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,168 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 58 [2019-10-02 00:43:17,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2019-10-02 00:43:17,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,250 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 73 [2019-10-02 00:43:17,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:75 [2019-10-02 00:43:17,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,406 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 71 [2019-10-02 00:43:17,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,429 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2019-10-02 00:43:17,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,507 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 86 [2019-10-02 00:43:17,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:86, output treesize:82 [2019-10-02 00:43:17,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,640 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 98 [2019-10-02 00:43:17,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:95, output treesize:91 [2019-10-02 00:43:17,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,773 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 93 treesize of output 113 [2019-10-02 00:43:17,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:17,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:103 [2019-10-02 00:43:17,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:17,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:17,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 128 [2019-10-02 00:43:17,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:18,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:18,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:18,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:119, output treesize:115 [2019-10-02 00:43:18,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:18,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:18,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:18,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:18,548 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-10-02 00:43:18,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-02 00:43:18,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:43:18,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20] total 28 [2019-10-02 00:43:18,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 00:43:18,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 00:43:18,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-10-02 00:43:18,681 INFO L87 Difference]: Start difference. First operand 662 states and 795 transitions. Second operand 28 states. [2019-10-02 00:43:21,003 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-10-02 00:43:21,251 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-10-02 00:43:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:43:21,595 INFO L93 Difference]: Finished difference Result 898 states and 1096 transitions. [2019-10-02 00:43:21,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 00:43:21,595 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 84 [2019-10-02 00:43:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:43:21,598 INFO L225 Difference]: With dead ends: 898 [2019-10-02 00:43:21,598 INFO L226 Difference]: Without dead ends: 728 [2019-10-02 00:43:21,599 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 00:43:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-10-02 00:43:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 653. [2019-10-02 00:43:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-10-02 00:43:21,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 768 transitions. [2019-10-02 00:43:21,768 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 768 transitions. Word has length 84 [2019-10-02 00:43:21,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:43:21,768 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 768 transitions. [2019-10-02 00:43:21,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 00:43:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 768 transitions. [2019-10-02 00:43:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 00:43:21,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:43:21,771 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:43:21,771 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:43:21,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:43:21,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1263690459, now seen corresponding path program 4 times [2019-10-02 00:43:21,772 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:43:21,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:43:21,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:21,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:43:21,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 12 proven. 102 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 00:43:22,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:43:22,055 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:43:22,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:43:22,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:43:22,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:43:22,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 00:43:22,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:43:22,322 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 16 treesize of output 12 [2019-10-02 00:43:22,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:22,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:22,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:22,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-02 00:43:22,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:22,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:43:22,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:22,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:22,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:22,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:43:22,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:22,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:43:22,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:22,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:22,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:22,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-02 00:43:22,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:22,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:22,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:22,467 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:22,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-10-02 00:43:22,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:22,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:22,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:22,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-02 00:43:23,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 00:43:23,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:43:23,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2019-10-02 00:43:23,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 00:43:23,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 00:43:23,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2019-10-02 00:43:23,423 INFO L87 Difference]: Start difference. First operand 653 states and 768 transitions. Second operand 32 states. [2019-10-02 00:43:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:43:28,285 INFO L93 Difference]: Finished difference Result 898 states and 1043 transitions. [2019-10-02 00:43:28,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-10-02 00:43:28,285 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 84 [2019-10-02 00:43:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:43:28,289 INFO L225 Difference]: With dead ends: 898 [2019-10-02 00:43:28,289 INFO L226 Difference]: Without dead ends: 896 [2019-10-02 00:43:28,290 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 59 SyntacticMatches, 14 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3873 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1309, Invalid=9821, Unknown=0, NotChecked=0, Total=11130 [2019-10-02 00:43:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2019-10-02 00:43:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 636. [2019-10-02 00:43:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-02 00:43:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 749 transitions. [2019-10-02 00:43:28,435 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 749 transitions. Word has length 84 [2019-10-02 00:43:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:43:28,435 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 749 transitions. [2019-10-02 00:43:28,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 00:43:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 749 transitions. [2019-10-02 00:43:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 00:43:28,437 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:43:28,437 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:43:28,437 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:43:28,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:43:28,437 INFO L82 PathProgramCache]: Analyzing trace with hash -912745354, now seen corresponding path program 8 times [2019-10-02 00:43:28,437 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:43:28,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:43:28,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:28,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:43:28,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 21 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 00:43:28,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:43:28,790 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:43:28,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:43:28,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:43:28,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:43:28,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 00:43:28,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:43:29,042 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 16 treesize of output 12 [2019-10-02 00:43:29,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:29,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:29,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:29,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-02 00:43:29,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:29,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:43:29,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:29,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:29,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:29,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:43:29,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:29,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:43:29,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:29,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:29,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:29,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-10-02 00:43:29,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:29,938 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 21 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 00:43:29,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:43:29,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2019-10-02 00:43:29,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 00:43:29,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 00:43:29,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2019-10-02 00:43:29,943 INFO L87 Difference]: Start difference. First operand 636 states and 749 transitions. Second operand 32 states. [2019-10-02 00:43:33,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:43:33,469 INFO L93 Difference]: Finished difference Result 803 states and 939 transitions. [2019-10-02 00:43:33,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 00:43:33,470 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 93 [2019-10-02 00:43:33,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:43:33,475 INFO L225 Difference]: With dead ends: 803 [2019-10-02 00:43:33,475 INFO L226 Difference]: Without dead ends: 773 [2019-10-02 00:43:33,476 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 66 SyntacticMatches, 15 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1621 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=599, Invalid=4657, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 00:43:33,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-10-02 00:43:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 654. [2019-10-02 00:43:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-10-02 00:43:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 770 transitions. [2019-10-02 00:43:33,815 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 770 transitions. Word has length 93 [2019-10-02 00:43:33,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:43:33,816 INFO L475 AbstractCegarLoop]: Abstraction has 654 states and 770 transitions. [2019-10-02 00:43:33,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 00:43:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 770 transitions. [2019-10-02 00:43:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 00:43:33,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:43:33,819 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:43:33,819 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:43:33,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:43:33,820 INFO L82 PathProgramCache]: Analyzing trace with hash 678658422, now seen corresponding path program 7 times [2019-10-02 00:43:33,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:43:33,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:43:33,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:33,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:43:33,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 21 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 00:43:34,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:43:34,118 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:43:34,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:43:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:34,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 00:43:34,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:43:34,374 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 16 treesize of output 12 [2019-10-02 00:43:34,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:34,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:34,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:34,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-02 00:43:34,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:34,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:43:34,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:34,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:34,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:34,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:43:34,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:34,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:43:34,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:34,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:34,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:34,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-10-02 00:43:35,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 21 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 00:43:35,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:43:35,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2019-10-02 00:43:35,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 00:43:35,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 00:43:35,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2019-10-02 00:43:35,307 INFO L87 Difference]: Start difference. First operand 654 states and 770 transitions. Second operand 32 states. [2019-10-02 00:43:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:43:41,875 INFO L93 Difference]: Finished difference Result 1001 states and 1174 transitions. [2019-10-02 00:43:41,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-02 00:43:41,876 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 93 [2019-10-02 00:43:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:43:41,879 INFO L225 Difference]: With dead ends: 1001 [2019-10-02 00:43:41,879 INFO L226 Difference]: Without dead ends: 969 [2019-10-02 00:43:41,881 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 66 SyntacticMatches, 15 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2280 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=890, Invalid=7852, Unknown=0, NotChecked=0, Total=8742 [2019-10-02 00:43:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-10-02 00:43:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 653. [2019-10-02 00:43:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-10-02 00:43:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 767 transitions. [2019-10-02 00:43:42,060 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 767 transitions. Word has length 93 [2019-10-02 00:43:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:43:42,060 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 767 transitions. [2019-10-02 00:43:42,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 00:43:42,060 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 767 transitions. [2019-10-02 00:43:42,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 00:43:42,061 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:43:42,062 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:43:42,062 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:43:42,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:43:42,062 INFO L82 PathProgramCache]: Analyzing trace with hash 739908986, now seen corresponding path program 5 times [2019-10-02 00:43:42,062 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:43:42,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:43:42,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:42,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:43:42,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 21 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 00:43:42,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:43:42,291 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:43:42,379 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:43:42,486 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-10-02 00:43:42,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:43:42,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 00:43:42,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:43:42,579 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 16 treesize of output 12 [2019-10-02 00:43:42,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:42,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:42,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:42,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-02 00:43:42,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:42,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:43:42,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:42,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:42,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:42,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:43:42,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:42,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:43:42,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:42,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:42,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:42,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-10-02 00:43:42,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:42,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:42,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:42,685 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:42,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-10-02 00:43:42,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:42,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:42,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:42,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-10-02 00:43:43,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 74 proven. 96 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-02 00:43:43,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:43:43,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2019-10-02 00:43:43,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 00:43:43,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 00:43:43,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2019-10-02 00:43:43,560 INFO L87 Difference]: Start difference. First operand 653 states and 767 transitions. Second operand 32 states. [2019-10-02 00:43:50,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:43:50,925 INFO L93 Difference]: Finished difference Result 981 states and 1147 transitions. [2019-10-02 00:43:50,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-10-02 00:43:50,925 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 93 [2019-10-02 00:43:50,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:43:50,929 INFO L225 Difference]: With dead ends: 981 [2019-10-02 00:43:50,929 INFO L226 Difference]: Without dead ends: 925 [2019-10-02 00:43:50,931 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 67 SyntacticMatches, 13 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5165 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1242, Invalid=13520, Unknown=0, NotChecked=0, Total=14762 [2019-10-02 00:43:50,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-10-02 00:43:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 686. [2019-10-02 00:43:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-10-02 00:43:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 807 transitions. [2019-10-02 00:43:51,128 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 807 transitions. Word has length 93 [2019-10-02 00:43:51,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:43:51,128 INFO L475 AbstractCegarLoop]: Abstraction has 686 states and 807 transitions. [2019-10-02 00:43:51,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 00:43:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 807 transitions. [2019-10-02 00:43:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 00:43:51,129 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:43:51,129 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:43:51,130 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:43:51,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:43:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2075713978, now seen corresponding path program 2 times [2019-10-02 00:43:51,130 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:43:51,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:43:51,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:51,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:43:51,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-02 00:43:51,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:43:51,388 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:43:51,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:43:51,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:43:51,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:43:51,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-02 00:43:51,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:43:51,569 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 16 treesize of output 12 [2019-10-02 00:43:51,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:51,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:51,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:51,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-02 00:43:51,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:51,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:43:51,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:51,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:51,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:51,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-02 00:43:51,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:51,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:51,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:51,648 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:51,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-10-02 00:43:51,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:51,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:51,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:51,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-02 00:43:52,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 00:43:52,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:43:52,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20] total 28 [2019-10-02 00:43:52,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 00:43:52,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 00:43:52,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2019-10-02 00:43:52,277 INFO L87 Difference]: Start difference. First operand 686 states and 807 transitions. Second operand 28 states. [2019-10-02 00:43:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:43:54,833 INFO L93 Difference]: Finished difference Result 977 states and 1129 transitions. [2019-10-02 00:43:54,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 00:43:54,834 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 93 [2019-10-02 00:43:54,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:43:54,837 INFO L225 Difference]: With dead ends: 977 [2019-10-02 00:43:54,837 INFO L226 Difference]: Without dead ends: 807 [2019-10-02 00:43:54,838 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 63 SyntacticMatches, 22 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=363, Invalid=2289, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 00:43:54,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-10-02 00:43:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 744. [2019-10-02 00:43:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-10-02 00:43:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 855 transitions. [2019-10-02 00:43:55,032 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 855 transitions. Word has length 93 [2019-10-02 00:43:55,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:43:55,032 INFO L475 AbstractCegarLoop]: Abstraction has 744 states and 855 transitions. [2019-10-02 00:43:55,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 00:43:55,032 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 855 transitions. [2019-10-02 00:43:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 00:43:55,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:43:55,034 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:43:55,034 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:43:55,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:43:55,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1901775177, now seen corresponding path program 9 times [2019-10-02 00:43:55,035 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:43:55,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:43:55,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:55,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:43:55,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 24 proven. 165 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 00:43:55,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:43:55,290 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:43:55,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:43:55,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-02 00:43:55,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:43:55,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-02 00:43:55,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:43:55,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 16 treesize of output 12 [2019-10-02 00:43:55,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:55,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:55,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:55,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-02 00:43:55,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:43:55,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:43:55,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:43:55,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:43:55,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:43:55,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-10-02 00:43:56,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 24 proven. 165 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 00:43:56,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:43:56,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2019-10-02 00:43:56,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 00:43:56,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 00:43:56,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 00:43:56,592 INFO L87 Difference]: Start difference. First operand 744 states and 855 transitions. Second operand 34 states. [2019-10-02 00:44:01,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:01,222 INFO L93 Difference]: Finished difference Result 950 states and 1090 transitions. [2019-10-02 00:44:01,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-02 00:44:01,223 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 102 [2019-10-02 00:44:01,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:01,228 INFO L225 Difference]: With dead ends: 950 [2019-10-02 00:44:01,228 INFO L226 Difference]: Without dead ends: 920 [2019-10-02 00:44:01,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 72 SyntacticMatches, 16 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2411 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=836, Invalid=6820, Unknown=0, NotChecked=0, Total=7656 [2019-10-02 00:44:01,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2019-10-02 00:44:01,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 762. [2019-10-02 00:44:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-10-02 00:44:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 876 transitions. [2019-10-02 00:44:01,436 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 876 transitions. Word has length 102 [2019-10-02 00:44:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:01,437 INFO L475 AbstractCegarLoop]: Abstraction has 762 states and 876 transitions. [2019-10-02 00:44:01,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 00:44:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 876 transitions. [2019-10-02 00:44:01,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 00:44:01,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:01,439 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:44:01,440 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:01,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:01,440 INFO L82 PathProgramCache]: Analyzing trace with hash -638483383, now seen corresponding path program 8 times [2019-10-02 00:44:01,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:01,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:01,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:01,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:44:01,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 24 proven. 165 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 00:44:01,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:44:01,708 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:44:01,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:44:01,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:44:01,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:44:01,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 00:44:01,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:44:01,977 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 16 treesize of output 12 [2019-10-02 00:44:01,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:44:01,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:01,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:44:01,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:44:02,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:02,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:44:02,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:44:02,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:02,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:44:02,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-02 00:44:02,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:44:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 24 proven. 165 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 00:44:02,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:44:02,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2019-10-02 00:44:02,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 00:44:02,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 00:44:02,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 00:44:02,929 INFO L87 Difference]: Start difference. First operand 762 states and 876 transitions. Second operand 33 states. [2019-10-02 00:44:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:11,015 INFO L93 Difference]: Finished difference Result 1325 states and 1524 transitions. [2019-10-02 00:44:11,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-10-02 00:44:11,015 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 102 [2019-10-02 00:44:11,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:11,021 INFO L225 Difference]: With dead ends: 1325 [2019-10-02 00:44:11,021 INFO L226 Difference]: Without dead ends: 1285 [2019-10-02 00:44:11,022 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 72 SyntacticMatches, 16 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8815 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2283, Invalid=20669, Unknown=0, NotChecked=0, Total=22952 [2019-10-02 00:44:11,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2019-10-02 00:44:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 806. [2019-10-02 00:44:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2019-10-02 00:44:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 925 transitions. [2019-10-02 00:44:11,237 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 925 transitions. Word has length 102 [2019-10-02 00:44:11,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:11,237 INFO L475 AbstractCegarLoop]: Abstraction has 806 states and 925 transitions. [2019-10-02 00:44:11,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 00:44:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 925 transitions. [2019-10-02 00:44:11,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 00:44:11,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:11,239 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:44:11,239 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:11,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:11,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2055290181, now seen corresponding path program 3 times [2019-10-02 00:44:11,239 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:11,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:11,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:11,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:44:11,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 16 proven. 173 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 00:44:11,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:44:11,486 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:44:11,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:44:11,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 00:44:11,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:44:11,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 00:44:11,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:44:11,735 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 16 treesize of output 12 [2019-10-02 00:44:11,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:44:11,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:11,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:44:11,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-10-02 00:44:11,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:11,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:44:11,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:44:11,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:11,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:44:11,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-10-02 00:44:11,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:11,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:11,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:11,843 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:11,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2019-10-02 00:44:11,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:44:11,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:11,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:44:11,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-10-02 00:44:11,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:11,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:11,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:11,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:11,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:11,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:11,936 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:11,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 58 [2019-10-02 00:44:11,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:44:11,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:11,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:44:11,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2019-10-02 00:44:12,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,030 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:12,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 73 [2019-10-02 00:44:12,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:44:12,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:12,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:44:12,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:75 [2019-10-02 00:44:12,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,179 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:12,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 71 [2019-10-02 00:44:12,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:44:12,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:12,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:44:12,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2019-10-02 00:44:12,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,289 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:12,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 83 [2019-10-02 00:44:12,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:44:12,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:12,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:44:12,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:83, output treesize:79 [2019-10-02 00:44:12,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,405 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:12,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 78 treesize of output 95 [2019-10-02 00:44:12,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:44:12,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:12,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:44:12,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:92, output treesize:88 [2019-10-02 00:44:12,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,568 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:12,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 110 [2019-10-02 00:44:12,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:44:12,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:12,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:44:12,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:100 [2019-10-02 00:44:12,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:44:12,726 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:12,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 102 treesize of output 125 [2019-10-02 00:44:12,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:44:12,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:12,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:44:12,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:116, output treesize:112 [2019-10-02 00:44:12,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:44:12,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:44:12,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:44:12,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:44:13,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:44:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-02 00:44:13,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:44:13,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2019-10-02 00:44:13,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 00:44:13,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 00:44:13,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 00:44:13,433 INFO L87 Difference]: Start difference. First operand 806 states and 925 transitions. Second operand 36 states. [2019-10-02 00:44:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:24,890 INFO L93 Difference]: Finished difference Result 1019 states and 1154 transitions. [2019-10-02 00:44:24,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-10-02 00:44:24,890 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 102 [2019-10-02 00:44:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:24,893 INFO L225 Difference]: With dead ends: 1019 [2019-10-02 00:44:24,893 INFO L226 Difference]: Without dead ends: 924 [2019-10-02 00:44:24,895 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7002 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1968, Invalid=18338, Unknown=0, NotChecked=0, Total=20306 [2019-10-02 00:44:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-10-02 00:44:25,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 789. [2019-10-02 00:44:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-10-02 00:44:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 893 transitions. [2019-10-02 00:44:25,104 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 893 transitions. Word has length 102 [2019-10-02 00:44:25,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:25,105 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 893 transitions. [2019-10-02 00:44:25,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 00:44:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 893 transitions. [2019-10-02 00:44:25,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-02 00:44:25,107 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:25,107 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:44:25,107 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:25,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:25,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1540512214, now seen corresponding path program 10 times [2019-10-02 00:44:25,108 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:25,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:25,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:25,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:44:25,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:25,382 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 18 proven. 216 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 00:44:25,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:44:25,383 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:44:25,539 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:44:25,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:44:25,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:44:25,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 00:44:25,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:44:25,703 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 13 treesize of output 9 [2019-10-02 00:44:25,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:44:25,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:25,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:44:25,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-02 00:44:26,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:44:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 00:44:26,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:44:26,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2019-10-02 00:44:26,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 00:44:26,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 00:44:26,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1123, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 00:44:26,790 INFO L87 Difference]: Start difference. First operand 789 states and 893 transitions. Second operand 36 states. [2019-10-02 00:44:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:41,467 INFO L93 Difference]: Finished difference Result 1614 states and 1846 transitions. [2019-10-02 00:44:41,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2019-10-02 00:44:41,468 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 111 [2019-10-02 00:44:41,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:41,474 INFO L225 Difference]: With dead ends: 1614 [2019-10-02 00:44:41,474 INFO L226 Difference]: Without dead ends: 1612 [2019-10-02 00:44:41,476 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 79 SyntacticMatches, 17 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24730 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=3947, Invalid=56815, Unknown=0, NotChecked=0, Total=60762 [2019-10-02 00:44:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2019-10-02 00:44:41,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 986. [2019-10-02 00:44:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2019-10-02 00:44:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1119 transitions. [2019-10-02 00:44:41,764 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1119 transitions. Word has length 111 [2019-10-02 00:44:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:41,764 INFO L475 AbstractCegarLoop]: Abstraction has 986 states and 1119 transitions. [2019-10-02 00:44:41,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 00:44:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1119 transitions. [2019-10-02 00:44:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-02 00:44:41,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:41,767 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:44:41,768 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:41,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:41,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1573610456, now seen corresponding path program 3 times [2019-10-02 00:44:41,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:41,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:41,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:41,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:44:41,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 27 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 00:44:42,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:44:42,075 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:44:42,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:44:42,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-02 00:44:42,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:44:42,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 00:44:42,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:44:42,381 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 13 treesize of output 9 [2019-10-02 00:44:42,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:44:42,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:44:42,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:44:42,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-02 00:47:12,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:47:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 27 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 00:47:13,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:47:13,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 30 [2019-10-02 00:47:13,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 00:47:13,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 00:47:13,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=766, Unknown=9, NotChecked=0, Total=870 [2019-10-02 00:47:13,076 INFO L87 Difference]: Start difference. First operand 986 states and 1119 transitions. Second operand 30 states. [2019-10-02 00:47:33,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:47:33,081 INFO L93 Difference]: Finished difference Result 1124 states and 1272 transitions. [2019-10-02 00:47:33,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 00:47:33,082 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 111 [2019-10-02 00:47:33,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:47:33,086 INFO L225 Difference]: With dead ends: 1124 [2019-10-02 00:47:33,086 INFO L226 Difference]: Without dead ends: 1108 [2019-10-02 00:47:33,088 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 83 SyntacticMatches, 18 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 155.6s TimeCoverageRelationStatistics Valid=466, Invalid=3683, Unknown=11, NotChecked=0, Total=4160 [2019-10-02 00:47:33,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2019-10-02 00:47:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 991. [2019-10-02 00:47:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-10-02 00:47:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1125 transitions. [2019-10-02 00:47:33,357 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1125 transitions. Word has length 111 [2019-10-02 00:47:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:47:33,357 INFO L475 AbstractCegarLoop]: Abstraction has 991 states and 1125 transitions. [2019-10-02 00:47:33,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 00:47:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1125 transitions. [2019-10-02 00:47:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 00:47:33,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:47:33,374 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:47:33,375 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:47:33,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:47:33,375 INFO L82 PathProgramCache]: Analyzing trace with hash 592451561, now seen corresponding path program 11 times [2019-10-02 00:47:33,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:47:33,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:47:33,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:33,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:47:33,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 229 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 00:47:34,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:47:34,320 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:47:34,435 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:47:34,548 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-02 00:47:34,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:47:34,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 00:47:34,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:47:34,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:47:34,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:47:34,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:47:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 275 proven. 9 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 00:47:35,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:47:35,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-10-02 00:47:35,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 00:47:35,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 00:47:35,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=834, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 00:47:35,082 INFO L87 Difference]: Start difference. First operand 991 states and 1125 transitions. Second operand 34 states. [2019-10-02 00:47:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:47:36,092 INFO L93 Difference]: Finished difference Result 1498 states and 1667 transitions. [2019-10-02 00:47:36,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 00:47:36,092 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 120 [2019-10-02 00:47:36,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:47:36,096 INFO L225 Difference]: With dead ends: 1498 [2019-10-02 00:47:36,096 INFO L226 Difference]: Without dead ends: 947 [2019-10-02 00:47:36,098 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=372, Invalid=1188, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 00:47:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-10-02 00:47:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 935. [2019-10-02 00:47:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-10-02 00:47:36,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1054 transitions. [2019-10-02 00:47:36,367 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1054 transitions. Word has length 120 [2019-10-02 00:47:36,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:47:36,367 INFO L475 AbstractCegarLoop]: Abstraction has 935 states and 1054 transitions. [2019-10-02 00:47:36,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 00:47:36,367 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1054 transitions. [2019-10-02 00:47:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 00:47:36,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:47:36,369 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 9, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:47:36,369 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:47:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:47:36,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1470923543, now seen corresponding path program 12 times [2019-10-02 00:47:36,370 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:47:36,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:47:36,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:36,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:47:36,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 30 proven. 269 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 00:47:36,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:47:36,751 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:47:36,890 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:47:37,090 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-02 00:47:37,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:47:37,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-02 00:47:37,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:47:37,156 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 16 treesize of output 12 [2019-10-02 00:47:37,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:47:37,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:47:37,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:47:37,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-02 00:47:37,256 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:47:37,257 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 29 treesize of output 28 [2019-10-02 00:47:37,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:47:37,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:47:37,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:47:37,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:47:37,280 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:47:37,281 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 29 treesize of output 28 [2019-10-02 00:47:37,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:47:37,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:47:37,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:47:37,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:47:37,301 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:47:37,302 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 29 treesize of output 28 [2019-10-02 00:47:37,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:47:37,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:47:37,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:47:37,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:47:37,323 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:47:37,324 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 29 treesize of output 28 [2019-10-02 00:47:37,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:47:37,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:47:37,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:47:37,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:47:37,343 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:47:37,343 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 23 treesize of output 22 [2019-10-02 00:47:37,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:47:37,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:47:37,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:47:37,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-02 00:47:40,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:47:40,696 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-10-02 00:47:40,696 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 34 treesize of output 42 [2019-10-02 00:47:40,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:47:40,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:47:40,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:47:40,710 INFO L567 ElimStorePlain]: treesize reduction 26, result has 18.8 percent of original size [2019-10-02 00:47:40,710 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-02 00:47:40,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:6 [2019-10-02 00:47:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 110 proven. 222 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-02 00:47:40,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:47:40,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2019-10-02 00:47:40,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 00:47:40,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 00:47:40,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1301, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 00:47:40,797 INFO L87 Difference]: Start difference. First operand 935 states and 1054 transitions. Second operand 38 states. [2019-10-02 00:48:35,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:35,056 INFO L93 Difference]: Finished difference Result 1749 states and 1994 transitions. [2019-10-02 00:48:35,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 284 states. [2019-10-02 00:48:35,057 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 127 [2019-10-02 00:48:35,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:35,063 INFO L225 Difference]: With dead ends: 1749 [2019-10-02 00:48:35,063 INFO L226 Difference]: Without dead ends: 1719 [2019-10-02 00:48:35,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 93 SyntacticMatches, 21 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39771 ImplicationChecksByTransitivity, 43.2s TimeCoverageRelationStatistics Valid=5093, Invalid=93178, Unknown=11, NotChecked=0, Total=98282 [2019-10-02 00:48:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-10-02 00:48:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 944. [2019-10-02 00:48:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-10-02 00:48:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1063 transitions. [2019-10-02 00:48:35,335 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1063 transitions. Word has length 127 [2019-10-02 00:48:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:35,335 INFO L475 AbstractCegarLoop]: Abstraction has 944 states and 1063 transitions. [2019-10-02 00:48:35,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 00:48:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1063 transitions. [2019-10-02 00:48:35,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 00:48:35,338 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:35,338 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 6, 5, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:35,338 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:35,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:35,339 INFO L82 PathProgramCache]: Analyzing trace with hash -770433389, now seen corresponding path program 9 times [2019-10-02 00:48:35,339 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:35,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:35,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:35,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:48:35,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 20 proven. 279 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 00:48:35,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:48:35,914 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:48:36,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:48:36,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-02 00:48:36,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:48:36,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-02 00:48:36,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:48:36,441 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 16 treesize of output 12 [2019-10-02 00:48:36,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:48:36,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:48:36,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:48:36,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-02 00:48:36,458 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-02 00:48:36,469 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:48:36,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 57 treesize of output 61 [2019-10-02 00:48:36,470 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:48:36,484 INFO L567 ElimStorePlain]: treesize reduction 33, result has 43.1 percent of original size [2019-10-02 00:48:36,484 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:48:36,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:48:36,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:48:36,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:19 [2019-10-02 00:48:36,506 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-02 00:48:36,517 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:48:36,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 57 treesize of output 61 [2019-10-02 00:48:36,518 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:48:36,534 INFO L567 ElimStorePlain]: treesize reduction 33, result has 43.1 percent of original size [2019-10-02 00:48:36,535 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:48:36,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:48:36,543 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-02 00:48:36,543 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2019-10-02 00:48:36,552 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-02 00:48:36,565 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:48:36,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 57 treesize of output 61 [2019-10-02 00:48:36,567 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:48:36,589 INFO L567 ElimStorePlain]: treesize reduction 33, result has 43.1 percent of original size [2019-10-02 00:48:36,590 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:48:36,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:48:36,598 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-02 00:48:36,598 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2019-10-02 00:48:36,605 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 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-02 00:48:36,618 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:48:36,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 57 treesize of output 61 [2019-10-02 00:48:36,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:48:36,637 INFO L567 ElimStorePlain]: treesize reduction 33, result has 43.1 percent of original size [2019-10-02 00:48:36,637 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:48:36,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:48:36,646 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-02 00:48:36,646 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:31 [2019-10-02 00:48:49,111 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-02 00:48:51,168 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-02 00:49:02,397 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-10-02 00:49:04,518 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 39 [2019-10-02 00:49:14,697 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-02 00:49:22,993 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-02 00:49:35,181 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-02 00:49:51,349 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-10-02 00:49:53,507 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-02 00:50:03,706 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-02 00:50:19,871 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-10-02 00:50:21,940 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-02 00:50:35,064 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-02 00:50:35,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:50:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 112 proven. 299 refuted. 36 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 00:50:35,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:50:35,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 41 [2019-10-02 00:50:35,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 00:50:35,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 00:50:35,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1420, Unknown=23, NotChecked=0, Total=1640 [2019-10-02 00:50:35,236 INFO L87 Difference]: Start difference. First operand 944 states and 1063 transitions. Second operand 41 states.