/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/rewrev.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:49:56,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:49:56,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:49:56,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:49:56,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:49:56,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:49:56,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:49:56,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:49:56,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:49:56,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:49:56,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:49:56,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:49:56,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:49:56,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:49:56,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:49:56,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:49:56,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:49:56,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:49:56,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:49:56,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:49:56,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:49:56,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:49:56,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:49:56,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:49:56,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:49:56,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:49:56,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:49:56,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:49:56,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:49:56,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:49:56,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:49:56,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:49:56,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:49:56,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:49:56,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:49:56,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:49:56,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:49:56,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:49:56,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:49:56,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:49:56,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:49:56,289 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-11-23 20:49:56,310 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:49:56,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:49:56,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:49:56,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:49:56,313 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:49:56,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:49:56,313 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:49:56,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:49:56,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:49:56,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:49:56,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:49:56,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:49:56,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:49:56,316 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:49:56,316 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:49:56,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:49:56,316 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:49:56,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:49:56,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:49:56,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:49:56,317 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:49:56,318 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:49:56,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:49:56,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:49:56,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:49:56,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:49:56,319 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:49:56,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:49:56,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:49:56,319 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:49:56,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:49:56,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:49:56,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:49:56,641 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:49:56,642 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:49:56,643 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewrev.c [2019-11-23 20:49:56,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/248c51081/7b5b2a0525894df49d78bdb3380b5b0c/FLAG66286c5f2 [2019-11-23 20:49:57,140 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:49:57,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewrev.c [2019-11-23 20:49:57,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/248c51081/7b5b2a0525894df49d78bdb3380b5b0c/FLAG66286c5f2 [2019-11-23 20:49:57,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/248c51081/7b5b2a0525894df49d78bdb3380b5b0c [2019-11-23 20:49:57,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:49:57,550 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:49:57,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:49:57,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:49:57,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:49:57,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:49:57" (1/1) ... [2019-11-23 20:49:57,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33e6e30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:57, skipping insertion in model container [2019-11-23 20:49:57,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:49:57" (1/1) ... [2019-11-23 20:49:57,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:49:57,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:49:57,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:49:57,775 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:49:57,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:49:57,808 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:49:57,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:57 WrapperNode [2019-11-23 20:49:57,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:49:57,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:49:57,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:49:57,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:49:57,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:57" (1/1) ... [2019-11-23 20:49:57,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:57" (1/1) ... [2019-11-23 20:49:57,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:49:57,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:49:57,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:49:57,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:49:57,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:57" (1/1) ... [2019-11-23 20:49:57,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:57" (1/1) ... [2019-11-23 20:49:57,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:57" (1/1) ... [2019-11-23 20:49:57,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:57" (1/1) ... [2019-11-23 20:49:57,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:57" (1/1) ... [2019-11-23 20:49:57,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:57" (1/1) ... [2019-11-23 20:49:57,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:57" (1/1) ... [2019-11-23 20:49:57,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:49:57,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:49:57,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:49:57,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:49:57,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:57" (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-11-23 20:49:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:49:58,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 20:49:58,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:49:58,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:49:58,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:49:58,244 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:49:58,245 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-23 20:49:58,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:49:58 BoogieIcfgContainer [2019-11-23 20:49:58,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:49:58,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:49:58,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:49:58,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:49:58,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:49:57" (1/3) ... [2019-11-23 20:49:58,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45faf5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:49:58, skipping insertion in model container [2019-11-23 20:49:58,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:57" (2/3) ... [2019-11-23 20:49:58,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45faf5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:49:58, skipping insertion in model container [2019-11-23 20:49:58,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:49:58" (3/3) ... [2019-11-23 20:49:58,254 INFO L109 eAbstractionObserver]: Analyzing ICFG rewrev.c [2019-11-23 20:49:58,263 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:49:58,271 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:49:58,283 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:49:58,312 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:49:58,312 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:49:58,313 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:49:58,313 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:49:58,313 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:49:58,313 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:49:58,313 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:49:58,313 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:49:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-23 20:49:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-23 20:49:58,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:58,349 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:58,350 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:58,359 INFO L82 PathProgramCache]: Analyzing trace with hash 133671584, now seen corresponding path program 1 times [2019-11-23 20:49:58,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:58,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101470038] [2019-11-23 20:49:58,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:58,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101470038] [2019-11-23 20:49:58,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:49:58,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:49:58,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257585703] [2019-11-23 20:49:58,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 20:49:58,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:58,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 20:49:58,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 20:49:58,563 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-23 20:49:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:58,579 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-11-23 20:49:58,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 20:49:58,580 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-23 20:49:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:58,589 INFO L225 Difference]: With dead ends: 29 [2019-11-23 20:49:58,589 INFO L226 Difference]: Without dead ends: 14 [2019-11-23 20:49:58,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 20:49:58,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-23 20:49:58,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-23 20:49:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-23 20:49:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-23 20:49:58,628 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2019-11-23 20:49:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:58,629 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-23 20:49:58,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 20:49:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-11-23 20:49:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-23 20:49:58,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:58,630 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:58,631 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:58,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:58,631 INFO L82 PathProgramCache]: Analyzing trace with hash 121665811, now seen corresponding path program 1 times [2019-11-23 20:49:58,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:58,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476932379] [2019-11-23 20:49:58,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:58,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476932379] [2019-11-23 20:49:58,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:49:58,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:49:58,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639166269] [2019-11-23 20:49:58,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:49:58,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:58,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:49:58,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:49:58,701 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 3 states. [2019-11-23 20:49:58,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:58,761 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-23 20:49:58,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:49:58,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-23 20:49:58,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:58,763 INFO L225 Difference]: With dead ends: 29 [2019-11-23 20:49:58,763 INFO L226 Difference]: Without dead ends: 18 [2019-11-23 20:49:58,764 INFO L630 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-11-23 20:49:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-23 20:49:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-11-23 20:49:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-23 20:49:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-11-23 20:49:58,769 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 8 [2019-11-23 20:49:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:58,770 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-23 20:49:58,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:49:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-11-23 20:49:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 20:49:58,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:58,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:58,771 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:58,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:58,772 INFO L82 PathProgramCache]: Analyzing trace with hash 729197006, now seen corresponding path program 1 times [2019-11-23 20:49:58,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:58,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638434440] [2019-11-23 20:49:58,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:58,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638434440] [2019-11-23 20:49:58,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:49:58,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:49:58,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474365895] [2019-11-23 20:49:58,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:49:58,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:58,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:49:58,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:49:58,837 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 4 states. [2019-11-23 20:49:58,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:58,893 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-11-23 20:49:58,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:49:58,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-23 20:49:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:58,894 INFO L225 Difference]: With dead ends: 26 [2019-11-23 20:49:58,894 INFO L226 Difference]: Without dead ends: 19 [2019-11-23 20:49:58,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:49:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-23 20:49:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-23 20:49:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-23 20:49:58,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-11-23 20:49:58,900 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2019-11-23 20:49:58,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:58,900 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-23 20:49:58,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:49:58,900 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-11-23 20:49:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 20:49:58,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:58,901 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:58,902 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:58,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1021157689, now seen corresponding path program 1 times [2019-11-23 20:49:58,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:58,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432850746] [2019-11-23 20:49:58,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:59,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432850746] [2019-11-23 20:49:59,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740791848] [2019-11-23 20:49:59,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:59,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 20:49:59,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:59,562 INFO L377 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-11-23 20:49:59,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:59,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:59,579 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-11-23 20:49:59,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-11-23 20:49:59,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:49:59,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:59,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-11-23 20:49:59,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407033448] [2019-11-23 20:49:59,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:49:59,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:59,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:49:59,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:49:59,685 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 16 states. [2019-11-23 20:50:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:00,286 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-11-23 20:50:00,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 20:50:00,287 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-11-23 20:50:00,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:00,288 INFO L225 Difference]: With dead ends: 28 [2019-11-23 20:50:00,288 INFO L226 Difference]: Without dead ends: 26 [2019-11-23 20:50:00,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:50:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-23 20:50:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2019-11-23 20:50:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 20:50:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-11-23 20:50:00,294 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-11-23 20:50:00,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:00,295 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-23 20:50:00,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:50:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-11-23 20:50:00,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 20:50:00,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:00,296 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:00,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:00,502 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:00,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:00,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1566850755, now seen corresponding path program 1 times [2019-11-23 20:50:00,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:00,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643628432] [2019-11-23 20:50:00,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:00,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643628432] [2019-11-23 20:50:00,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761158497] [2019-11-23 20:50:00,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:00,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 20:50:00,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:01,011 INFO L377 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-11-23 20:50:01,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:01,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:01,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:01,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:50:01,121 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:50:01,122 INFO L377 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 38 treesize of output 28 [2019-11-23 20:50:01,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:01,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:01,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 20:50:01,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2019-11-23 20:50:01,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:01,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:01,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:01,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-11-23 20:50:01,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324565887] [2019-11-23 20:50:01,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 20:50:01,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:01,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 20:50:01,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:50:01,363 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 21 states. [2019-11-23 20:50:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:02,771 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-11-23 20:50:02,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 20:50:02,771 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-11-23 20:50:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:02,774 INFO L225 Difference]: With dead ends: 53 [2019-11-23 20:50:02,774 INFO L226 Difference]: Without dead ends: 51 [2019-11-23 20:50:02,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=352, Invalid=1370, Unknown=0, NotChecked=0, Total=1722 [2019-11-23 20:50:02,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-23 20:50:02,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 25. [2019-11-23 20:50:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-23 20:50:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-11-23 20:50:02,783 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2019-11-23 20:50:02,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:02,784 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-11-23 20:50:02,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 20:50:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-11-23 20:50:02,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 20:50:02,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:02,785 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:02,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:02,997 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:02,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:02,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1995245389, now seen corresponding path program 2 times [2019-11-23 20:50:02,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:02,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749039373] [2019-11-23 20:50:02,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:03,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749039373] [2019-11-23 20:50:03,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791825967] [2019-11-23 20:50:03,066 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:03,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:50:03,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:03,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-23 20:50:03,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:03,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:03,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-23 20:50:03,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870731911] [2019-11-23 20:50:03,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 20:50:03,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:03,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 20:50:03,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-11-23 20:50:03,147 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 11 states. [2019-11-23 20:50:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:03,248 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2019-11-23 20:50:03,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 20:50:03,252 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-11-23 20:50:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:03,253 INFO L225 Difference]: With dead ends: 54 [2019-11-23 20:50:03,253 INFO L226 Difference]: Without dead ends: 31 [2019-11-23 20:50:03,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:50:03,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-23 20:50:03,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-11-23 20:50:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-23 20:50:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-11-23 20:50:03,259 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 24 [2019-11-23 20:50:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:03,260 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-11-23 20:50:03,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 20:50:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-11-23 20:50:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 20:50:03,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:03,261 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:03,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:03,465 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:03,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:03,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1191072622, now seen corresponding path program 3 times [2019-11-23 20:50:03,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:03,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360962183] [2019-11-23 20:50:03,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:04,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360962183] [2019-11-23 20:50:04,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551409550] [2019-11-23 20:50:04,206 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:04,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 20:50:04,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:04,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 20:50:04,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:04,285 INFO L377 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-11-23 20:50:04,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:04,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:04,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:04,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:50:04,355 INFO L343 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-23 20:50:04,356 INFO L377 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 28 treesize of output 27 [2019-11-23 20:50:04,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:04,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:04,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:04,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-11-23 20:50:04,380 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:50:04,381 INFO L377 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-11-23 20:50:04,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:04,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:04,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:04,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-11-23 20:50:04,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:04,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:04,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:04,561 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:04,561 INFO L377 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 59 treesize of output 43 [2019-11-23 20:50:04,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:04,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:04,578 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-11-23 20:50:04,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2019-11-23 20:50:04,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:04,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:04,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:04,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-11-23 20:50:04,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960972468] [2019-11-23 20:50:04,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-23 20:50:04,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:04,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-23 20:50:04,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-11-23 20:50:04,885 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 28 states. [2019-11-23 20:50:06,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:06,014 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-11-23 20:50:06,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 20:50:06,015 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-11-23 20:50:06,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:06,017 INFO L225 Difference]: With dead ends: 42 [2019-11-23 20:50:06,017 INFO L226 Difference]: Without dead ends: 40 [2019-11-23 20:50:06,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=370, Invalid=1522, Unknown=0, NotChecked=0, Total=1892 [2019-11-23 20:50:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-23 20:50:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-11-23 20:50:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-23 20:50:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-11-23 20:50:06,025 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 28 [2019-11-23 20:50:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:06,025 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-23 20:50:06,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-23 20:50:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-11-23 20:50:06,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 20:50:06,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:06,027 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:06,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:06,231 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:06,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:06,232 INFO L82 PathProgramCache]: Analyzing trace with hash 948898404, now seen corresponding path program 4 times [2019-11-23 20:50:06,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:06,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562315809] [2019-11-23 20:50:06,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:06,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562315809] [2019-11-23 20:50:06,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100682472] [2019-11-23 20:50:06,293 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:06,334 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:50:06,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:06,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-23 20:50:06,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:06,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:06,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2019-11-23 20:50:06,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454366296] [2019-11-23 20:50:06,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 20:50:06,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:06,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 20:50:06,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:50:06,397 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 13 states. [2019-11-23 20:50:06,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:06,530 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-11-23 20:50:06,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 20:50:06,531 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-11-23 20:50:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:06,532 INFO L225 Difference]: With dead ends: 66 [2019-11-23 20:50:06,532 INFO L226 Difference]: Without dead ends: 39 [2019-11-23 20:50:06,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:50:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-23 20:50:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-11-23 20:50:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-23 20:50:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-11-23 20:50:06,541 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 32 [2019-11-23 20:50:06,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:06,541 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-11-23 20:50:06,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 20:50:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-11-23 20:50:06,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 20:50:06,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:06,543 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:06,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:06,747 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:06,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:06,748 INFO L82 PathProgramCache]: Analyzing trace with hash 947747359, now seen corresponding path program 5 times [2019-11-23 20:50:06,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:06,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697635735] [2019-11-23 20:50:06,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:07,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697635735] [2019-11-23 20:50:07,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851160888] [2019-11-23 20:50:07,052 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:07,104 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-23 20:50:07,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:07,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-23 20:50:07,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:07,139 INFO L377 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-11-23 20:50:07,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:07,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:07,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:07,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:50:07,212 INFO L343 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-23 20:50:07,213 INFO L377 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 28 treesize of output 27 [2019-11-23 20:50:07,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:07,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:07,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:07,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-11-23 20:50:07,278 INFO L343 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2019-11-23 20:50:07,278 INFO L377 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 40 treesize of output 42 [2019-11-23 20:50:07,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:07,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:07,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:07,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-11-23 20:50:07,405 INFO L343 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-11-23 20:50:07,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 54 [2019-11-23 20:50:07,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:07,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:07,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:07,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2019-11-23 20:50:07,505 INFO L343 Elim1Store]: treesize reduction 225, result has 13.8 percent of original size [2019-11-23 20:50:07,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 61 treesize of output 57 [2019-11-23 20:50:07,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:07,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:07,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:07,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:46 [2019-11-23 20:50:07,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:07,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:07,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:07,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:07,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:07,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:07,717 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:07,718 INFO L377 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 80 treesize of output 58 [2019-11-23 20:50:07,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:07,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:07,741 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-11-23 20:50:07,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:94, output treesize:90 [2019-11-23 20:50:07,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:08,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:08,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:08,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2019-11-23 20:50:08,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444375323] [2019-11-23 20:50:08,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-23 20:50:08,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:08,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-23 20:50:08,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 20:50:08,153 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 33 states. [2019-11-23 20:50:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:10,094 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-11-23 20:50:10,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-23 20:50:10,094 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2019-11-23 20:50:10,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:10,096 INFO L225 Difference]: With dead ends: 51 [2019-11-23 20:50:10,096 INFO L226 Difference]: Without dead ends: 49 [2019-11-23 20:50:10,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=500, Invalid=2470, Unknown=0, NotChecked=0, Total=2970 [2019-11-23 20:50:10,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-23 20:50:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2019-11-23 20:50:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-23 20:50:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-11-23 20:50:10,106 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 36 [2019-11-23 20:50:10,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:10,106 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-11-23 20:50:10,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-23 20:50:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-11-23 20:50:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 20:50:10,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:10,108 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:10,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:10,312 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:10,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:10,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1942581397, now seen corresponding path program 6 times [2019-11-23 20:50:10,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:10,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766995652] [2019-11-23 20:50:10,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:10,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766995652] [2019-11-23 20:50:10,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535649951] [2019-11-23 20:50:10,396 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:10,440 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-23 20:50:10,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:10,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-23 20:50:10,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:10,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:10,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2019-11-23 20:50:10,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401385383] [2019-11-23 20:50:10,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:50:10,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:10,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:50:10,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:50:10,507 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 15 states. [2019-11-23 20:50:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:10,648 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-11-23 20:50:10,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 20:50:10,648 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-11-23 20:50:10,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:10,649 INFO L225 Difference]: With dead ends: 78 [2019-11-23 20:50:10,649 INFO L226 Difference]: Without dead ends: 47 [2019-11-23 20:50:10,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:50:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-23 20:50:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-23 20:50:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-23 20:50:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-11-23 20:50:10,660 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 40 [2019-11-23 20:50:10,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:10,661 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-11-23 20:50:10,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:50:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-11-23 20:50:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 20:50:10,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:10,668 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:10,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:10,872 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:10,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1613367984, now seen corresponding path program 7 times [2019-11-23 20:50:10,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:10,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499340109] [2019-11-23 20:50:10,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:11,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499340109] [2019-11-23 20:50:11,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761536777] [2019-11-23 20:50:11,269 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:11,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-23 20:50:11,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:11,353 INFO L377 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-11-23 20:50:11,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:11,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:11,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:11,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:50:11,432 INFO L343 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-23 20:50:11,432 INFO L377 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 28 treesize of output 27 [2019-11-23 20:50:11,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:11,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:11,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:11,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-23 20:50:11,501 INFO L343 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2019-11-23 20:50:11,502 INFO L377 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 40 treesize of output 42 [2019-11-23 20:50:11,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:11,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:11,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:11,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-11-23 20:50:11,620 INFO L343 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-11-23 20:50:11,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2019-11-23 20:50:11,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:11,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:11,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:11,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2019-11-23 20:50:11,723 INFO L343 Elim1Store]: treesize reduction 225, result has 13.8 percent of original size [2019-11-23 20:50:11,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 60 [2019-11-23 20:50:11,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:11,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:11,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:11,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:54 [2019-11-23 20:50:11,888 INFO L343 Elim1Store]: treesize reduction 264, result has 15.7 percent of original size [2019-11-23 20:50:11,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 69 [2019-11-23 20:50:11,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:11,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:11,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:11,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:66 [2019-11-23 20:50:12,039 INFO L343 Elim1Store]: treesize reduction 337, result has 12.5 percent of original size [2019-11-23 20:50:12,039 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 73 treesize of output 72 [2019-11-23 20:50:12,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:12,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:12,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:12,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:58 [2019-11-23 20:50:12,376 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-11-23 20:50:12,377 INFO L343 Elim1Store]: treesize reduction 149, result has 53.6 percent of original size [2019-11-23 20:50:12,377 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 101 treesize of output 196 [2019-11-23 20:50:12,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:12,461 INFO L567 ElimStorePlain]: treesize reduction 150, result has 42.5 percent of original size [2019-11-23 20:50:12,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 20:50:12,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:115, output treesize:111 [2019-11-23 20:50:12,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:12,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 23 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:12,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:12,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 38 [2019-11-23 20:50:12,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155289519] [2019-11-23 20:50:12,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-23 20:50:12,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:12,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-23 20:50:12,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 20:50:12,952 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 38 states. [2019-11-23 20:50:14,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:14,972 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-23 20:50:14,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-23 20:50:14,973 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-11-23 20:50:14,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:14,974 INFO L225 Difference]: With dead ends: 57 [2019-11-23 20:50:14,975 INFO L226 Difference]: Without dead ends: 55 [2019-11-23 20:50:14,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=583, Invalid=3077, Unknown=0, NotChecked=0, Total=3660 [2019-11-23 20:50:14,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-23 20:50:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-11-23 20:50:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-23 20:50:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-11-23 20:50:14,985 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-11-23 20:50:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:14,985 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-11-23 20:50:14,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-23 20:50:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-11-23 20:50:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-23 20:50:14,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:14,986 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:15,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:15,190 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:15,190 INFO L82 PathProgramCache]: Analyzing trace with hash 924773190, now seen corresponding path program 8 times [2019-11-23 20:50:15,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:15,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051955073] [2019-11-23 20:50:15,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:15,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051955073] [2019-11-23 20:50:15,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542044406] [2019-11-23 20:50:15,268 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:15,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:50:15,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:15,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-23 20:50:15,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 50 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:15,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:15,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 17 [2019-11-23 20:50:15,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458080936] [2019-11-23 20:50:15,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 20:50:15,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:15,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 20:50:15,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:50:15,454 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 17 states. [2019-11-23 20:50:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:15,636 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-11-23 20:50:15,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 20:50:15,637 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2019-11-23 20:50:15,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:15,638 INFO L225 Difference]: With dead ends: 90 [2019-11-23 20:50:15,638 INFO L226 Difference]: Without dead ends: 55 [2019-11-23 20:50:15,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-11-23 20:50:15,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-23 20:50:15,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-11-23 20:50:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-23 20:50:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-11-23 20:50:15,651 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 48 [2019-11-23 20:50:15,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:15,652 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-11-23 20:50:15,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 20:50:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-11-23 20:50:15,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 20:50:15,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:15,655 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:15,858 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:15,859 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:15,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:15,859 INFO L82 PathProgramCache]: Analyzing trace with hash 778339585, now seen corresponding path program 9 times [2019-11-23 20:50:15,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:15,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669809891] [2019-11-23 20:50:15,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 12 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:16,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669809891] [2019-11-23 20:50:16,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714828269] [2019-11-23 20:50:16,271 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:16,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-23 20:50:16,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:16,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-23 20:50:16,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:16,350 INFO L377 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-11-23 20:50:16,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:16,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:16,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:16,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:50:16,431 INFO L343 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-23 20:50:16,431 INFO L377 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 28 treesize of output 27 [2019-11-23 20:50:16,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:16,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:16,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:16,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-11-23 20:50:16,506 INFO L343 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2019-11-23 20:50:16,507 INFO L377 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 40 treesize of output 42 [2019-11-23 20:50:16,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:16,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:16,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:16,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-11-23 20:50:16,650 INFO L343 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-11-23 20:50:16,650 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2019-11-23 20:50:16,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:16,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:16,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:16,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:57 [2019-11-23 20:50:16,754 INFO L343 Elim1Store]: treesize reduction 225, result has 13.8 percent of original size [2019-11-23 20:50:16,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 60 [2019-11-23 20:50:16,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:16,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:16,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:16,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:57 [2019-11-23 20:50:16,921 INFO L343 Elim1Store]: treesize reduction 264, result has 15.7 percent of original size [2019-11-23 20:50:16,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 72 [2019-11-23 20:50:16,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:16,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:16,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:16,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:69 [2019-11-23 20:50:17,071 INFO L343 Elim1Store]: treesize reduction 337, result has 12.5 percent of original size [2019-11-23 20:50:17,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 76 treesize of output 75 [2019-11-23 20:50:17,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:17,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:17,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:17,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:69 [2019-11-23 20:50:17,281 INFO L343 Elim1Store]: treesize reduction 375, result has 14.0 percent of original size [2019-11-23 20:50:17,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 73 treesize of output 84 [2019-11-23 20:50:17,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:17,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:17,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:17,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:78 [2019-11-23 20:50:17,442 INFO L343 Elim1Store]: treesize reduction 467, result has 11.4 percent of original size [2019-11-23 20:50:17,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 85 treesize of output 87 [2019-11-23 20:50:17,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:17,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:17,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:17,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:94, output treesize:70 [2019-11-23 20:50:17,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:17,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:17,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:17,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:17,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:17,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:17,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:17,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:17,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:17,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:17,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:17,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:17,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:17,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:17,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:17,747 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:17,747 INFO L377 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 122 treesize of output 88 [2019-11-23 20:50:17,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:17,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:17,808 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-11-23 20:50:17,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:136, output treesize:132 [2019-11-23 20:50:17,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:18,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 39 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:18,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:18,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 28] total 45 [2019-11-23 20:50:18,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348503853] [2019-11-23 20:50:18,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-23 20:50:18,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:18,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-23 20:50:18,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=1661, Unknown=0, NotChecked=0, Total=1980 [2019-11-23 20:50:18,606 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 45 states. [2019-11-23 20:50:21,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:21,400 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-23 20:50:21,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-23 20:50:21,401 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 52 [2019-11-23 20:50:21,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:21,402 INFO L225 Difference]: With dead ends: 67 [2019-11-23 20:50:21,402 INFO L226 Difference]: Without dead ends: 65 [2019-11-23 20:50:21,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=837, Invalid=4419, Unknown=0, NotChecked=0, Total=5256 [2019-11-23 20:50:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-23 20:50:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-11-23 20:50:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-23 20:50:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-11-23 20:50:21,414 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 52 [2019-11-23 20:50:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:21,414 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-11-23 20:50:21,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-23 20:50:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-11-23 20:50:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 20:50:21,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:21,415 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:21,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:21,619 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:21,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:21,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1215546761, now seen corresponding path program 10 times [2019-11-23 20:50:21,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:21,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919048760] [2019-11-23 20:50:21,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 51 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:21,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919048760] [2019-11-23 20:50:21,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708387115] [2019-11-23 20:50:21,702 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:21,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:50:21,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:21,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 20:50:21,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 72 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:21,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:21,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 19 [2019-11-23 20:50:21,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137945168] [2019-11-23 20:50:21,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 20:50:21,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:21,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 20:50:21,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:50:21,889 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 19 states. [2019-11-23 20:50:22,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:22,086 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-11-23 20:50:22,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 20:50:22,087 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-11-23 20:50:22,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:22,087 INFO L225 Difference]: With dead ends: 102 [2019-11-23 20:50:22,088 INFO L226 Difference]: Without dead ends: 63 [2019-11-23 20:50:22,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2019-11-23 20:50:22,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-23 20:50:22,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-11-23 20:50:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-23 20:50:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-11-23 20:50:22,104 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 56 [2019-11-23 20:50:22,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:22,104 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-11-23 20:50:22,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 20:50:22,105 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-11-23 20:50:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-23 20:50:22,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:22,105 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:22,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:22,310 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:22,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:22,310 INFO L82 PathProgramCache]: Analyzing trace with hash -836376270, now seen corresponding path program 11 times [2019-11-23 20:50:22,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:22,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341301930] [2019-11-23 20:50:22,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 15 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:22,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341301930] [2019-11-23 20:50:22,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564339820] [2019-11-23 20:50:22,840 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:22,944 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-23 20:50:22,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:22,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-23 20:50:22,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:22,975 INFO L377 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-11-23 20:50:22,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:22,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:22,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:22,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:50:23,052 INFO L343 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-23 20:50:23,053 INFO L377 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 28 treesize of output 27 [2019-11-23 20:50:23,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:23,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:23,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:23,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-11-23 20:50:23,143 INFO L343 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2019-11-23 20:50:23,143 INFO L377 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 40 treesize of output 42 [2019-11-23 20:50:23,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:23,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:23,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:23,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-11-23 20:50:23,274 INFO L343 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-11-23 20:50:23,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2019-11-23 20:50:23,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:23,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:23,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:23,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:57 [2019-11-23 20:50:23,376 INFO L343 Elim1Store]: treesize reduction 225, result has 13.8 percent of original size [2019-11-23 20:50:23,377 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 60 [2019-11-23 20:50:23,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:23,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:23,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:23,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:57 [2019-11-23 20:50:23,546 INFO L343 Elim1Store]: treesize reduction 264, result has 15.7 percent of original size [2019-11-23 20:50:23,547 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 72 [2019-11-23 20:50:23,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:23,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:23,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:23,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:69 [2019-11-23 20:50:23,684 INFO L343 Elim1Store]: treesize reduction 337, result has 12.5 percent of original size [2019-11-23 20:50:23,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 76 treesize of output 75 [2019-11-23 20:50:23,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:23,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:23,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:23,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:69 [2019-11-23 20:50:23,934 INFO L343 Elim1Store]: treesize reduction 375, result has 14.0 percent of original size [2019-11-23 20:50:23,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 87 [2019-11-23 20:50:23,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:23,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:23,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:23,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2019-11-23 20:50:24,142 INFO L343 Elim1Store]: treesize reduction 467, result has 11.4 percent of original size [2019-11-23 20:50:24,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 90 [2019-11-23 20:50:24,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:24,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:24,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:24,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:97, output treesize:81 [2019-11-23 20:50:24,540 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 37 [2019-11-23 20:50:24,540 INFO L343 Elim1Store]: treesize reduction 504, result has 12.7 percent of original size [2019-11-23 20:50:24,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 85 treesize of output 99 [2019-11-23 20:50:24,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:24,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:24,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:24,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:94, output treesize:90 [2019-11-23 20:50:24,845 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 37 [2019-11-23 20:50:24,846 INFO L343 Elim1Store]: treesize reduction 615, result has 10.5 percent of original size [2019-11-23 20:50:24,847 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 97 treesize of output 102 [2019-11-23 20:50:24,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:24,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:24,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:24,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:106, output treesize:82 [2019-11-23 20:50:25,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:25,365 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:25,365 INFO L377 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 143 treesize of output 103 [2019-11-23 20:50:25,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:25,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:25,392 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-11-23 20:50:25,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:157, output treesize:153 [2019-11-23 20:50:25,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:26,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 57 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:26,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:26,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 32] total 51 [2019-11-23 20:50:26,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114050482] [2019-11-23 20:50:26,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-11-23 20:50:26,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:26,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-11-23 20:50:26,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=2147, Unknown=0, NotChecked=0, Total=2550 [2019-11-23 20:50:26,311 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 51 states. [2019-11-23 20:50:29,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:29,835 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-11-23 20:50:29,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-23 20:50:29,836 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 60 [2019-11-23 20:50:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:29,837 INFO L225 Difference]: With dead ends: 75 [2019-11-23 20:50:29,837 INFO L226 Difference]: Without dead ends: 73 [2019-11-23 20:50:29,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 31 SyntacticMatches, 9 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1029, Invalid=5613, Unknown=0, NotChecked=0, Total=6642 [2019-11-23 20:50:29,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-23 20:50:29,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2019-11-23 20:50:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-23 20:50:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-11-23 20:50:29,850 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 60 [2019-11-23 20:50:29,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:29,850 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-11-23 20:50:29,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-11-23 20:50:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-11-23 20:50:29,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-23 20:50:29,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:29,851 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:30,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:30,056 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:30,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:30,056 INFO L82 PathProgramCache]: Analyzing trace with hash 313400872, now seen corresponding path program 12 times [2019-11-23 20:50:30,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:30,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416962156] [2019-11-23 20:50:30,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 73 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:30,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416962156] [2019-11-23 20:50:30,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081836969] [2019-11-23 20:50:30,182 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:30,286 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-23 20:50:30,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:30,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-23 20:50:30,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:30,403 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 98 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:30,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:30,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 21 [2019-11-23 20:50:30,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142497731] [2019-11-23 20:50:30,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 20:50:30,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:30,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 20:50:30,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:50:30,405 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 21 states. [2019-11-23 20:50:30,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:30,633 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2019-11-23 20:50:30,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 20:50:30,641 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2019-11-23 20:50:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:30,641 INFO L225 Difference]: With dead ends: 114 [2019-11-23 20:50:30,642 INFO L226 Difference]: Without dead ends: 71 [2019-11-23 20:50:30,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=172, Invalid=290, Unknown=0, NotChecked=0, Total=462 [2019-11-23 20:50:30,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-23 20:50:30,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-11-23 20:50:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-23 20:50:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-11-23 20:50:30,651 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 64 [2019-11-23 20:50:30,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:30,651 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-11-23 20:50:30,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 20:50:30,652 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-11-23 20:50:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 20:50:30,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:30,655 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:30,858 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:30,859 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:30,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:30,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1370939875, now seen corresponding path program 13 times [2019-11-23 20:50:30,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:30,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563767772] [2019-11-23 20:50:30,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 16 proven. 202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:31,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563767772] [2019-11-23 20:50:31,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335304617] [2019-11-23 20:50:31,960 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:32,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-23 20:50:32,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:32,040 INFO L377 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-11-23 20:50:32,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:32,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:50:32,109 INFO L343 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-23 20:50:32,109 INFO L377 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 28 treesize of output 27 [2019-11-23 20:50:32,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:32,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-23 20:50:32,182 INFO L343 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2019-11-23 20:50:32,183 INFO L377 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 40 treesize of output 42 [2019-11-23 20:50:32,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:32,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-11-23 20:50:32,307 INFO L343 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-11-23 20:50:32,308 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2019-11-23 20:50:32,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:32,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2019-11-23 20:50:32,410 INFO L343 Elim1Store]: treesize reduction 225, result has 13.8 percent of original size [2019-11-23 20:50:32,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 60 [2019-11-23 20:50:32,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:32,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:54 [2019-11-23 20:50:32,570 INFO L343 Elim1Store]: treesize reduction 264, result has 15.7 percent of original size [2019-11-23 20:50:32,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 72 [2019-11-23 20:50:32,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:32,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:66 [2019-11-23 20:50:32,701 INFO L343 Elim1Store]: treesize reduction 337, result has 12.5 percent of original size [2019-11-23 20:50:32,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 76 treesize of output 75 [2019-11-23 20:50:32,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:32,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:66 [2019-11-23 20:50:32,903 INFO L343 Elim1Store]: treesize reduction 375, result has 14.0 percent of original size [2019-11-23 20:50:32,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 87 [2019-11-23 20:50:32,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:32,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:32,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:78 [2019-11-23 20:50:33,061 INFO L343 Elim1Store]: treesize reduction 467, result has 11.4 percent of original size [2019-11-23 20:50:33,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 90 [2019-11-23 20:50:33,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:33,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:33,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:33,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:94, output treesize:78 [2019-11-23 20:50:33,337 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 37 [2019-11-23 20:50:33,337 INFO L343 Elim1Store]: treesize reduction 504, result has 12.7 percent of original size [2019-11-23 20:50:33,338 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 88 treesize of output 102 [2019-11-23 20:50:33,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:33,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:33,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:33,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:94, output treesize:90 [2019-11-23 20:50:33,554 INFO L343 Elim1Store]: treesize reduction 615, result has 10.5 percent of original size [2019-11-23 20:50:33,555 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 100 treesize of output 105 [2019-11-23 20:50:33,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:33,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:33,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:33,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:106, output treesize:90 [2019-11-23 20:50:33,865 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 42 [2019-11-23 20:50:33,866 INFO L343 Elim1Store]: treesize reduction 651, result has 11.5 percent of original size [2019-11-23 20:50:33,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 97 treesize of output 114 [2019-11-23 20:50:33,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:33,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:33,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:33,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:106, output treesize:102 [2019-11-23 20:50:34,122 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 42 [2019-11-23 20:50:34,123 INFO L343 Elim1Store]: treesize reduction 781, result has 9.7 percent of original size [2019-11-23 20:50:34,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 109 treesize of output 117 [2019-11-23 20:50:34,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:34,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:34,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:34,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:118, output treesize:94 [2019-11-23 20:50:34,701 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 75 [2019-11-23 20:50:34,701 INFO L343 Elim1Store]: treesize reduction 419, result has 44.1 percent of original size [2019-11-23 20:50:34,702 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 164 treesize of output 364 [2019-11-23 20:50:34,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:34,844 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-11-23 20:50:34,845 INFO L567 ElimStorePlain]: treesize reduction 300, result has 36.7 percent of original size [2019-11-23 20:50:34,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 20:50:34,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:178, output treesize:174 [2019-11-23 20:50:35,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:35,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 77 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:35,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:35,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 35] total 57 [2019-11-23 20:50:35,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347343398] [2019-11-23 20:50:35,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-11-23 20:50:35,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:35,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-11-23 20:50:35,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=2955, Unknown=0, NotChecked=0, Total=3192 [2019-11-23 20:50:35,968 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 57 states. [2019-11-23 20:50:44,872 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 75 [2019-11-23 20:50:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:52,822 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2019-11-23 20:50:52,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-11-23 20:50:52,829 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 68 [2019-11-23 20:50:52,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:52,830 INFO L225 Difference]: With dead ends: 129 [2019-11-23 20:50:52,830 INFO L226 Difference]: Without dead ends: 127 [2019-11-23 20:50:52,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 36 SyntacticMatches, 12 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4258 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=1551, Invalid=12253, Unknown=2, NotChecked=0, Total=13806 [2019-11-23 20:50:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-23 20:50:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 73. [2019-11-23 20:50:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-23 20:50:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-11-23 20:50:52,847 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 68 [2019-11-23 20:50:52,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:52,849 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-11-23 20:50:52,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-11-23 20:50:52,849 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-11-23 20:50:52,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 20:50:52,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:52,850 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:53,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:53,054 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:53,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:53,054 INFO L82 PathProgramCache]: Analyzing trace with hash -20883879, now seen corresponding path program 14 times [2019-11-23 20:50:53,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:53,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660694931] [2019-11-23 20:50:53,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:53,176 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 99 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:53,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660694931] [2019-11-23 20:50:53,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015523415] [2019-11-23 20:50:53,177 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:53,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:50:53,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:53,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:50:53,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 128 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:53,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:53,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 23 [2019-11-23 20:50:53,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273468146] [2019-11-23 20:50:53,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 20:50:53,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:53,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 20:50:53,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=315, Unknown=0, NotChecked=0, Total=506 [2019-11-23 20:50:53,386 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 23 states. [2019-11-23 20:50:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:53,581 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2019-11-23 20:50:53,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 20:50:53,582 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-11-23 20:50:53,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:53,583 INFO L225 Difference]: With dead ends: 126 [2019-11-23 20:50:53,583 INFO L226 Difference]: Without dead ends: 79 [2019-11-23 20:50:53,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=347, Unknown=0, NotChecked=0, Total=552 [2019-11-23 20:50:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-23 20:50:53,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-11-23 20:50:53,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-23 20:50:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2019-11-23 20:50:53,594 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 72 [2019-11-23 20:50:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:53,595 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2019-11-23 20:50:53,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 20:50:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2019-11-23 20:50:53,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 20:50:53,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:53,595 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:53,796 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:53,796 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:53,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:53,797 INFO L82 PathProgramCache]: Analyzing trace with hash 609496852, now seen corresponding path program 15 times [2019-11-23 20:50:53,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:53,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210955103] [2019-11-23 20:50:53,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 19 proven. 262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:55,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210955103] [2019-11-23 20:50:55,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848906799] [2019-11-23 20:50:55,163 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:55,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-23 20:50:55,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:55,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-23 20:50:55,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:55,377 INFO L377 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-11-23 20:50:55,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:55,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:55,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:55,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:50:55,467 INFO L343 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-23 20:50:55,467 INFO L377 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 28 treesize of output 27 [2019-11-23 20:50:55,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:55,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:55,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:55,477 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-11-23 20:50:55,543 INFO L343 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2019-11-23 20:50:55,544 INFO L377 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 40 treesize of output 42 [2019-11-23 20:50:55,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:55,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:55,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:55,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-11-23 20:50:55,683 INFO L343 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-11-23 20:50:55,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2019-11-23 20:50:55,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:55,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:55,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:55,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:57 [2019-11-23 20:50:55,785 INFO L343 Elim1Store]: treesize reduction 225, result has 13.8 percent of original size [2019-11-23 20:50:55,786 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 60 [2019-11-23 20:50:55,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:55,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:55,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:55,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:57 [2019-11-23 20:50:55,958 INFO L343 Elim1Store]: treesize reduction 264, result has 15.7 percent of original size [2019-11-23 20:50:55,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 72 [2019-11-23 20:50:55,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:55,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:55,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:55,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:69 [2019-11-23 20:50:56,091 INFO L343 Elim1Store]: treesize reduction 337, result has 12.5 percent of original size [2019-11-23 20:50:56,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 76 treesize of output 75 [2019-11-23 20:50:56,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:56,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:56,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:56,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:69 [2019-11-23 20:50:56,341 INFO L343 Elim1Store]: treesize reduction 375, result has 14.0 percent of original size [2019-11-23 20:50:56,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 87 [2019-11-23 20:50:56,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:56,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:56,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:56,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2019-11-23 20:50:56,539 INFO L343 Elim1Store]: treesize reduction 467, result has 11.4 percent of original size [2019-11-23 20:50:56,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 90 [2019-11-23 20:50:56,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:56,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:56,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:56,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:97, output treesize:81 [2019-11-23 20:50:56,807 INFO L343 Elim1Store]: treesize reduction 504, result has 12.7 percent of original size [2019-11-23 20:50:56,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 88 treesize of output 102 [2019-11-23 20:50:56,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:56,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:56,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:56,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:97, output treesize:93 [2019-11-23 20:50:57,033 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 37 [2019-11-23 20:50:57,034 INFO L343 Elim1Store]: treesize reduction 615, result has 10.5 percent of original size [2019-11-23 20:50:57,034 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 100 treesize of output 105 [2019-11-23 20:50:57,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:57,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:57,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:57,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:93 [2019-11-23 20:50:57,375 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 42 [2019-11-23 20:50:57,376 INFO L343 Elim1Store]: treesize reduction 651, result has 11.5 percent of original size [2019-11-23 20:50:57,376 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 117 [2019-11-23 20:50:57,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:57,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:57,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:57,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:105 [2019-11-23 20:50:57,647 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 42 [2019-11-23 20:50:57,648 INFO L343 Elim1Store]: treesize reduction 781, result has 9.7 percent of original size [2019-11-23 20:50:57,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 112 treesize of output 120 [2019-11-23 20:50:57,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:57,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:57,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:57,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:121, output treesize:105 [2019-11-23 20:50:58,090 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 47 [2019-11-23 20:50:58,091 INFO L343 Elim1Store]: treesize reduction 816, result has 10.6 percent of original size [2019-11-23 20:50:58,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 109 treesize of output 129 [2019-11-23 20:50:58,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:58,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:58,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:58,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:118, output treesize:114 [2019-11-23 20:50:58,406 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 47 [2019-11-23 20:50:58,407 INFO L343 Elim1Store]: treesize reduction 965, result has 9.0 percent of original size [2019-11-23 20:50:58,407 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 121 treesize of output 132 [2019-11-23 20:50:58,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:58,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:58,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:58,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:130, output treesize:106 [2019-11-23 20:50:58,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,925 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:58,926 INFO L377 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 185 treesize of output 133 [2019-11-23 20:50:58,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:58,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:58,963 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-11-23 20:50:58,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:199, output treesize:195 [2019-11-23 20:50:59,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:51:00,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:51:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 105 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:00,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:51:00,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 40] total 65 [2019-11-23 20:51:00,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358014455] [2019-11-23 20:51:00,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-23 20:51:00,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:00,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-23 20:51:00,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=3511, Unknown=0, NotChecked=0, Total=4160 [2019-11-23 20:51:00,451 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 65 states. [2019-11-23 20:51:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:05,050 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-11-23 20:51:05,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-11-23 20:51:05,051 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 76 [2019-11-23 20:51:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:05,052 INFO L225 Difference]: With dead ends: 91 [2019-11-23 20:51:05,052 INFO L226 Difference]: Without dead ends: 89 [2019-11-23 20:51:05,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 38 SyntacticMatches, 14 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3354 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1568, Invalid=8734, Unknown=0, NotChecked=0, Total=10302 [2019-11-23 20:51:05,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-23 20:51:05,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2019-11-23 20:51:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-23 20:51:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2019-11-23 20:51:05,067 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 76 [2019-11-23 20:51:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:05,067 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2019-11-23 20:51:05,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-23 20:51:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2019-11-23 20:51:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 20:51:05,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:05,068 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:05,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:05,272 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:05,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:05,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2057478922, now seen corresponding path program 16 times [2019-11-23 20:51:05,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:05,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108139800] [2019-11-23 20:51:05,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 129 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:05,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108139800] [2019-11-23 20:51:05,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868661326] [2019-11-23 20:51:05,395 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:05,458 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:51:05,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:51:05,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:51:05,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:51:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 162 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:05,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:51:05,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 25 [2019-11-23 20:51:05,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883838725] [2019-11-23 20:51:05,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 20:51:05,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:05,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 20:51:05,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=374, Unknown=0, NotChecked=0, Total=600 [2019-11-23 20:51:05,617 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 25 states. [2019-11-23 20:51:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:05,907 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2019-11-23 20:51:05,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 20:51:05,907 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 80 [2019-11-23 20:51:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:05,908 INFO L225 Difference]: With dead ends: 138 [2019-11-23 20:51:05,908 INFO L226 Difference]: Without dead ends: 87 [2019-11-23 20:51:05,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:51:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-23 20:51:05,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-11-23 20:51:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-23 20:51:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2019-11-23 20:51:05,917 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 80 [2019-11-23 20:51:05,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:05,917 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2019-11-23 20:51:05,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 20:51:05,917 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2019-11-23 20:51:05,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 20:51:05,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:05,918 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:06,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:06,122 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:06,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:06,122 INFO L82 PathProgramCache]: Analyzing trace with hash -103116603, now seen corresponding path program 17 times [2019-11-23 20:51:06,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:06,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700415479] [2019-11-23 20:51:06,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 27 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:06,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700415479] [2019-11-23 20:51:06,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229145570] [2019-11-23 20:51:06,925 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:07,089 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-11-23 20:51:07,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:51:07,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 76 conjunts are in the unsatisfiable core [2019-11-23 20:51:07,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:51:07,140 INFO L377 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-11-23 20:51:07,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:07,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:07,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:07,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:51:07,231 INFO L343 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-23 20:51:07,232 INFO L377 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 28 treesize of output 27 [2019-11-23 20:51:07,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:07,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:07,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:07,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-11-23 20:51:07,309 INFO L343 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2019-11-23 20:51:07,310 INFO L377 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 40 treesize of output 42 [2019-11-23 20:51:07,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:07,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:07,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:07,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-11-23 20:51:07,469 INFO L343 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-11-23 20:51:07,470 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2019-11-23 20:51:07,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:07,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:07,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:07,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:57 [2019-11-23 20:51:07,576 INFO L343 Elim1Store]: treesize reduction 225, result has 13.8 percent of original size [2019-11-23 20:51:07,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 60 [2019-11-23 20:51:07,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:07,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:07,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:07,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:57 [2019-11-23 20:51:07,761 INFO L343 Elim1Store]: treesize reduction 264, result has 15.7 percent of original size [2019-11-23 20:51:07,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 72 [2019-11-23 20:51:07,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:07,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:07,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:07,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:69 [2019-11-23 20:51:07,912 INFO L343 Elim1Store]: treesize reduction 337, result has 12.5 percent of original size [2019-11-23 20:51:07,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 76 treesize of output 75 [2019-11-23 20:51:07,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:07,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:07,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:07,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:69 [2019-11-23 20:51:08,137 INFO L343 Elim1Store]: treesize reduction 375, result has 14.0 percent of original size [2019-11-23 20:51:08,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 87 [2019-11-23 20:51:08,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:08,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:08,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:08,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2019-11-23 20:51:08,327 INFO L343 Elim1Store]: treesize reduction 467, result has 11.4 percent of original size [2019-11-23 20:51:08,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 90 [2019-11-23 20:51:08,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:08,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:08,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:08,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:97, output treesize:81 [2019-11-23 20:51:08,615 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 37 [2019-11-23 20:51:08,615 INFO L343 Elim1Store]: treesize reduction 504, result has 12.7 percent of original size [2019-11-23 20:51:08,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 88 treesize of output 102 [2019-11-23 20:51:08,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:08,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:08,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:08,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:97, output treesize:93 [2019-11-23 20:51:08,845 INFO L343 Elim1Store]: treesize reduction 615, result has 10.5 percent of original size [2019-11-23 20:51:08,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 100 treesize of output 105 [2019-11-23 20:51:08,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:08,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:08,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:08,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:93 [2019-11-23 20:51:09,221 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 42 [2019-11-23 20:51:09,222 INFO L343 Elim1Store]: treesize reduction 651, result has 11.5 percent of original size [2019-11-23 20:51:09,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 117 [2019-11-23 20:51:09,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:09,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:09,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:09,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:105 [2019-11-23 20:51:09,512 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 42 [2019-11-23 20:51:09,512 INFO L343 Elim1Store]: treesize reduction 781, result has 9.7 percent of original size [2019-11-23 20:51:09,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 112 treesize of output 120 [2019-11-23 20:51:09,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:09,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:09,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:09,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:121, output treesize:105 [2019-11-23 20:51:09,922 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 47 [2019-11-23 20:51:09,923 INFO L343 Elim1Store]: treesize reduction 816, result has 10.6 percent of original size [2019-11-23 20:51:09,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 112 treesize of output 132 [2019-11-23 20:51:09,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:09,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:09,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:09,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:121, output treesize:117 [2019-11-23 20:51:10,281 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 47 [2019-11-23 20:51:10,282 INFO L343 Elim1Store]: treesize reduction 965, result has 9.0 percent of original size [2019-11-23 20:51:10,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 124 treesize of output 135 [2019-11-23 20:51:10,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:10,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:10,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:10,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:133, output treesize:117 [2019-11-23 20:51:10,782 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 52 [2019-11-23 20:51:10,783 INFO L343 Elim1Store]: treesize reduction 999, result has 9.8 percent of original size [2019-11-23 20:51:10,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 121 treesize of output 144 [2019-11-23 20:51:10,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:10,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:10,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:10,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:130, output treesize:126 [2019-11-23 20:51:11,198 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 52 [2019-11-23 20:51:11,199 INFO L343 Elim1Store]: treesize reduction 1167, result has 8.5 percent of original size [2019-11-23 20:51:11,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 54 case distinctions, treesize of input 133 treesize of output 147 [2019-11-23 20:51:11,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:11,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:11,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:11,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:142, output treesize:118 [2019-11-23 20:51:11,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:11,782 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:11,783 INFO L377 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 206 treesize of output 148 [2019-11-23 20:51:11,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:11,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:11,824 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-11-23 20:51:11,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:220, output treesize:216 [2019-11-23 20:51:12,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:51:13,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:51:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 135 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:13,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:51:13,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 44] total 69 [2019-11-23 20:51:13,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913185212] [2019-11-23 20:51:13,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-23 20:51:13,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:13,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-23 20:51:13,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=3982, Unknown=0, NotChecked=0, Total=4692 [2019-11-23 20:51:13,429 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 69 states. [2019-11-23 20:51:16,684 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-11-23 20:51:18,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:18,875 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2019-11-23 20:51:18,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-11-23 20:51:18,876 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 84 [2019-11-23 20:51:18,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:18,877 INFO L225 Difference]: With dead ends: 99 [2019-11-23 20:51:18,877 INFO L226 Difference]: Without dead ends: 97 [2019-11-23 20:51:18,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 43 SyntacticMatches, 15 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3573 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1720, Invalid=10052, Unknown=0, NotChecked=0, Total=11772 [2019-11-23 20:51:18,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-23 20:51:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2019-11-23 20:51:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-23 20:51:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2019-11-23 20:51:18,891 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 84 [2019-11-23 20:51:18,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:18,891 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2019-11-23 20:51:18,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-23 20:51:18,891 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2019-11-23 20:51:18,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-23 20:51:18,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:18,892 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:19,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:19,096 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:19,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:19,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2110702651, now seen corresponding path program 18 times [2019-11-23 20:51:19,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:19,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145119018] [2019-11-23 20:51:19,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 163 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:19,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145119018] [2019-11-23 20:51:19,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673775073] [2019-11-23 20:51:19,255 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:19,496 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-11-23 20:51:19,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:51:19,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 20:51:19,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:51:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 200 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:19,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:51:19,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24] total 27 [2019-11-23 20:51:19,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841027597] [2019-11-23 20:51:19,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 20:51:19,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:19,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 20:51:19,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=438, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:51:19,663 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 27 states. [2019-11-23 20:51:19,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:19,910 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2019-11-23 20:51:19,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-23 20:51:19,916 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 88 [2019-11-23 20:51:19,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:19,916 INFO L225 Difference]: With dead ends: 150 [2019-11-23 20:51:19,916 INFO L226 Difference]: Without dead ends: 95 [2019-11-23 20:51:19,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=476, Unknown=0, NotChecked=0, Total=756 [2019-11-23 20:51:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-23 20:51:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-11-23 20:51:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-23 20:51:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2019-11-23 20:51:19,929 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 88 [2019-11-23 20:51:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:19,929 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2019-11-23 20:51:19,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 20:51:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2019-11-23 20:51:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-23 20:51:19,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:19,930 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:20,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:20,134 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:20,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:20,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2126956278, now seen corresponding path program 19 times [2019-11-23 20:51:20,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:20,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339220701] [2019-11-23 20:51:20,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 30 proven. 401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:21,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339220701] [2019-11-23 20:51:21,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851142286] [2019-11-23 20:51:21,022 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:21,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 77 conjunts are in the unsatisfiable core [2019-11-23 20:51:21,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:51:21,116 INFO L377 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-11-23 20:51:21,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:21,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:21,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:21,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:51:21,201 INFO L343 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-23 20:51:21,201 INFO L377 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 28 treesize of output 27 [2019-11-23 20:51:21,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:21,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:21,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:21,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-23 20:51:21,283 INFO L343 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2019-11-23 20:51:21,284 INFO L377 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 40 treesize of output 42 [2019-11-23 20:51:21,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:21,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:21,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:21,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-11-23 20:51:21,430 INFO L343 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-11-23 20:51:21,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2019-11-23 20:51:21,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:21,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:21,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:21,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2019-11-23 20:51:21,540 INFO L343 Elim1Store]: treesize reduction 225, result has 13.8 percent of original size [2019-11-23 20:51:21,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 60 [2019-11-23 20:51:21,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:21,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:21,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:21,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:54 [2019-11-23 20:51:21,723 INFO L343 Elim1Store]: treesize reduction 264, result has 15.7 percent of original size [2019-11-23 20:51:21,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 72 [2019-11-23 20:51:21,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:21,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:21,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:21,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:66 [2019-11-23 20:51:21,866 INFO L343 Elim1Store]: treesize reduction 337, result has 12.5 percent of original size [2019-11-23 20:51:21,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 76 treesize of output 75 [2019-11-23 20:51:21,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:21,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:21,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:21,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:66 [2019-11-23 20:51:22,087 INFO L343 Elim1Store]: treesize reduction 375, result has 14.0 percent of original size [2019-11-23 20:51:22,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 87 [2019-11-23 20:51:22,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:22,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:22,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:22,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:78 [2019-11-23 20:51:22,269 INFO L343 Elim1Store]: treesize reduction 467, result has 11.4 percent of original size [2019-11-23 20:51:22,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 90 [2019-11-23 20:51:22,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:22,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:22,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:22,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:94, output treesize:78 [2019-11-23 20:51:22,553 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 37 [2019-11-23 20:51:22,554 INFO L343 Elim1Store]: treesize reduction 504, result has 12.7 percent of original size [2019-11-23 20:51:22,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 88 treesize of output 102 [2019-11-23 20:51:22,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:22,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:22,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:22,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:94, output treesize:90 [2019-11-23 20:51:22,788 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 37 [2019-11-23 20:51:22,788 INFO L343 Elim1Store]: treesize reduction 615, result has 10.5 percent of original size [2019-11-23 20:51:22,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 100 treesize of output 105 [2019-11-23 20:51:22,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:22,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:22,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:22,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:106, output treesize:90 [2019-11-23 20:51:23,132 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 42 [2019-11-23 20:51:23,133 INFO L343 Elim1Store]: treesize reduction 651, result has 11.5 percent of original size [2019-11-23 20:51:23,133 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 117 [2019-11-23 20:51:23,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:23,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:23,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:23,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:106, output treesize:102 [2019-11-23 20:51:23,415 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 42 [2019-11-23 20:51:23,416 INFO L343 Elim1Store]: treesize reduction 781, result has 9.7 percent of original size [2019-11-23 20:51:23,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 112 treesize of output 120 [2019-11-23 20:51:23,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:23,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:23,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:23,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:118, output treesize:102 [2019-11-23 20:51:23,841 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 47 [2019-11-23 20:51:23,842 INFO L343 Elim1Store]: treesize reduction 816, result has 10.6 percent of original size [2019-11-23 20:51:23,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 112 treesize of output 132 [2019-11-23 20:51:23,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:23,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:23,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:23,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:118, output treesize:114 [2019-11-23 20:51:24,213 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 47 [2019-11-23 20:51:24,214 INFO L343 Elim1Store]: treesize reduction 965, result has 9.0 percent of original size [2019-11-23 20:51:24,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 124 treesize of output 135 [2019-11-23 20:51:24,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:24,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:24,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:24,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:130, output treesize:114 [2019-11-23 20:51:24,701 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 52 [2019-11-23 20:51:24,702 INFO L343 Elim1Store]: treesize reduction 999, result has 9.8 percent of original size [2019-11-23 20:51:24,702 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 124 treesize of output 147 [2019-11-23 20:51:24,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:24,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:24,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:24,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:130, output treesize:126 [2019-11-23 20:51:25,137 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 52 [2019-11-23 20:51:25,139 INFO L343 Elim1Store]: treesize reduction 1167, result has 8.5 percent of original size [2019-11-23 20:51:25,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 54 case distinctions, treesize of input 136 treesize of output 150 [2019-11-23 20:51:25,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:25,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:25,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:25,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:142, output treesize:126 [2019-11-23 20:51:25,723 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 57 [2019-11-23 20:51:25,724 INFO L343 Elim1Store]: treesize reduction 1200, result has 9.2 percent of original size [2019-11-23 20:51:25,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 133 treesize of output 159 [2019-11-23 20:51:25,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:25,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:25,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:25,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:142, output treesize:138 [2019-11-23 20:51:26,240 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 57 [2019-11-23 20:51:26,241 INFO L343 Elim1Store]: treesize reduction 1387, result has 8.0 percent of original size [2019-11-23 20:51:26,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 65 case distinctions, treesize of input 145 treesize of output 162 [2019-11-23 20:51:26,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:26,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:51:26,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:51:26,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:154, output treesize:130 [2019-11-23 20:51:27,266 WARN L192 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 105 [2019-11-23 20:51:27,267 INFO L343 Elim1Store]: treesize reduction 851, result has 36.5 percent of original size [2019-11-23 20:51:27,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 227 treesize of output 532 [2019-11-23 20:51:27,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:27,473 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 62 [2019-11-23 20:51:27,474 INFO L567 ElimStorePlain]: treesize reduction 450, result has 34.5 percent of original size [2019-11-23 20:51:27,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 20:51:27,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:241, output treesize:237 [2019-11-23 20:51:27,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:51:29,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:51:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 167 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:29,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:51:29,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 47] total 74 [2019-11-23 20:51:29,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634643213] [2019-11-23 20:51:29,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-11-23 20:51:29,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:29,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-11-23 20:51:29,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=4598, Unknown=0, NotChecked=0, Total=5402 [2019-11-23 20:51:29,350 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 74 states. [2019-11-23 20:51:32,972 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 100 [2019-11-23 20:51:33,224 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 101