/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/rewnifrev2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:49:51,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:49:51,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:49:51,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:49:51,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:49:51,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:49:51,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:49:51,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:49:51,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:49:51,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:49:51,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:49:51,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:49:51,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:49:51,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:49:51,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:49:51,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:49:51,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:49:51,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:49:51,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:49:51,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:49:51,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:49:51,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:49:51,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:49:51,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:49:51,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:49:51,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:49:51,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:49:51,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:49:51,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:49:51,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:49:51,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:49:51,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:49:51,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:49:51,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:49:51,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:49:51,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:49:51,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:49:51,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:49:51,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:49:51,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:49:51,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:49:51,404 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:51,418 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:49:51,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:49:51,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:49:51,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:49:51,420 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:49:51,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:49:51,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:49:51,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:49:51,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:49:51,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:49:51,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:49:51,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:49:51,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:49:51,422 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:49:51,422 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:49:51,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:49:51,422 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:49:51,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:49:51,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:49:51,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:49:51,423 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:49:51,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:49:51,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:49:51,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:49:51,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:49:51,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:49:51,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:49:51,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:49:51,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:49:51,426 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:49:51,691 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:49:51,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:49:51,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:49:51,708 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:49:51,708 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:49:51,709 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewnifrev2.c [2019-11-23 20:49:51,766 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eaeda39d/c7b05673e3344d15b4b8ac1f71d2ada0/FLAG17975ae44 [2019-11-23 20:49:52,189 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:49:52,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewnifrev2.c [2019-11-23 20:49:52,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eaeda39d/c7b05673e3344d15b4b8ac1f71d2ada0/FLAG17975ae44 [2019-11-23 20:49:52,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eaeda39d/c7b05673e3344d15b4b8ac1f71d2ada0 [2019-11-23 20:49:52,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:49:52,595 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:49:52,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:49:52,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:49:52,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:49:52,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:49:52" (1/1) ... [2019-11-23 20:49:52,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c535360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:52, skipping insertion in model container [2019-11-23 20:49:52,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:49:52" (1/1) ... [2019-11-23 20:49:52,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:49:52,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:49:52,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:49:52,813 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:49:52,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:49:52,842 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:49:52,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:52 WrapperNode [2019-11-23 20:49:52,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:49:52,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:49:52,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:49:52,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:49:52,852 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:52" (1/1) ... [2019-11-23 20:49:52,928 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:52" (1/1) ... [2019-11-23 20:49:52,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:49:52,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:49:52,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:49:52,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:49:52,963 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:52" (1/1) ... [2019-11-23 20:49:52,963 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:52" (1/1) ... [2019-11-23 20:49:52,976 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:52" (1/1) ... [2019-11-23 20:49:52,976 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:52" (1/1) ... [2019-11-23 20:49:52,987 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:52" (1/1) ... [2019-11-23 20:49:52,992 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:52" (1/1) ... [2019-11-23 20:49:52,993 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:52" (1/1) ... [2019-11-23 20:49:52,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:49:52,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:49:52,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:49:52,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:49:52,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:52" (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:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:49:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 20:49:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:49:53,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:49:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:49:53,265 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:49:53,266 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-23 20:49:53,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:49:53 BoogieIcfgContainer [2019-11-23 20:49:53,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:49:53,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:49:53,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:49:53,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:49:53,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:49:52" (1/3) ... [2019-11-23 20:49:53,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fda5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:49:53, skipping insertion in model container [2019-11-23 20:49:53,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:52" (2/3) ... [2019-11-23 20:49:53,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fda5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:49:53, skipping insertion in model container [2019-11-23 20:49:53,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:49:53" (3/3) ... [2019-11-23 20:49:53,287 INFO L109 eAbstractionObserver]: Analyzing ICFG rewnifrev2.c [2019-11-23 20:49:53,299 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:49:53,306 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:49:53,327 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:49:53,356 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:49:53,356 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:49:53,356 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:49:53,356 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:49:53,356 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:49:53,357 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:49:53,357 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:49:53,357 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:49:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-11-23 20:49:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-23 20:49:53,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:53,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:53,375 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:53,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash 126991449, now seen corresponding path program 1 times [2019-11-23 20:49:53,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:53,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226301513] [2019-11-23 20:49:53,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:53,505 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:53,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226301513] [2019-11-23 20:49:53,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:49:53,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:49:53,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349721789] [2019-11-23 20:49:53,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 20:49:53,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:53,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 20:49:53,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 20:49:53,529 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 2 states. [2019-11-23 20:49:53,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:53,546 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-11-23 20:49:53,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 20:49:53,548 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-23 20:49:53,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:53,558 INFO L225 Difference]: With dead ends: 27 [2019-11-23 20:49:53,558 INFO L226 Difference]: Without dead ends: 12 [2019-11-23 20:49:53,561 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:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-11-23 20:49:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-23 20:49:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-23 20:49:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-11-23 20:49:53,595 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2019-11-23 20:49:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:53,595 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-23 20:49:53,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 20:49:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-11-23 20:49:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-23 20:49:53,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:53,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:53,596 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:53,599 INFO L82 PathProgramCache]: Analyzing trace with hash 121450323, now seen corresponding path program 1 times [2019-11-23 20:49:53,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:53,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722188197] [2019-11-23 20:49:53,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:53,658 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:53,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722188197] [2019-11-23 20:49:53,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:49:53,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:49:53,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408626550] [2019-11-23 20:49:53,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:49:53,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:53,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:49:53,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:49:53,663 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-11-23 20:49:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:53,704 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-11-23 20:49:53,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:49:53,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-23 20:49:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:53,705 INFO L225 Difference]: With dead ends: 20 [2019-11-23 20:49:53,706 INFO L226 Difference]: Without dead ends: 13 [2019-11-23 20:49:53,707 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:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-23 20:49:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-23 20:49:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-23 20:49:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-11-23 20:49:53,711 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2019-11-23 20:49:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:53,711 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-23 20:49:53,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:49:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-11-23 20:49:53,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-23 20:49:53,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:53,713 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:53,713 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:53,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:53,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1899941007, now seen corresponding path program 1 times [2019-11-23 20:49:53,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:53,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307761229] [2019-11-23 20:49:53,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:54,045 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:54,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307761229] [2019-11-23 20:49:54,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:49:54,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 20:49:54,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046437722] [2019-11-23 20:49:54,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 20:49:54,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:54,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 20:49:54,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:49:54,051 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 8 states. [2019-11-23 20:49:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:54,218 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-11-23 20:49:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 20:49:54,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-23 20:49:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:54,220 INFO L225 Difference]: With dead ends: 19 [2019-11-23 20:49:54,220 INFO L226 Difference]: Without dead ends: 17 [2019-11-23 20:49:54,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-23 20:49:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-23 20:49:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-11-23 20:49:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-23 20:49:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-23 20:49:54,231 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2019-11-23 20:49:54,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:54,231 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-23 20:49:54,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 20:49:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-11-23 20:49:54,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 20:49:54,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:54,233 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:54,233 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:54,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:54,234 INFO L82 PathProgramCache]: Analyzing trace with hash 604563239, now seen corresponding path program 1 times [2019-11-23 20:49:54,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:54,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072050016] [2019-11-23 20:49:54,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:54,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072050016] [2019-11-23 20:49:54,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457022048] [2019-11-23 20:49:54,464 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:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:54,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-23 20:49:54,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:54,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:54,598 INFO L343 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-11-23 20:49:54,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2019-11-23 20:49:54,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:54,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:54,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:54,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-11-23 20:49:54,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:54,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:54,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:54,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-23 20:49:54,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333030646] [2019-11-23 20:49:54,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:49:54,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:54,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:49:54,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:49:54,869 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 15 states. [2019-11-23 20:49:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:55,216 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-23 20:49:55,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 20:49:55,217 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-11-23 20:49:55,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:55,218 INFO L225 Difference]: With dead ends: 24 [2019-11-23 20:49:55,218 INFO L226 Difference]: Without dead ends: 22 [2019-11-23 20:49:55,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:49:55,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-23 20:49:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2019-11-23 20:49:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-23 20:49:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-11-23 20:49:55,225 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2019-11-23 20:49:55,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:55,226 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-23 20:49:55,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:49:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-11-23 20:49:55,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 20:49:55,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:55,228 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:55,431 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:55,432 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:55,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:55,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1572614179, now seen corresponding path program 2 times [2019-11-23 20:49:55,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:55,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380907766] [2019-11-23 20:49:55,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:55,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380907766] [2019-11-23 20:49:55,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156544835] [2019-11-23 20:49:55,509 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:55,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:49:55,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:55,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-23 20:49:55,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:55,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:55,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-23 20:49:55,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128693680] [2019-11-23 20:49:55,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 20:49:55,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:55,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 20:49:55,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-11-23 20:49:55,625 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 11 states. [2019-11-23 20:49:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:55,706 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-11-23 20:49:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 20:49:55,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-23 20:49:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:55,708 INFO L225 Difference]: With dead ends: 38 [2019-11-23 20:49:55,708 INFO L226 Difference]: Without dead ends: 22 [2019-11-23 20:49:55,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 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:49:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-23 20:49:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-23 20:49:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 20:49:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-11-23 20:49:55,718 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-11-23 20:49:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:55,718 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-23 20:49:55,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 20:49:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-11-23 20:49:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 20:49:55,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:55,720 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:55,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:55,924 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:55,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:55,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1704999301, now seen corresponding path program 3 times [2019-11-23 20:49:55,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:55,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623273495] [2019-11-23 20:49:55,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:56,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623273495] [2019-11-23 20:49:56,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009839826] [2019-11-23 20:49:56,169 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:56,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 20:49:56,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:56,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-23 20:49:56,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:56,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:56,252 INFO L343 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-11-23 20:49:56,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2019-11-23 20:49:56,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:56,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:56,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:56,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2019-11-23 20:49:56,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:56,434 INFO L343 Elim1Store]: treesize reduction 132, result has 51.6 percent of original size [2019-11-23 20:49:56,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 163 [2019-11-23 20:49:56,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:56,480 INFO L567 ElimStorePlain]: treesize reduction 106, result has 36.5 percent of original size [2019-11-23 20:49:56,482 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:49:56,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:61 [2019-11-23 20:49:56,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:56,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:56,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:56,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2019-11-23 20:49:56,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878250314] [2019-11-23 20:49:56,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 20:49:56,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:56,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 20:49:56,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2019-11-23 20:49:56,935 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 22 states. [2019-11-23 20:49:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:58,542 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-11-23 20:49:58,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-23 20:49:58,543 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 20 [2019-11-23 20:49:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:58,544 INFO L225 Difference]: With dead ends: 47 [2019-11-23 20:49:58,544 INFO L226 Difference]: Without dead ends: 31 [2019-11-23 20:49:58,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=371, Invalid=1699, Unknown=0, NotChecked=0, Total=2070 [2019-11-23 20:49:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-23 20:49:58,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-11-23 20:49:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-23 20:49:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-23 20:49:58,552 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2019-11-23 20:49:58,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:58,552 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-23 20:49:58,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 20:49:58,552 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-23 20:49:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 20:49:58,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:58,553 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:58,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:58,758 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:58,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:58,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1670835535, now seen corresponding path program 4 times [2019-11-23 20:49:58,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:58,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247214373] [2019-11-23 20:49:58,759 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,989 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:58,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247214373] [2019-11-23 20:49:58,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202105742] [2019-11-23 20:49:58,990 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:59,025 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:49:59,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:59,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 20:49:59,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:59,049 INFO L343 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-11-23 20:49:59,049 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-11-23 20:49:59,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:59,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:59,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:59,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:26 [2019-11-23 20:49:59,137 INFO L343 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-11-23 20:49:59,138 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 54 treesize of output 48 [2019-11-23 20:49:59,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:59,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:59,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:59,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:40 [2019-11-23 20:49:59,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:59,273 INFO L343 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-11-23 20:49:59,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 65 [2019-11-23 20:49:59,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:59,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:59,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:59,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:57 [2019-11-23 20:49:59,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:59,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:59,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:59,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2019-11-23 20:49:59,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923604802] [2019-11-23 20:49:59,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 20:49:59,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:59,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 20:49:59,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-11-23 20:49:59,703 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 25 states. [2019-11-23 20:50:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:00,346 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-23 20:50:00,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 20:50:00,346 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2019-11-23 20:50:00,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:00,348 INFO L225 Difference]: With dead ends: 36 [2019-11-23 20:50:00,348 INFO L226 Difference]: Without dead ends: 34 [2019-11-23 20:50:00,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=945, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 20:50:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-23 20:50:00,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-11-23 20:50:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-23 20:50:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-11-23 20:50:00,358 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2019-11-23 20:50:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:00,358 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-11-23 20:50:00,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 20:50:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-11-23 20:50:00,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 20:50:00,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:00,360 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:00,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:00,563 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:00,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:00,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1047363067, now seen corresponding path program 5 times [2019-11-23 20:50:00,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:00,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610132945] [2019-11-23 20:50:00,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:00,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610132945] [2019-11-23 20:50:00,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238723763] [2019-11-23 20:50:00,654 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:00,712 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-23 20:50:00,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:00,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-23 20:50:00,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:00,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:00,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2019-11-23 20:50:00,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361595503] [2019-11-23 20:50:00,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:50:00,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:00,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:50:00,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:50:00,794 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 15 states. [2019-11-23 20:50:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:00,907 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-11-23 20:50:00,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 20:50:00,909 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2019-11-23 20:50:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:00,909 INFO L225 Difference]: With dead ends: 58 [2019-11-23 20:50:00,909 INFO L226 Difference]: Without dead ends: 34 [2019-11-23 20:50:00,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:50:00,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-23 20:50:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-23 20:50:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-23 20:50:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-11-23 20:50:00,917 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-11-23 20:50:00,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:00,918 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-11-23 20:50:00,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:50:00,918 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-11-23 20:50:00,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 20:50:00,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:00,919 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:01,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:01,122 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:01,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash -2041873501, now seen corresponding path program 6 times [2019-11-23 20:50:01,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:01,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876694797] [2019-11-23 20:50:01,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:01,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876694797] [2019-11-23 20:50:01,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095256667] [2019-11-23 20:50:01,474 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:01,540 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-23 20:50:01,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:01,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 20:50:01,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:01,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:01,575 INFO L343 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-11-23 20:50:01,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2019-11-23 20:50:01,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:01,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:01,582 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,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2019-11-23 20:50:01,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:01,670 INFO L343 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-11-23 20:50:01,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 48 [2019-11-23 20:50:01,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:01,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:01,682 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,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:45 [2019-11-23 20:50:01,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:01,802 INFO L343 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-11-23 20:50:01,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 65 [2019-11-23 20:50:01,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:01,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:01,816 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,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:59 [2019-11-23 20:50:01,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:01,962 INFO L343 Elim1Store]: treesize reduction 430, result has 10.0 percent of original size [2019-11-23 20:50:01,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 82 [2019-11-23 20:50:01,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:01,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:01,977 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,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:87, output treesize:73 [2019-11-23 20:50:02,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:02,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:02,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:02,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 30 [2019-11-23 20:50:02,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905214808] [2019-11-23 20:50:02,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-23 20:50:02,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:02,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-23 20:50:02,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2019-11-23 20:50:02,594 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 30 states. [2019-11-23 20:50:05,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:05,002 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-23 20:50:05,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-23 20:50:05,002 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 32 [2019-11-23 20:50:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:05,003 INFO L225 Difference]: With dead ends: 67 [2019-11-23 20:50:05,003 INFO L226 Difference]: Without dead ends: 43 [2019-11-23 20:50:05,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=588, Invalid=3318, Unknown=0, NotChecked=0, Total=3906 [2019-11-23 20:50:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-23 20:50:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-11-23 20:50:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-23 20:50:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-11-23 20:50:05,011 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 32 [2019-11-23 20:50:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:05,012 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-11-23 20:50:05,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-23 20:50:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-11-23 20:50:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 20:50:05,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:05,013 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:05,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:05,217 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:05,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:05,217 INFO L82 PathProgramCache]: Analyzing trace with hash 811766135, now seen corresponding path program 7 times [2019-11-23 20:50:05,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:05,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813386188] [2019-11-23 20:50:05,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 5 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:05,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813386188] [2019-11-23 20:50:05,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366251186] [2019-11-23 20:50:05,536 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:05,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-23 20:50:05,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:05,589 INFO L343 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-11-23 20:50:05,590 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-11-23 20:50:05,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:05,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:05,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:05,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:26 [2019-11-23 20:50:05,673 INFO L343 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-11-23 20:50:05,673 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 54 treesize of output 48 [2019-11-23 20:50:05,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:05,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:05,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:05,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:40 [2019-11-23 20:50:05,790 INFO L343 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-11-23 20:50:05,791 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 68 treesize of output 65 [2019-11-23 20:50:05,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:05,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:05,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:05,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2019-11-23 20:50:05,955 INFO L343 Elim1Store]: treesize reduction 430, result has 10.0 percent of original size [2019-11-23 20:50:05,956 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 82 treesize of output 82 [2019-11-23 20:50:05,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:05,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:05,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:05,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:68 [2019-11-23 20:50:06,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:06,193 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 31 [2019-11-23 20:50:06,194 INFO L343 Elim1Store]: treesize reduction 596, result has 9.1 percent of original size [2019-11-23 20:50:06,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 99 [2019-11-23 20:50:06,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:06,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:06,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:06,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:99, output treesize:85 [2019-11-23 20:50:06,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:06,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 21 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:06,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:06,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21] total 33 [2019-11-23 20:50:06,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752013751] [2019-11-23 20:50:06,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-23 20:50:06,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:06,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-23 20:50:06,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 20:50:06,941 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 33 states. [2019-11-23 20:50:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:08,015 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-11-23 20:50:08,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 20:50:08,017 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 38 [2019-11-23 20:50:08,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:08,018 INFO L225 Difference]: With dead ends: 48 [2019-11-23 20:50:08,018 INFO L226 Difference]: Without dead ends: 46 [2019-11-23 20:50:08,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=540, Invalid=1716, Unknown=0, NotChecked=0, Total=2256 [2019-11-23 20:50:08,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-23 20:50:08,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-11-23 20:50:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-23 20:50:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-11-23 20:50:08,028 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2019-11-23 20:50:08,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:08,028 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-11-23 20:50:08,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-23 20:50:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-11-23 20:50:08,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-23 20:50:08,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:08,030 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:08,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:08,238 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:08,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:08,239 INFO L82 PathProgramCache]: Analyzing trace with hash 975163949, now seen corresponding path program 8 times [2019-11-23 20:50:08,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:08,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903280197] [2019-11-23 20:50:08,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 51 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:08,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903280197] [2019-11-23 20:50:08,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297418768] [2019-11-23 20:50:08,349 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:08,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:50:08,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:08,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 20:50:08,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:08,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:08,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 19 [2019-11-23 20:50:08,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617506221] [2019-11-23 20:50:08,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 20:50:08,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:08,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 20:50:08,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:50:08,541 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 19 states. [2019-11-23 20:50:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:08,671 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-11-23 20:50:08,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 20:50:08,672 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2019-11-23 20:50:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:08,673 INFO L225 Difference]: With dead ends: 78 [2019-11-23 20:50:08,673 INFO L226 Difference]: Without dead ends: 46 [2019-11-23 20:50:08,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 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:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-23 20:50:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-11-23 20:50:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-23 20:50:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-11-23 20:50:08,686 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-11-23 20:50:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:08,689 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-11-23 20:50:08,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 20:50:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-11-23 20:50:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 20:50:08,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:08,693 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:08,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:08,898 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:08,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:08,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1359564491, now seen corresponding path program 9 times [2019-11-23 20:50:08,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:08,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312057574] [2019-11-23 20:50:08,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 6 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:09,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312057574] [2019-11-23 20:50:09,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3107581] [2019-11-23 20:50:09,277 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:09,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-23 20:50:09,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:09,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-23 20:50:09,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:09,440 INFO L343 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-11-23 20:50:09,440 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-11-23 20:50:09,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:09,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:09,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:09,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-11-23 20:50:09,541 INFO L343 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-11-23 20:50:09,542 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 54 treesize of output 48 [2019-11-23 20:50:09,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:09,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:09,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:09,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2019-11-23 20:50:09,674 INFO L343 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-11-23 20:50:09,675 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 68 treesize of output 65 [2019-11-23 20:50:09,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:09,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:09,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:09,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:57 [2019-11-23 20:50:09,849 INFO L343 Elim1Store]: treesize reduction 430, result has 10.0 percent of original size [2019-11-23 20:50:09,849 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 82 treesize of output 82 [2019-11-23 20:50:09,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:09,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:09,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:09,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:71 [2019-11-23 20:50:10,055 INFO L343 Elim1Store]: treesize reduction 596, result has 9.1 percent of original size [2019-11-23 20:50:10,055 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 96 treesize of output 99 [2019-11-23 20:50:10,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:10,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:10,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:10,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:99, output treesize:85 [2019-11-23 20:50:10,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,248 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:10,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 110 treesize of output 116 [2019-11-23 20:50:10,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:10,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:10,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:10,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:116, output treesize:102 [2019-11-23 20:50:10,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:11,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 31 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:11,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:11,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 38 [2019-11-23 20:50:11,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722011738] [2019-11-23 20:50:11,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-23 20:50:11,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:11,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-23 20:50:11,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1058, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 20:50:11,697 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 38 states. [2019-11-23 20:50:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:13,094 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-23 20:50:13,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-23 20:50:13,095 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-11-23 20:50:13,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:13,096 INFO L225 Difference]: With dead ends: 54 [2019-11-23 20:50:13,096 INFO L226 Difference]: Without dead ends: 52 [2019-11-23 20:50:13,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=771, Invalid=2309, Unknown=0, NotChecked=0, Total=3080 [2019-11-23 20:50:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-23 20:50:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-11-23 20:50:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-23 20:50:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-11-23 20:50:13,108 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2019-11-23 20:50:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:13,108 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-11-23 20:50:13,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-23 20:50:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-11-23 20:50:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-23 20:50:13,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:13,109 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:13,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:13,313 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:13,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:13,314 INFO L82 PathProgramCache]: Analyzing trace with hash 62899585, now seen corresponding path program 10 times [2019-11-23 20:50:13,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:13,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082886388] [2019-11-23 20:50:13,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 73 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:13,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082886388] [2019-11-23 20:50:13,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120726782] [2019-11-23 20:50:13,419 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:13,469 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:50:13,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:13,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-23 20:50:13,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 98 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:13,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:13,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 21 [2019-11-23 20:50:13,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010021647] [2019-11-23 20:50:13,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 20:50:13,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:13,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 20:50:13,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:50:13,632 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 21 states. [2019-11-23 20:50:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:13,809 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-11-23 20:50:13,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 20:50:13,810 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2019-11-23 20:50:13,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:13,810 INFO L225 Difference]: With dead ends: 88 [2019-11-23 20:50:13,811 INFO L226 Difference]: Without dead ends: 52 [2019-11-23 20:50:13,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=290, Unknown=0, NotChecked=0, Total=462 [2019-11-23 20:50:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-23 20:50:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-11-23 20:50:13,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-23 20:50:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-11-23 20:50:13,821 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-11-23 20:50:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:13,822 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-11-23 20:50:13,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 20:50:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-11-23 20:50:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 20:50:13,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:13,823 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:14,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:14,033 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:14,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:14,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1296772193, now seen corresponding path program 11 times [2019-11-23 20:50:14,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:14,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680219791] [2019-11-23 20:50:14,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 7 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:14,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680219791] [2019-11-23 20:50:14,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000402507] [2019-11-23 20:50:14,454 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:14,543 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-23 20:50:14,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:14,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-23 20:50:14,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:14,578 INFO L343 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-11-23 20:50:14,578 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-11-23 20:50:14,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:14,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:14,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:14,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-11-23 20:50:14,660 INFO L343 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-11-23 20:50:14,660 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 54 treesize of output 48 [2019-11-23 20:50:14,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:14,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:14,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:14,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2019-11-23 20:50:14,783 INFO L343 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-11-23 20:50:14,783 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 68 treesize of output 65 [2019-11-23 20:50:14,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:14,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:14,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:14,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:57 [2019-11-23 20:50:14,987 INFO L343 Elim1Store]: treesize reduction 430, result has 10.0 percent of original size [2019-11-23 20:50:14,988 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 82 treesize of output 82 [2019-11-23 20:50:14,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:15,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:15,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:15,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:71 [2019-11-23 20:50:15,270 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 31 [2019-11-23 20:50:15,271 INFO L343 Elim1Store]: treesize reduction 596, result has 9.1 percent of original size [2019-11-23 20:50:15,271 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 96 treesize of output 99 [2019-11-23 20:50:15,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:15,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:15,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:15,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:99, output treesize:85 [2019-11-23 20:50:15,689 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 36 [2019-11-23 20:50:15,690 INFO L343 Elim1Store]: treesize reduction 780, result has 8.5 percent of original size [2019-11-23 20:50:15,690 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 110 treesize of output 116 [2019-11-23 20:50:15,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:15,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:15,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:15,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:99 [2019-11-23 20:50:15,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:15,954 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:15,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 124 treesize of output 133 [2019-11-23 20:50:15,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:15,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:15,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:15,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:130, output treesize:116 [2019-11-23 20:50:16,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 43 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:17,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:17,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 28] total 42 [2019-11-23 20:50:17,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634781105] [2019-11-23 20:50:17,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-23 20:50:17,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:17,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-23 20:50:17,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=1304, Unknown=0, NotChecked=0, Total=1722 [2019-11-23 20:50:17,393 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 42 states. [2019-11-23 20:50:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:19,116 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-23 20:50:19,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-23 20:50:19,116 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 50 [2019-11-23 20:50:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:19,117 INFO L225 Difference]: With dead ends: 60 [2019-11-23 20:50:19,117 INFO L226 Difference]: Without dead ends: 58 [2019-11-23 20:50:19,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 25 SyntacticMatches, 10 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=927, Invalid=2855, Unknown=0, NotChecked=0, Total=3782 [2019-11-23 20:50:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-23 20:50:19,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-11-23 20:50:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-23 20:50:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-11-23 20:50:19,130 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2019-11-23 20:50:19,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:19,130 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-11-23 20:50:19,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-23 20:50:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-11-23 20:50:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 20:50:19,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:19,131 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:19,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:19,341 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:19,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:19,342 INFO L82 PathProgramCache]: Analyzing trace with hash -407584683, now seen corresponding path program 12 times [2019-11-23 20:50:19,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:19,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912443239] [2019-11-23 20:50:19,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 99 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:19,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912443239] [2019-11-23 20:50:19,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639077190] [2019-11-23 20:50:19,445 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:19,525 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-11-23 20:50:19,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:19,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:50:19,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 128 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:19,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:19,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 23 [2019-11-23 20:50:19,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643216631] [2019-11-23 20:50:19,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 20:50:19,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:19,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 20:50:19,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=315, Unknown=0, NotChecked=0, Total=506 [2019-11-23 20:50:19,683 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 23 states. [2019-11-23 20:50:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:19,836 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2019-11-23 20:50:19,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 20:50:19,836 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2019-11-23 20:50:19,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:19,837 INFO L225 Difference]: With dead ends: 98 [2019-11-23 20:50:19,837 INFO L226 Difference]: Without dead ends: 58 [2019-11-23 20:50:19,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 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:19,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-23 20:50:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-11-23 20:50:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-23 20:50:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-11-23 20:50:19,862 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-11-23 20:50:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:19,862 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-11-23 20:50:19,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 20:50:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-11-23 20:50:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 20:50:19,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:19,864 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:20,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:20,071 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:20,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:20,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1792917517, now seen corresponding path program 13 times [2019-11-23 20:50:20,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:20,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117900564] [2019-11-23 20:50:20,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 8 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:20,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117900564] [2019-11-23 20:50:20,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055285759] [2019-11-23 20:50:20,583 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:20,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-23 20:50:20,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:20,644 INFO L343 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-11-23 20:50:20,644 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-11-23 20:50:20,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:20,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:20,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:20,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:26 [2019-11-23 20:50:20,725 INFO L343 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-11-23 20:50:20,726 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 54 treesize of output 48 [2019-11-23 20:50:20,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:20,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:20,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:20,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:40 [2019-11-23 20:50:20,847 INFO L343 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-11-23 20:50:20,848 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 68 treesize of output 65 [2019-11-23 20:50:20,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:20,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:20,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:20,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2019-11-23 20:50:21,008 INFO L343 Elim1Store]: treesize reduction 430, result has 10.0 percent of original size [2019-11-23 20:50:21,009 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 82 treesize of output 82 [2019-11-23 20:50:21,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:21,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:21,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:21,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:68 [2019-11-23 20:50:21,223 INFO L343 Elim1Store]: treesize reduction 596, result has 9.1 percent of original size [2019-11-23 20:50:21,224 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 96 treesize of output 99 [2019-11-23 20:50:21,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:21,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:21,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:21,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:96, output treesize:82 [2019-11-23 20:50:21,493 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 36 [2019-11-23 20:50:21,493 INFO L343 Elim1Store]: treesize reduction 780, result has 8.5 percent of original size [2019-11-23 20:50:21,494 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 110 treesize of output 116 [2019-11-23 20:50:21,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:21,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:21,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:21,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:110, output treesize:96 [2019-11-23 20:50:21,885 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 41 [2019-11-23 20:50:21,886 INFO L343 Elim1Store]: treesize reduction 982, result has 7.9 percent of original size [2019-11-23 20:50:21,887 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 124 treesize of output 133 [2019-11-23 20:50:21,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:21,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:21,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:21,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:124, output treesize:110 [2019-11-23 20:50:22,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:22,293 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 46 [2019-11-23 20:50:22,294 INFO L343 Elim1Store]: treesize reduction 1202, result has 7.4 percent of original size [2019-11-23 20:50:22,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 138 treesize of output 150 [2019-11-23 20:50:22,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:22,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:22,322 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,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:141, output treesize:127 [2019-11-23 20:50:22,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:23,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 57 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:24,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:24,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 30] total 45 [2019-11-23 20:50:24,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555227426] [2019-11-23 20:50:24,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-23 20:50:24,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:24,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-23 20:50:24,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=1501, Unknown=0, NotChecked=0, Total=1980 [2019-11-23 20:50:24,091 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 45 states. [2019-11-23 20:50:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:26,140 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-11-23 20:50:26,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-23 20:50:26,140 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 56 [2019-11-23 20:50:26,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:26,141 INFO L225 Difference]: With dead ends: 66 [2019-11-23 20:50:26,141 INFO L226 Difference]: Without dead ends: 64 [2019-11-23 20:50:26,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 29 SyntacticMatches, 12 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1030, Invalid=3260, Unknown=0, NotChecked=0, Total=4290 [2019-11-23 20:50:26,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-23 20:50:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-11-23 20:50:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-23 20:50:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-11-23 20:50:26,156 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 56 [2019-11-23 20:50:26,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:26,156 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-11-23 20:50:26,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-23 20:50:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-11-23 20:50:26,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-23 20:50:26,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:26,157 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:26,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:26,361 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:26,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:26,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1037311319, now seen corresponding path program 14 times [2019-11-23 20:50:26,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:26,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596026163] [2019-11-23 20:50:26,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:26,510 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 129 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:26,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596026163] [2019-11-23 20:50:26,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537822721] [2019-11-23 20:50:26,511 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:26,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:50:26,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:26,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:50:26,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 162 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:26,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:26,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 25 [2019-11-23 20:50:26,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854661697] [2019-11-23 20:50:26,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 20:50:26,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:26,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 20:50:26,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=374, Unknown=0, NotChecked=0, Total=600 [2019-11-23 20:50:26,717 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 25 states. [2019-11-23 20:50:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:26,875 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-11-23 20:50:26,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 20:50:26,877 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2019-11-23 20:50:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:26,877 INFO L225 Difference]: With dead ends: 108 [2019-11-23 20:50:26,877 INFO L226 Difference]: Without dead ends: 64 [2019-11-23 20:50:26,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 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:50:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-23 20:50:26,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-11-23 20:50:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-23 20:50:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-11-23 20:50:26,899 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-11-23 20:50:26,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:26,899 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-11-23 20:50:26,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 20:50:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-11-23 20:50:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 20:50:26,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:26,900 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:27,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:27,104 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:27,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:27,104 INFO L82 PathProgramCache]: Analyzing trace with hash -950619193, now seen corresponding path program 15 times [2019-11-23 20:50:27,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:27,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204632438] [2019-11-23 20:50:27,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 9 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:27,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204632438] [2019-11-23 20:50:27,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223992258] [2019-11-23 20:50:27,602 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:27,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-23 20:50:27,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:27,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 65 conjunts are in the unsatisfiable core [2019-11-23 20:50:27,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:27,758 INFO L343 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-11-23 20:50:27,759 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-11-23 20:50:27,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:27,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:27,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:27,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-11-23 20:50:27,853 INFO L343 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-11-23 20:50:27,854 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 54 treesize of output 48 [2019-11-23 20:50:27,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:27,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:27,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:27,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2019-11-23 20:50:27,978 INFO L343 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-11-23 20:50:27,978 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 68 treesize of output 65 [2019-11-23 20:50:27,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:27,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:27,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:27,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:57 [2019-11-23 20:50:28,146 INFO L343 Elim1Store]: treesize reduction 430, result has 10.0 percent of original size [2019-11-23 20:50:28,147 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 82 treesize of output 82 [2019-11-23 20:50:28,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:28,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:28,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:28,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:71 [2019-11-23 20:50:28,391 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 31 [2019-11-23 20:50:28,392 INFO L343 Elim1Store]: treesize reduction 596, result has 9.1 percent of original size [2019-11-23 20:50:28,393 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 96 treesize of output 99 [2019-11-23 20:50:28,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:28,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:28,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:28,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:99, output treesize:85 [2019-11-23 20:50:28,667 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 36 [2019-11-23 20:50:28,668 INFO L343 Elim1Store]: treesize reduction 780, result has 8.5 percent of original size [2019-11-23 20:50:28,668 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 110 treesize of output 116 [2019-11-23 20:50:28,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:28,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:28,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:28,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:99 [2019-11-23 20:50:29,020 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 41 [2019-11-23 20:50:29,021 INFO L343 Elim1Store]: treesize reduction 982, result has 7.9 percent of original size [2019-11-23 20:50:29,021 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 124 treesize of output 133 [2019-11-23 20:50:29,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:29,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:29,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:29,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:127, output treesize:113 [2019-11-23 20:50:29,474 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 46 [2019-11-23 20:50:29,474 INFO L343 Elim1Store]: treesize reduction 1202, result has 7.4 percent of original size [2019-11-23 20:50:29,475 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 138 treesize of output 150 [2019-11-23 20:50:29,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:29,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:29,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:29,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:141, output treesize:127 [2019-11-23 20:50:29,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:29,775 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:29,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 152 treesize of output 167 [2019-11-23 20:50:29,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:29,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:29,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:29,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:158, output treesize:144 [2019-11-23 20:50:30,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:31,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 73 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:31,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:31,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 34] total 50 [2019-11-23 20:50:31,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849665254] [2019-11-23 20:50:31,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-11-23 20:50:31,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:31,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-11-23 20:50:31,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=1867, Unknown=0, NotChecked=0, Total=2450 [2019-11-23 20:50:31,722 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 50 states. [2019-11-23 20:50:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:34,156 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-11-23 20:50:34,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-23 20:50:34,157 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 62 [2019-11-23 20:50:34,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:34,158 INFO L225 Difference]: With dead ends: 72 [2019-11-23 20:50:34,158 INFO L226 Difference]: Without dead ends: 70 [2019-11-23 20:50:34,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 31 SyntacticMatches, 14 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1238, Invalid=4018, Unknown=0, NotChecked=0, Total=5256 [2019-11-23 20:50:34,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-23 20:50:34,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-11-23 20:50:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-23 20:50:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-11-23 20:50:34,172 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2019-11-23 20:50:34,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:34,173 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-11-23 20:50:34,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-11-23 20:50:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-11-23 20:50:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 20:50:34,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:34,174 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:34,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:34,375 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:34,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:34,375 INFO L82 PathProgramCache]: Analyzing trace with hash 446319741, now seen corresponding path program 16 times [2019-11-23 20:50:34,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:34,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776360867] [2019-11-23 20:50:34,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 163 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:34,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776360867] [2019-11-23 20:50:34,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157278921] [2019-11-23 20:50:34,507 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:34,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:50:34,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:34,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 20:50:34,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 200 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:34,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:34,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24] total 27 [2019-11-23 20:50:34,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376284640] [2019-11-23 20:50:34,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 20:50:34,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:34,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 20:50:34,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=438, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:50:34,719 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 27 states. [2019-11-23 20:50:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:34,922 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2019-11-23 20:50:34,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-23 20:50:34,923 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2019-11-23 20:50:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:34,923 INFO L225 Difference]: With dead ends: 118 [2019-11-23 20:50:34,923 INFO L226 Difference]: Without dead ends: 70 [2019-11-23 20:50:34,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 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:50:34,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-23 20:50:34,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-11-23 20:50:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-23 20:50:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-11-23 20:50:34,936 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-11-23 20:50:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:34,936 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-11-23 20:50:34,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 20:50:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-11-23 20:50:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 20:50:34,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:34,937 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:35,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:35,139 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:35,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:35,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1100959515, now seen corresponding path program 17 times [2019-11-23 20:50:35,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:35,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841933860] [2019-11-23 20:50:35,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 10 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:35,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841933860] [2019-11-23 20:50:35,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747888822] [2019-11-23 20:50:35,698 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:35,983 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-11-23 20:50:35,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:35,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 69 conjunts are in the unsatisfiable core [2019-11-23 20:50:35,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:36,020 INFO L343 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-11-23 20:50:36,020 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-11-23 20:50:36,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:36,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:36,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:36,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-11-23 20:50:36,118 INFO L343 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-11-23 20:50:36,119 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 54 treesize of output 48 [2019-11-23 20:50:36,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:36,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:36,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:36,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2019-11-23 20:50:36,242 INFO L343 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-11-23 20:50:36,243 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 68 treesize of output 65 [2019-11-23 20:50:36,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:36,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:36,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:36,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:57 [2019-11-23 20:50:36,422 INFO L343 Elim1Store]: treesize reduction 430, result has 10.0 percent of original size [2019-11-23 20:50:36,422 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 82 treesize of output 82 [2019-11-23 20:50:36,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:36,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:36,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:36,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:71 [2019-11-23 20:50:36,654 INFO L343 Elim1Store]: treesize reduction 596, result has 9.1 percent of original size [2019-11-23 20:50:36,655 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 96 treesize of output 99 [2019-11-23 20:50:36,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:36,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:36,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:36,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:99, output treesize:85 [2019-11-23 20:50:36,957 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 36 [2019-11-23 20:50:36,958 INFO L343 Elim1Store]: treesize reduction 780, result has 8.5 percent of original size [2019-11-23 20:50:36,958 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 110 treesize of output 116 [2019-11-23 20:50:36,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:36,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:36,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:36,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:99 [2019-11-23 20:50:37,330 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 41 [2019-11-23 20:50:37,331 INFO L343 Elim1Store]: treesize reduction 982, result has 7.9 percent of original size [2019-11-23 20:50:37,331 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 124 treesize of output 133 [2019-11-23 20:50:37,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:37,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:37,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:37,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:127, output treesize:113 [2019-11-23 20:50:37,761 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 46 [2019-11-23 20:50:37,762 INFO L343 Elim1Store]: treesize reduction 1202, result has 7.4 percent of original size [2019-11-23 20:50:37,762 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 138 treesize of output 150 [2019-11-23 20:50:37,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:37,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:37,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:37,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:141, output treesize:127 [2019-11-23 20:50:38,342 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 51 [2019-11-23 20:50:38,343 INFO L343 Elim1Store]: treesize reduction 1440, result has 7.0 percent of original size [2019-11-23 20:50:38,343 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 152 treesize of output 167 [2019-11-23 20:50:38,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:38,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:38,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:38,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:155, output treesize:141 [2019-11-23 20:50:38,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:38,713 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:38,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 56 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 166 treesize of output 184 [2019-11-23 20:50:38,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:38,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:38,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:38,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:172, output treesize:158 [2019-11-23 20:50:40,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:40,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 91 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:41,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:41,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 37] total 54 [2019-11-23 20:50:41,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447041955] [2019-11-23 20:50:41,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-11-23 20:50:41,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:41,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-11-23 20:50:41,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=691, Invalid=2171, Unknown=0, NotChecked=0, Total=2862 [2019-11-23 20:50:41,130 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 54 states. [2019-11-23 20:50:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:44,391 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-11-23 20:50:44,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-23 20:50:44,392 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 68 [2019-11-23 20:50:44,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:44,392 INFO L225 Difference]: With dead ends: 78 [2019-11-23 20:50:44,392 INFO L226 Difference]: Without dead ends: 76 [2019-11-23 20:50:44,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 34 SyntacticMatches, 16 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1520, Invalid=4800, Unknown=0, NotChecked=0, Total=6320 [2019-11-23 20:50:44,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-23 20:50:44,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-11-23 20:50:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-23 20:50:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-11-23 20:50:44,406 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 68 [2019-11-23 20:50:44,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:44,406 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-11-23 20:50:44,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-11-23 20:50:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-11-23 20:50:44,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 20:50:44,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:44,407 INFO L410 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:44,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:44,608 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:44,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:44,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1111679535, now seen corresponding path program 18 times [2019-11-23 20:50:44,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:44,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144526667] [2019-11-23 20:50:44,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 201 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:44,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144526667] [2019-11-23 20:50:44,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726832126] [2019-11-23 20:50:44,776 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:45,080 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2019-11-23 20:50:45,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:45,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 20:50:45,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 242 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:45,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:45,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 29 [2019-11-23 20:50:45,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179283422] [2019-11-23 20:50:45,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 20:50:45,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:45,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 20:50:45,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=507, Unknown=0, NotChecked=0, Total=812 [2019-11-23 20:50:45,259 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 29 states. [2019-11-23 20:50:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:45,485 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2019-11-23 20:50:45,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-23 20:50:45,485 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 72 [2019-11-23 20:50:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:45,486 INFO L225 Difference]: With dead ends: 128 [2019-11-23 20:50:45,486 INFO L226 Difference]: Without dead ends: 76 [2019-11-23 20:50:45,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=322, Invalid=548, Unknown=0, NotChecked=0, Total=870 [2019-11-23 20:50:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-23 20:50:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-23 20:50:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-23 20:50:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-11-23 20:50:45,498 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-11-23 20:50:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:45,499 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-11-23 20:50:45,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 20:50:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-11-23 20:50:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-23 20:50:45,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:45,499 INFO L410 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:45,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:45,700 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:45,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:45,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1066480111, now seen corresponding path program 19 times [2019-11-23 20:50:45,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:45,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567265603] [2019-11-23 20:50:45,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 11 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:46,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567265603] [2019-11-23 20:50:46,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099804695] [2019-11-23 20:50:46,319 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:46,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 70 conjunts are in the unsatisfiable core [2019-11-23 20:50:46,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:46,399 INFO L343 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-11-23 20:50:46,400 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-11-23 20:50:46,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:46,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:46,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:46,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:26 [2019-11-23 20:50:46,484 INFO L343 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-11-23 20:50:46,484 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 54 treesize of output 48 [2019-11-23 20:50:46,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:46,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:46,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:46,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:40 [2019-11-23 20:50:46,605 INFO L343 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-11-23 20:50:46,605 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 68 treesize of output 65 [2019-11-23 20:50:46,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:46,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:46,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:46,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2019-11-23 20:50:46,767 INFO L343 Elim1Store]: treesize reduction 430, result has 10.0 percent of original size [2019-11-23 20:50:46,768 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 82 treesize of output 82 [2019-11-23 20:50:46,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:46,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:46,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:46,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:68 [2019-11-23 20:50:47,000 INFO L343 Elim1Store]: treesize reduction 596, result has 9.1 percent of original size [2019-11-23 20:50:47,001 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 96 treesize of output 99 [2019-11-23 20:50:47,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:47,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:47,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:47,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:96, output treesize:82 [2019-11-23 20:50:47,276 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 36 [2019-11-23 20:50:47,276 INFO L343 Elim1Store]: treesize reduction 780, result has 8.5 percent of original size [2019-11-23 20:50:47,277 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 110 treesize of output 116 [2019-11-23 20:50:47,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:47,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:47,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:47,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:110, output treesize:96 [2019-11-23 20:50:47,614 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 41 [2019-11-23 20:50:47,615 INFO L343 Elim1Store]: treesize reduction 982, result has 7.9 percent of original size [2019-11-23 20:50:47,615 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 124 treesize of output 133 [2019-11-23 20:50:47,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:47,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:47,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:47,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:124, output treesize:110 [2019-11-23 20:50:48,042 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 46 [2019-11-23 20:50:48,042 INFO L343 Elim1Store]: treesize reduction 1202, result has 7.4 percent of original size [2019-11-23 20:50:48,043 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 138 treesize of output 150 [2019-11-23 20:50:48,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:48,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:48,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:48,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:138, output treesize:124 [2019-11-23 20:50:48,581 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 51 [2019-11-23 20:50:48,582 INFO L343 Elim1Store]: treesize reduction 1440, result has 7.0 percent of original size [2019-11-23 20:50:48,582 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 152 treesize of output 167 [2019-11-23 20:50:48,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:48,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:48,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:48,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:152, output treesize:138 [2019-11-23 20:50:49,232 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 308 DAG size of output: 56 [2019-11-23 20:50:49,232 INFO L343 Elim1Store]: treesize reduction 1696, result has 6.6 percent of original size [2019-11-23 20:50:49,233 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 166 treesize of output 184 [2019-11-23 20:50:49,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:49,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:49,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:49,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:166, output treesize:152 [2019-11-23 20:50:49,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:50,012 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 360 DAG size of output: 61 [2019-11-23 20:50:50,012 INFO L343 Elim1Store]: treesize reduction 1970, result has 6.3 percent of original size [2019-11-23 20:50:50,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 66 case distinctions, treesize of input 180 treesize of output 201 [2019-11-23 20:50:50,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:50,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:50,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:50,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:183, output treesize:169 [2019-11-23 20:50:50,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:52,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 111 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:52,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:52,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 39] total 57 [2019-11-23 20:50:52,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864906400] [2019-11-23 20:50:52,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-11-23 20:50:52,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:52,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-11-23 20:50:52,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=753, Invalid=2439, Unknown=0, NotChecked=0, Total=3192 [2019-11-23 20:50:52,691 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 57 states. [2019-11-23 20:50:56,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:56,401 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-11-23 20:50:56,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-23 20:50:56,402 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 74 [2019-11-23 20:50:56,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:56,404 INFO L225 Difference]: With dead ends: 84 [2019-11-23 20:50:56,404 INFO L226 Difference]: Without dead ends: 82 [2019-11-23 20:50:56,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 38 SyntacticMatches, 18 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1623, Invalid=5349, Unknown=0, NotChecked=0, Total=6972 [2019-11-23 20:50:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-23 20:50:56,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-11-23 20:50:56,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-23 20:50:56,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-11-23 20:50:56,421 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2019-11-23 20:50:56,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:56,421 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-11-23 20:50:56,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-11-23 20:50:56,421 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-11-23 20:50:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 20:50:56,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:56,422 INFO L410 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:56,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:56,626 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:56,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:56,627 INFO L82 PathProgramCache]: Analyzing trace with hash -677808475, now seen corresponding path program 20 times [2019-11-23 20:50:56,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:56,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904467810] [2019-11-23 20:50:56,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 243 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:56,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904467810] [2019-11-23 20:50:56,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739602483] [2019-11-23 20:50:56,790 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:56,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:50:56,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:56,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-23 20:50:56,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 288 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:57,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:57,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 28] total 31 [2019-11-23 20:50:57,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905478693] [2019-11-23 20:50:57,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-23 20:50:57,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:57,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-23 20:50:57,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=581, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:50:57,046 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 31 states. [2019-11-23 20:50:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:57,267 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2019-11-23 20:50:57,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-23 20:50:57,267 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 78 [2019-11-23 20:50:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:57,268 INFO L225 Difference]: With dead ends: 138 [2019-11-23 20:50:57,268 INFO L226 Difference]: Without dead ends: 82 [2019-11-23 20:50:57,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=367, Invalid=625, Unknown=0, NotChecked=0, Total=992 [2019-11-23 20:50:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-23 20:50:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-11-23 20:50:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-23 20:50:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-11-23 20:50:57,285 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-11-23 20:50:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:57,285 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-11-23 20:50:57,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-23 20:50:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-11-23 20:50:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 20:50:57,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:57,286 INFO L410 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:57,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:57,490 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:57,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:57,490 INFO L82 PathProgramCache]: Analyzing trace with hash -636912573, now seen corresponding path program 21 times [2019-11-23 20:50:57,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:57,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668051067] [2019-11-23 20:50:57,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 12 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:58,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668051067] [2019-11-23 20:50:58,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329328352] [2019-11-23 20:50:58,359 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:58,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-11-23 20:50:58,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:58,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 69 conjunts are in the unsatisfiable core [2019-11-23 20:50:58,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:58,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-11-23 20:50:58,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:58,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:58,768 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,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:34 [2019-11-23 20:50:58,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,848 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:58,848 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 48 [2019-11-23 20:50:58,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:58,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:58,859 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,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:48 [2019-11-23 20:50:58,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:58,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:58,956 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 65 [2019-11-23 20:50:58,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:58,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:58,972 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,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:62 [2019-11-23 20:50:59,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,094 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:59,094 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 82 [2019-11-23 20:50:59,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:59,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:59,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:59,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:90, output treesize:76 [2019-11-23 20:50:59,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,255 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:59,255 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 96 treesize of output 99 [2019-11-23 20:50:59,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:59,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:59,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:59,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:90 [2019-11-23 20:50:59,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:59,859 WARN L192 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 96 [2019-11-23 20:50:59,860 INFO L343 Elim1Store]: treesize reduction 77, result has 87.8 percent of original size [2019-11-23 20:50:59,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 605 [2019-11-23 20:50:59,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:00,037 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 55 [2019-11-23 20:51:00,038 INFO L567 ElimStorePlain]: treesize reduction 480, result has 20.0 percent of original size [2019-11-23 20:51:00,039 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:00,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:120, output treesize:120 [2019-11-23 20:51:00,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:00,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,240 WARN L192 SmtUtils]: Spent 955.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 172 [2019-11-23 20:51:01,241 INFO L343 Elim1Store]: treesize reduction 102, result has 90.2 percent of original size [2019-11-23 20:51:01,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 18 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 132 treesize of output 1000 [2019-11-23 20:51:01,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:01,548 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 65 [2019-11-23 20:51:01,548 INFO L567 ElimStorePlain]: treesize reduction 876, result has 14.6 percent of original size [2019-11-23 20:51:01,549 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:01,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:150, output treesize:150 [2019-11-23 20:51:01,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:01,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:03,362 WARN L192 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 223 DAG size of output: 223 [2019-11-23 20:51:03,363 INFO L343 Elim1Store]: treesize reduction 102, result has 92.3 percent of original size [2019-11-23 20:51:03,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 20 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 53 case distinctions, treesize of input 160 treesize of output 1306 [2019-11-23 20:51:03,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:03,771 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 69 [2019-11-23 20:51:03,772 INFO L567 ElimStorePlain]: treesize reduction 1216, result has 11.9 percent of original size [2019-11-23 20:51:03,773 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:03,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:178, output treesize:164 [2019-11-23 20:51:04,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:04,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:06,063 WARN L192 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 257 DAG size of output: 257 [2019-11-23 20:51:06,065 INFO L343 Elim1Store]: treesize reduction 102, result has 93.0 percent of original size [2019-11-23 20:51:06,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 23 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 63 case distinctions, treesize of input 174 treesize of output 1465 [2019-11-23 20:51:06,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:06,542 WARN L192 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 73 [2019-11-23 20:51:06,543 INFO L567 ElimStorePlain]: treesize reduction 1386, result has 11.4 percent of original size [2019-11-23 20:51:06,544 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:06,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:192, output treesize:178 [2019-11-23 20:51:07,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:07,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:09,287 WARN L192 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 291 DAG size of output: 291 [2019-11-23 20:51:09,288 INFO L343 Elim1Store]: treesize reduction 102, result has 93.7 percent of original size [2019-11-23 20:51:09,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 27 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 74 case distinctions, treesize of input 188 treesize of output 1624 [2019-11-23 20:51:09,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:09,873 WARN L192 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 77 [2019-11-23 20:51:09,874 INFO L567 ElimStorePlain]: treesize reduction 1668, result has 10.3 percent of original size [2019-11-23 20:51:09,875 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:09,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:206, output treesize:192 [2019-11-23 20:51:10,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:10,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:12,918 WARN L192 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 325 DAG size of output: 325 [2019-11-23 20:51:12,919 INFO L343 Elim1Store]: treesize reduction 102, result has 94.2 percent of original size [2019-11-23 20:51:12,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 32 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 86 case distinctions, treesize of input 202 treesize of output 1783 [2019-11-23 20:51:12,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:13,507 WARN L192 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 345 DAG size of output: 81 [2019-11-23 20:51:13,508 INFO L567 ElimStorePlain]: treesize reduction 1726, result has 10.7 percent of original size [2019-11-23 20:51:13,509 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:13,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:220, output treesize:206 [2019-11-23 20:51:14,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:14,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:51:17,069 WARN L192 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 360 DAG size of output: 360 [2019-11-23 20:51:17,070 INFO L343 Elim1Store]: treesize reduction 102, result has 94.6 percent of original size [2019-11-23 20:51:17,071 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 38 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 99 case distinctions, treesize of input 216 treesize of output 1942 [2019-11-23 20:51:17,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:51:17,834 WARN L192 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 383 DAG size of output: 87 [2019-11-23 20:51:17,835 INFO L567 ElimStorePlain]: treesize reduction 2008, result has 10.0 percent of original size [2019-11-23 20:51:17,836 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:17,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:237, output treesize:223 [2019-11-23 20:51:19,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:51:22,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:51:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 190 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:22,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:51:22,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 43] total 62 [2019-11-23 20:51:22,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619405931] [2019-11-23 20:51:22,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-11-23 20:51:22,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:22,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-11-23 20:51:22,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=3347, Unknown=0, NotChecked=0, Total=3782 [2019-11-23 20:51:22,466 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 62 states. [2019-11-23 20:51:24,741 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2019-11-23 20:51:27,174 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 79