/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/pr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:48:04,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:48:04,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:48:04,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:48:04,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:48:04,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:48:04,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:48:04,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:48:04,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:48:04,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:48:04,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:48:04,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:48:04,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:48:04,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:48:04,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:48:04,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:48:04,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:48:04,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:48:04,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:48:04,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:48:04,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:48:04,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:48:04,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:48:04,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:48:04,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:48:04,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:48:04,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:48:04,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:48:04,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:48:04,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:48:04,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:48:04,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:48:04,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:48:04,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:48:04,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:48:04,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:48:04,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:48:04,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:48:04,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:48:04,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:48:04,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:48:04,681 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:48:04,694 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:48:04,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:48:04,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:48:04,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:48:04,696 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:48:04,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:48:04,696 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:48:04,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:48:04,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:48:04,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:48:04,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:48:04,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:48:04,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:48:04,698 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:48:04,698 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:48:04,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:48:04,698 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:48:04,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:48:04,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:48:04,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:48:04,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:48:04,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:48:04,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:48:04,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:48:04,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:48:04,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:48:04,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:48:04,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:48:04,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:48:04,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:48:04,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:48:05,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:48:05,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:48:05,006 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:48:05,007 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:48:05,008 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr2.c [2019-11-23 20:48:05,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd5d8a81/3ef97cfada954ceeb5900c16972ff2f1/FLAG47fb2e15b [2019-11-23 20:48:05,527 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:48:05,530 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr2.c [2019-11-23 20:48:05,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd5d8a81/3ef97cfada954ceeb5900c16972ff2f1/FLAG47fb2e15b [2019-11-23 20:48:05,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd5d8a81/3ef97cfada954ceeb5900c16972ff2f1 [2019-11-23 20:48:05,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:48:05,888 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:48:05,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:48:05,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:48:05,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:48:05,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:05" (1/1) ... [2019-11-23 20:48:05,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f46c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:05, skipping insertion in model container [2019-11-23 20:48:05,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:05" (1/1) ... [2019-11-23 20:48:05,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:48:05,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:48:06,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:48:06,103 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:48:06,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:48:06,142 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:48:06,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06 WrapperNode [2019-11-23 20:48:06,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:48:06,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:48:06,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:48:06,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:48:06,150 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:48:06" (1/1) ... [2019-11-23 20:48:06,238 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:48:06" (1/1) ... [2019-11-23 20:48:06,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:48:06,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:48:06,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:48:06,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:48:06,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2019-11-23 20:48:06,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2019-11-23 20:48:06,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2019-11-23 20:48:06,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2019-11-23 20:48:06,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2019-11-23 20:48:06,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2019-11-23 20:48:06,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2019-11-23 20:48:06,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:48:06,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:48:06,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:48:06,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:48:06,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (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:48:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:48:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:48:06,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:48:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:48:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 20:48:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 20:48:06,590 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:48:06,590 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-23 20:48:06,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:06 BoogieIcfgContainer [2019-11-23 20:48:06,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:48:06,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:48:06,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:48:06,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:48:06,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:48:05" (1/3) ... [2019-11-23 20:48:06,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533259ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:06, skipping insertion in model container [2019-11-23 20:48:06,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (2/3) ... [2019-11-23 20:48:06,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533259ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:06, skipping insertion in model container [2019-11-23 20:48:06,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:06" (3/3) ... [2019-11-23 20:48:06,601 INFO L109 eAbstractionObserver]: Analyzing ICFG pr2.c [2019-11-23 20:48:06,612 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:48:06,622 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:48:06,636 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:48:06,670 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:48:06,671 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:48:06,671 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:48:06,671 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:48:06,671 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:48:06,671 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:48:06,671 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:48:06,672 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:48:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-11-23 20:48:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 20:48:06,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:06,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:06,705 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:06,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:06,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1895320564, now seen corresponding path program 1 times [2019-11-23 20:48:06,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:06,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250043718] [2019-11-23 20:48:06,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:06,917 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:48:06,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250043718] [2019-11-23 20:48:06,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:06,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:48:06,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633790462] [2019-11-23 20:48:06,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:48:06,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:06,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:48:06,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:06,938 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 4 states. [2019-11-23 20:48:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:07,045 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2019-11-23 20:48:07,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:48:07,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 20:48:07,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:07,058 INFO L225 Difference]: With dead ends: 44 [2019-11-23 20:48:07,058 INFO L226 Difference]: Without dead ends: 21 [2019-11-23 20:48:07,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-23 20:48:07,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-11-23 20:48:07,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-23 20:48:07,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-11-23 20:48:07,098 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2019-11-23 20:48:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:07,099 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-11-23 20:48:07,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:48:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-11-23 20:48:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 20:48:07,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:07,102 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:07,102 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:07,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:07,103 INFO L82 PathProgramCache]: Analyzing trace with hash -520757971, now seen corresponding path program 1 times [2019-11-23 20:48:07,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:07,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525443076] [2019-11-23 20:48:07,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:07,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525443076] [2019-11-23 20:48:07,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417957287] [2019-11-23 20:48:07,565 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:48:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:07,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-23 20:48:07,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:07,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:07,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:07,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:07,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:07,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:07,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:07,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-23 20:48:07,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:07,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:07,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:07,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-11-23 20:48:07,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:07,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:07,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-23 20:48:07,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392940524] [2019-11-23 20:48:07,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:48:07,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:07,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:48:07,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:48:07,918 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 15 states. [2019-11-23 20:48:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:08,522 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2019-11-23 20:48:08,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 20:48:08,522 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-11-23 20:48:08,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:08,532 INFO L225 Difference]: With dead ends: 113 [2019-11-23 20:48:08,533 INFO L226 Difference]: Without dead ends: 105 [2019-11-23 20:48:08,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=652, Unknown=0, NotChecked=0, Total=870 [2019-11-23 20:48:08,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-23 20:48:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 25. [2019-11-23 20:48:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-23 20:48:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-11-23 20:48:08,558 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 15 [2019-11-23 20:48:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:08,558 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-23 20:48:08,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:48:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2019-11-23 20:48:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 20:48:08,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:08,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:08,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:08,767 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:08,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:08,768 INFO L82 PathProgramCache]: Analyzing trace with hash -520817553, now seen corresponding path program 1 times [2019-11-23 20:48:08,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:08,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431697491] [2019-11-23 20:48:08,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:48:08,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431697491] [2019-11-23 20:48:08,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:08,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:48:08,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273642219] [2019-11-23 20:48:08,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:48:08,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:08,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:48:08,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:08,843 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 4 states. [2019-11-23 20:48:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:08,870 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-11-23 20:48:08,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:48:08,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-23 20:48:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:08,871 INFO L225 Difference]: With dead ends: 34 [2019-11-23 20:48:08,871 INFO L226 Difference]: Without dead ends: 32 [2019-11-23 20:48:08,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:48:08,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-23 20:48:08,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2019-11-23 20:48:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-23 20:48:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-11-23 20:48:08,880 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 15 [2019-11-23 20:48:08,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:08,880 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-23 20:48:08,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:48:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2019-11-23 20:48:08,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 20:48:08,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:08,883 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:08,884 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:08,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:08,884 INFO L82 PathProgramCache]: Analyzing trace with hash -913784981, now seen corresponding path program 1 times [2019-11-23 20:48:08,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:08,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359551087] [2019-11-23 20:48:08,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:08,942 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:48:08,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359551087] [2019-11-23 20:48:08,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:08,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:48:08,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36482212] [2019-11-23 20:48:08,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:48:08,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:08,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:48:08,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:08,944 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 4 states. [2019-11-23 20:48:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:08,981 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2019-11-23 20:48:08,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:48:08,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-23 20:48:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:08,982 INFO L225 Difference]: With dead ends: 52 [2019-11-23 20:48:08,982 INFO L226 Difference]: Without dead ends: 37 [2019-11-23 20:48:08,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:48:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-23 20:48:08,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-11-23 20:48:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-23 20:48:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-23 20:48:08,989 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 15 [2019-11-23 20:48:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:08,989 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-23 20:48:08,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:48:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-11-23 20:48:08,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 20:48:08,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:08,990 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:08,991 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:08,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:08,991 INFO L82 PathProgramCache]: Analyzing trace with hash -233726611, now seen corresponding path program 1 times [2019-11-23 20:48:08,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:08,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946963206] [2019-11-23 20:48:08,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:09,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946963206] [2019-11-23 20:48:09,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474296327] [2019-11-23 20:48:09,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:09,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-23 20:48:09,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:09,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:09,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:09,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:09,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:09,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:48:09,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-23 20:48:09,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:09,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:09,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:09,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2019-11-23 20:48:09,313 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:09,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:09,318 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:09,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:09,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:09,324 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:20 [2019-11-23 20:48:09,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:09,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:09,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-11-23 20:48:09,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597624100] [2019-11-23 20:48:09,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 20:48:09,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:09,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 20:48:09,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:48:09,379 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 12 states. [2019-11-23 20:48:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:09,817 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2019-11-23 20:48:09,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 20:48:09,817 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-11-23 20:48:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:09,819 INFO L225 Difference]: With dead ends: 81 [2019-11-23 20:48:09,819 INFO L226 Difference]: Without dead ends: 79 [2019-11-23 20:48:09,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:48:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-23 20:48:09,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 41. [2019-11-23 20:48:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-23 20:48:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2019-11-23 20:48:09,839 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 15 [2019-11-23 20:48:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:09,843 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2019-11-23 20:48:09,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 20:48:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2019-11-23 20:48:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 20:48:09,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:09,844 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:10,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:10,058 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:10,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:10,058 INFO L82 PathProgramCache]: Analyzing trace with hash 436333094, now seen corresponding path program 1 times [2019-11-23 20:48:10,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:10,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280070502] [2019-11-23 20:48:10,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:10,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280070502] [2019-11-23 20:48:10,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:10,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:10,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862933876] [2019-11-23 20:48:10,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:10,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:10,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:10,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:10,104 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 3 states. [2019-11-23 20:48:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:10,138 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2019-11-23 20:48:10,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:10,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 20:48:10,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:10,140 INFO L225 Difference]: With dead ends: 66 [2019-11-23 20:48:10,141 INFO L226 Difference]: Without dead ends: 51 [2019-11-23 20:48:10,141 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:48:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-23 20:48:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2019-11-23 20:48:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-23 20:48:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2019-11-23 20:48:10,152 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 19 [2019-11-23 20:48:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:10,152 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-11-23 20:48:10,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2019-11-23 20:48:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 20:48:10,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:10,154 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:10,154 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:10,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:10,154 INFO L82 PathProgramCache]: Analyzing trace with hash -768563160, now seen corresponding path program 1 times [2019-11-23 20:48:10,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:10,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108815235] [2019-11-23 20:48:10,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:10,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108815235] [2019-11-23 20:48:10,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:10,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:10,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520576922] [2019-11-23 20:48:10,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:10,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:10,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:10,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:10,219 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 3 states. [2019-11-23 20:48:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:10,238 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2019-11-23 20:48:10,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:10,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 20:48:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:10,240 INFO L225 Difference]: With dead ends: 61 [2019-11-23 20:48:10,240 INFO L226 Difference]: Without dead ends: 46 [2019-11-23 20:48:10,240 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:48:10,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-23 20:48:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2019-11-23 20:48:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-23 20:48:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-11-23 20:48:10,246 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 19 [2019-11-23 20:48:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:10,246 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-11-23 20:48:10,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-11-23 20:48:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 20:48:10,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:10,247 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:10,247 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:10,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:10,248 INFO L82 PathProgramCache]: Analyzing trace with hash 912763680, now seen corresponding path program 1 times [2019-11-23 20:48:10,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:10,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869279021] [2019-11-23 20:48:10,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:10,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869279021] [2019-11-23 20:48:10,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979328908] [2019-11-23 20:48:10,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:48:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:10,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-23 20:48:10,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:10,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:48:10,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:10,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:10,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:10,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:48:10,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:10,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:10,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-11-23 20:48:10,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017434680] [2019-11-23 20:48:10,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 20:48:10,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:10,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 20:48:10,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:48:10,521 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 14 states. [2019-11-23 20:48:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:10,921 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2019-11-23 20:48:10,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 20:48:10,921 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-11-23 20:48:10,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:10,922 INFO L225 Difference]: With dead ends: 92 [2019-11-23 20:48:10,922 INFO L226 Difference]: Without dead ends: 75 [2019-11-23 20:48:10,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2019-11-23 20:48:10,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-23 20:48:10,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 48. [2019-11-23 20:48:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-23 20:48:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2019-11-23 20:48:10,930 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 21 [2019-11-23 20:48:10,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:10,930 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2019-11-23 20:48:10,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 20:48:10,931 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2019-11-23 20:48:10,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 20:48:10,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:10,932 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:11,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:11,135 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:11,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:11,136 INFO L82 PathProgramCache]: Analyzing trace with hash -367099998, now seen corresponding path program 1 times [2019-11-23 20:48:11,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:11,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959886727] [2019-11-23 20:48:11,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:11,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959886727] [2019-11-23 20:48:11,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566508687] [2019-11-23 20:48:11,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:48:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:11,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:48:11,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:11,327 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:48:11,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:11,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:11,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:11,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-23 20:48:11,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:11,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:11,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-23 20:48:11,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256192105] [2019-11-23 20:48:11,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:48:11,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:11,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:48:11,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:48:11,393 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 15 states. [2019-11-23 20:48:11,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:11,786 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2019-11-23 20:48:11,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 20:48:11,786 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-11-23 20:48:11,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:11,788 INFO L225 Difference]: With dead ends: 105 [2019-11-23 20:48:11,788 INFO L226 Difference]: Without dead ends: 103 [2019-11-23 20:48:11,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2019-11-23 20:48:11,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-23 20:48:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 55. [2019-11-23 20:48:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-23 20:48:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-11-23 20:48:11,797 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 21 [2019-11-23 20:48:11,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:11,798 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-11-23 20:48:11,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:48:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-11-23 20:48:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 20:48:11,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:11,799 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:12,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:12,012 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:12,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:12,013 INFO L82 PathProgramCache]: Analyzing trace with hash -643527525, now seen corresponding path program 1 times [2019-11-23 20:48:12,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:12,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247181759] [2019-11-23 20:48:12,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 20:48:12,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247181759] [2019-11-23 20:48:12,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:12,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:12,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016709684] [2019-11-23 20:48:12,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:12,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:12,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:12,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:12,041 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 3 states. [2019-11-23 20:48:12,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:12,068 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2019-11-23 20:48:12,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:12,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 20:48:12,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:12,069 INFO L225 Difference]: With dead ends: 78 [2019-11-23 20:48:12,069 INFO L226 Difference]: Without dead ends: 61 [2019-11-23 20:48:12,070 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:48:12,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-23 20:48:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2019-11-23 20:48:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-23 20:48:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2019-11-23 20:48:12,077 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 25 [2019-11-23 20:48:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:12,077 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2019-11-23 20:48:12,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2019-11-23 20:48:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 20:48:12,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:12,078 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:12,078 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:12,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:12,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2028603693, now seen corresponding path program 2 times [2019-11-23 20:48:12,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:12,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070876852] [2019-11-23 20:48:12,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:12,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070876852] [2019-11-23 20:48:12,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854970087] [2019-11-23 20:48:12,369 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 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:48:12,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:48:12,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:12,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 20:48:12,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:12,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:12,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:48:12,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:48:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:12,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:12,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-23 20:48:12,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970505633] [2019-11-23 20:48:12,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:48:12,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:12,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:48:12,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:48:12,570 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 15 states. [2019-11-23 20:48:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:12,757 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2019-11-23 20:48:12,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 20:48:12,758 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-11-23 20:48:12,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:12,758 INFO L225 Difference]: With dead ends: 102 [2019-11-23 20:48:12,759 INFO L226 Difference]: Without dead ends: 66 [2019-11-23 20:48:12,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:48:12,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-23 20:48:12,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2019-11-23 20:48:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-23 20:48:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2019-11-23 20:48:12,775 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 27 [2019-11-23 20:48:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:12,775 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2019-11-23 20:48:12,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:48:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2019-11-23 20:48:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 20:48:12,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:12,777 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:12,991 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:12,991 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:12,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:12,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1985743348, now seen corresponding path program 3 times [2019-11-23 20:48:12,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:12,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026607042] [2019-11-23 20:48:12,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:13,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026607042] [2019-11-23 20:48:13,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42097190] [2019-11-23 20:48:13,144 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 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:48:13,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 20:48:13,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:13,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-23 20:48:13,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:13,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:13,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:13,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:13,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:13,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:48:13,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:13,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:48:13,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:13,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:13,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:13,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2019-11-23 20:48:13,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:13,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:13,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-11-23 20:48:13,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987391406] [2019-11-23 20:48:13,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 20:48:13,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:13,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 20:48:13,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:48:13,509 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 21 states. [2019-11-23 20:48:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:14,533 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2019-11-23 20:48:14,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 20:48:14,534 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-11-23 20:48:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:14,535 INFO L225 Difference]: With dead ends: 103 [2019-11-23 20:48:14,536 INFO L226 Difference]: Without dead ends: 93 [2019-11-23 20:48:14,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=239, Invalid=1093, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 20:48:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-23 20:48:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2019-11-23 20:48:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-23 20:48:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-11-23 20:48:14,545 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 31 [2019-11-23 20:48:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:14,545 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-11-23 20:48:14,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 20:48:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-11-23 20:48:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 20:48:14,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:14,547 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:14,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:14,750 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:14,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:14,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1815519922, now seen corresponding path program 2 times [2019-11-23 20:48:14,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:14,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518305615] [2019-11-23 20:48:14,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:14,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518305615] [2019-11-23 20:48:14,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477417071] [2019-11-23 20:48:14,892 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 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:48:14,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:48:14,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:14,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-23 20:48:14,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:15,039 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:15,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:15,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:15,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:15,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:15,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:15,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:48:15,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:15,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:15,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:15,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:48:15,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:15,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:15,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-11-23 20:48:15,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378286291] [2019-11-23 20:48:15,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 20:48:15,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:15,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 20:48:15,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-11-23 20:48:15,204 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 20 states. [2019-11-23 20:48:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:15,920 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2019-11-23 20:48:15,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-23 20:48:15,921 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-11-23 20:48:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:15,921 INFO L225 Difference]: With dead ends: 135 [2019-11-23 20:48:15,921 INFO L226 Difference]: Without dead ends: 125 [2019-11-23 20:48:15,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=1082, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 20:48:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-23 20:48:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 69. [2019-11-23 20:48:15,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-23 20:48:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2019-11-23 20:48:15,930 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 31 [2019-11-23 20:48:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:15,931 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2019-11-23 20:48:15,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 20:48:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2019-11-23 20:48:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 20:48:15,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:15,932 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:16,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:16,133 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:16,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:16,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1739273352, now seen corresponding path program 1 times [2019-11-23 20:48:16,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:16,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61401995] [2019-11-23 20:48:16,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:16,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61401995] [2019-11-23 20:48:16,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333550909] [2019-11-23 20:48:16,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:16,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-23 20:48:16,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:16,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:16,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:16,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:16,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:16,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:48:16,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:16,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:48:16,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:16,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:16,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:16,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:48:16,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:16,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:16,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-11-23 20:48:16,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441120314] [2019-11-23 20:48:16,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 20:48:16,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:16,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 20:48:16,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-11-23 20:48:16,531 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand 20 states. [2019-11-23 20:48:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:17,412 INFO L93 Difference]: Finished difference Result 152 states and 171 transitions. [2019-11-23 20:48:17,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-23 20:48:17,412 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-11-23 20:48:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:17,414 INFO L225 Difference]: With dead ends: 152 [2019-11-23 20:48:17,414 INFO L226 Difference]: Without dead ends: 150 [2019-11-23 20:48:17,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=431, Invalid=1731, Unknown=0, NotChecked=0, Total=2162 [2019-11-23 20:48:17,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-23 20:48:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 81. [2019-11-23 20:48:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-23 20:48:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2019-11-23 20:48:17,423 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 31 [2019-11-23 20:48:17,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:17,423 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2019-11-23 20:48:17,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 20:48:17,423 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2019-11-23 20:48:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 20:48:17,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:17,424 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:17,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:17,628 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:17,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:17,628 INFO L82 PathProgramCache]: Analyzing trace with hash -827236161, now seen corresponding path program 4 times [2019-11-23 20:48:17,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:17,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756405128] [2019-11-23 20:48:17,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:17,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756405128] [2019-11-23 20:48:17,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932189342] [2019-11-23 20:48:17,811 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 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:48:17,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:48:17,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:17,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:48:17,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:17,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:48:17,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:17,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:17,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:17,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:48:18,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:18,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:18,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-11-23 20:48:18,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295354569] [2019-11-23 20:48:18,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 20:48:18,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:18,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 20:48:18,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2019-11-23 20:48:18,062 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand 22 states. [2019-11-23 20:48:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:19,029 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2019-11-23 20:48:19,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 20:48:19,031 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-11-23 20:48:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:19,032 INFO L225 Difference]: With dead ends: 144 [2019-11-23 20:48:19,032 INFO L226 Difference]: Without dead ends: 134 [2019-11-23 20:48:19,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=251, Invalid=1231, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 20:48:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-23 20:48:19,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 87. [2019-11-23 20:48:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-23 20:48:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-11-23 20:48:19,040 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 37 [2019-11-23 20:48:19,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:19,041 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-11-23 20:48:19,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 20:48:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-11-23 20:48:19,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 20:48:19,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:19,042 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:19,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:19,245 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:19,246 INFO L82 PathProgramCache]: Analyzing trace with hash 776523393, now seen corresponding path program 3 times [2019-11-23 20:48:19,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:19,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731777373] [2019-11-23 20:48:19,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:19,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731777373] [2019-11-23 20:48:19,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134956212] [2019-11-23 20:48:19,386 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:19,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 20:48:19,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:19,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-23 20:48:19,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:19,448 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:19,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:19,455 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:48:19,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-11-23 20:48:19,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:19,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:19,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2019-11-23 20:48:19,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612909906] [2019-11-23 20:48:19,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:48:19,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:19,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:48:19,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:48:19,552 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 15 states. [2019-11-23 20:48:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:20,561 INFO L93 Difference]: Finished difference Result 191 states and 214 transitions. [2019-11-23 20:48:20,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-23 20:48:20,561 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2019-11-23 20:48:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:20,563 INFO L225 Difference]: With dead ends: 191 [2019-11-23 20:48:20,563 INFO L226 Difference]: Without dead ends: 189 [2019-11-23 20:48:20,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=326, Invalid=1744, Unknown=0, NotChecked=0, Total=2070 [2019-11-23 20:48:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-23 20:48:20,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 93. [2019-11-23 20:48:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-23 20:48:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2019-11-23 20:48:20,572 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 37 [2019-11-23 20:48:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:20,573 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2019-11-23 20:48:20,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:48:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2019-11-23 20:48:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-23 20:48:20,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:20,574 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:20,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:20,777 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:20,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:20,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1484605134, now seen corresponding path program 5 times [2019-11-23 20:48:20,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:20,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540177381] [2019-11-23 20:48:20,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 33 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:21,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540177381] [2019-11-23 20:48:21,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639087780] [2019-11-23 20:48:21,162 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:48:21,199 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-23 20:48:21,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:21,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-23 20:48:21,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:21,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:21,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:48:21,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:48:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:21,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:21,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-11-23 20:48:21,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329128479] [2019-11-23 20:48:21,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 20:48:21,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:21,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 20:48:21,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:48:21,436 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 21 states. [2019-11-23 20:48:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:21,764 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2019-11-23 20:48:21,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 20:48:21,765 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2019-11-23 20:48:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:21,766 INFO L225 Difference]: With dead ends: 186 [2019-11-23 20:48:21,766 INFO L226 Difference]: Without dead ends: 114 [2019-11-23 20:48:21,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:48:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-23 20:48:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2019-11-23 20:48:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-23 20:48:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2019-11-23 20:48:21,774 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 43 [2019-11-23 20:48:21,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:21,774 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2019-11-23 20:48:21,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 20:48:21,774 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2019-11-23 20:48:21,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-23 20:48:21,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:21,775 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:21,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:21,976 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:21,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:21,976 INFO L82 PathProgramCache]: Analyzing trace with hash 436545131, now seen corresponding path program 6 times [2019-11-23 20:48:21,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:21,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400873665] [2019-11-23 20:48:21,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 8 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:22,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400873665] [2019-11-23 20:48:22,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999532005] [2019-11-23 20:48:22,228 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:48:22,312 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-23 20:48:22,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:22,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-23 20:48:22,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:22,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:22,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:22,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:22,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:22,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:22,556 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:48:22,557 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:48:22,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:22,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:22,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:22,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2019-11-23 20:48:22,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 8 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:22,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:22,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2019-11-23 20:48:22,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431607690] [2019-11-23 20:48:22,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 20:48:22,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:22,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 20:48:22,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:48:22,831 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand 27 states. [2019-11-23 20:48:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:24,344 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2019-11-23 20:48:24,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-23 20:48:24,345 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2019-11-23 20:48:24,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:24,346 INFO L225 Difference]: With dead ends: 169 [2019-11-23 20:48:24,346 INFO L226 Difference]: Without dead ends: 159 [2019-11-23 20:48:24,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=327, Invalid=2123, Unknown=0, NotChecked=0, Total=2450 [2019-11-23 20:48:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-23 20:48:24,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 111. [2019-11-23 20:48:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-23 20:48:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2019-11-23 20:48:24,360 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 47 [2019-11-23 20:48:24,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:24,360 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2019-11-23 20:48:24,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 20:48:24,360 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2019-11-23 20:48:24,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-23 20:48:24,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:24,361 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:24,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:24,562 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:24,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:24,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1273164525, now seen corresponding path program 4 times [2019-11-23 20:48:24,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:24,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131702727] [2019-11-23 20:48:24,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 8 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:24,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131702727] [2019-11-23 20:48:24,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978031448] [2019-11-23 20:48:24,787 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 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:48:24,855 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:48:24,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:24,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-23 20:48:24,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:24,978 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:24,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:24,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:24,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:24,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:25,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:25,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:48:25,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:25,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:25,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:25,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:48:25,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 8 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:25,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:25,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2019-11-23 20:48:25,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218405434] [2019-11-23 20:48:25,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 20:48:25,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:25,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 20:48:25,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:48:25,237 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 26 states. [2019-11-23 20:48:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:26,639 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2019-11-23 20:48:26,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-23 20:48:26,639 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2019-11-23 20:48:26,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:26,640 INFO L225 Difference]: With dead ends: 206 [2019-11-23 20:48:26,640 INFO L226 Difference]: Without dead ends: 196 [2019-11-23 20:48:26,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=407, Invalid=2673, Unknown=0, NotChecked=0, Total=3080 [2019-11-23 20:48:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-23 20:48:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 117. [2019-11-23 20:48:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-23 20:48:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2019-11-23 20:48:26,650 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 47 [2019-11-23 20:48:26,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:26,650 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2019-11-23 20:48:26,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 20:48:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2019-11-23 20:48:26,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-23 20:48:26,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:26,650 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:26,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:26,851 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:26,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:26,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1012394275, now seen corresponding path program 2 times [2019-11-23 20:48:26,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:26,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208627093] [2019-11-23 20:48:26,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:27,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208627093] [2019-11-23 20:48:27,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687429993] [2019-11-23 20:48:27,008 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:48:27,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:48:27,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:27,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 20:48:27,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:27,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:27,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:27,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:27,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:27,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:48:27,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:27,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:48:27,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:27,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:27,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:27,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:48:27,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:27,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:27,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2019-11-23 20:48:27,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390537365] [2019-11-23 20:48:27,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 20:48:27,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:27,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 20:48:27,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:48:27,361 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand 26 states. [2019-11-23 20:48:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:28,947 INFO L93 Difference]: Finished difference Result 238 states and 265 transitions. [2019-11-23 20:48:28,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-11-23 20:48:28,947 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2019-11-23 20:48:28,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:28,950 INFO L225 Difference]: With dead ends: 238 [2019-11-23 20:48:28,950 INFO L226 Difference]: Without dead ends: 236 [2019-11-23 20:48:28,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=707, Invalid=4263, Unknown=0, NotChecked=0, Total=4970 [2019-11-23 20:48:28,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-11-23 20:48:28,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 129. [2019-11-23 20:48:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-23 20:48:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 143 transitions. [2019-11-23 20:48:28,962 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 143 transitions. Word has length 47 [2019-11-23 20:48:28,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:28,963 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 143 transitions. [2019-11-23 20:48:28,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 20:48:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2019-11-23 20:48:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 20:48:28,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:28,964 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:29,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:29,167 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:29,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:29,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1629581858, now seen corresponding path program 7 times [2019-11-23 20:48:29,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:29,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149267335] [2019-11-23 20:48:29,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 10 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:29,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149267335] [2019-11-23 20:48:29,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973845193] [2019-11-23 20:48:29,386 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 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:48:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:29,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 20:48:29,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:29,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:48:29,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:29,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:48:29,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 10 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:29,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:29,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2019-11-23 20:48:29,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974236685] [2019-11-23 20:48:29,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-23 20:48:29,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:29,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-23 20:48:29,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2019-11-23 20:48:29,740 INFO L87 Difference]: Start difference. First operand 129 states and 143 transitions. Second operand 28 states. [2019-11-23 20:48:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:31,457 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2019-11-23 20:48:31,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-23 20:48:31,457 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-11-23 20:48:31,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:31,459 INFO L225 Difference]: With dead ends: 206 [2019-11-23 20:48:31,459 INFO L226 Difference]: Without dead ends: 196 [2019-11-23 20:48:31,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=380, Invalid=2482, Unknown=0, NotChecked=0, Total=2862 [2019-11-23 20:48:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-23 20:48:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 135. [2019-11-23 20:48:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-23 20:48:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2019-11-23 20:48:31,472 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 53 [2019-11-23 20:48:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:31,472 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2019-11-23 20:48:31,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-23 20:48:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2019-11-23 20:48:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 20:48:31,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:31,473 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:31,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:31,676 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:31,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:31,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1961004832, now seen corresponding path program 5 times [2019-11-23 20:48:31,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:31,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196617853] [2019-11-23 20:48:31,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:31,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196617853] [2019-11-23 20:48:31,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159858899] [2019-11-23 20:48:31,840 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:48:31,906 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-23 20:48:31,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:31,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 20:48:31,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:31,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:48:31,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:31,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:31,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:31,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-23 20:48:32,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:32,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:32,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2019-11-23 20:48:32,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191594579] [2019-11-23 20:48:32,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 20:48:32,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:32,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 20:48:32,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:48:32,192 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand 27 states. [2019-11-23 20:48:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:35,245 INFO L93 Difference]: Finished difference Result 343 states and 384 transitions. [2019-11-23 20:48:35,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-11-23 20:48:35,246 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2019-11-23 20:48:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:35,248 INFO L225 Difference]: With dead ends: 343 [2019-11-23 20:48:35,249 INFO L226 Difference]: Without dead ends: 341 [2019-11-23 20:48:35,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3898 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1258, Invalid=9872, Unknown=0, NotChecked=0, Total=11130 [2019-11-23 20:48:35,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-23 20:48:35,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 141. [2019-11-23 20:48:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-23 20:48:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2019-11-23 20:48:35,264 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 53 [2019-11-23 20:48:35,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:35,264 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2019-11-23 20:48:35,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 20:48:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2019-11-23 20:48:35,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-23 20:48:35,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:35,265 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:35,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:35,468 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:35,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:35,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1036299503, now seen corresponding path program 8 times [2019-11-23 20:48:35,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:35,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994919568] [2019-11-23 20:48:35,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 83 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:35,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994919568] [2019-11-23 20:48:35,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364821265] [2019-11-23 20:48:35,990 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 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:48:36,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:48:36,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:36,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-23 20:48:36,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:36,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:36,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:48:36,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:48:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 114 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:36,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:36,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2019-11-23 20:48:36,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260123798] [2019-11-23 20:48:36,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 20:48:36,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:36,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 20:48:36,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:48:36,397 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand 27 states. [2019-11-23 20:48:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:36,808 INFO L93 Difference]: Finished difference Result 270 states and 296 transitions. [2019-11-23 20:48:36,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 20:48:36,809 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2019-11-23 20:48:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:36,810 INFO L225 Difference]: With dead ends: 270 [2019-11-23 20:48:36,810 INFO L226 Difference]: Without dead ends: 162 [2019-11-23 20:48:36,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 20:48:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-23 20:48:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2019-11-23 20:48:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-23 20:48:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2019-11-23 20:48:36,821 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 59 [2019-11-23 20:48:36,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:36,821 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2019-11-23 20:48:36,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 20:48:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2019-11-23 20:48:36,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 20:48:36,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:36,822 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:37,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:37,025 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:37,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:37,026 INFO L82 PathProgramCache]: Analyzing trace with hash 974532170, now seen corresponding path program 9 times [2019-11-23 20:48:37,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:37,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163724177] [2019-11-23 20:48:37,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 12 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:37,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163724177] [2019-11-23 20:48:37,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839284223] [2019-11-23 20:48:37,324 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 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:48:37,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-23 20:48:37,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:37,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 20:48:37,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:37,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:37,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:37,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:37,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:37,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:37,516 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:48:37,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:48:37,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:37,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:37,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:37,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:48:37,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 12 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:37,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:37,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 32 [2019-11-23 20:48:37,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645690451] [2019-11-23 20:48:37,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-23 20:48:37,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:37,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-23 20:48:37,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2019-11-23 20:48:37,847 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand 32 states. [2019-11-23 20:48:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:40,485 INFO L93 Difference]: Finished difference Result 236 states and 257 transitions. [2019-11-23 20:48:40,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-23 20:48:40,485 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 63 [2019-11-23 20:48:40,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:40,486 INFO L225 Difference]: With dead ends: 236 [2019-11-23 20:48:40,487 INFO L226 Difference]: Without dead ends: 226 [2019-11-23 20:48:40,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=418, Invalid=3614, Unknown=0, NotChecked=0, Total=4032 [2019-11-23 20:48:40,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-23 20:48:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 159. [2019-11-23 20:48:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-23 20:48:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 173 transitions. [2019-11-23 20:48:40,502 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 173 transitions. Word has length 63 [2019-11-23 20:48:40,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:40,503 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 173 transitions. [2019-11-23 20:48:40,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-23 20:48:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2019-11-23 20:48:40,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 20:48:40,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:40,504 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:40,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:40,708 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:40,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:40,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1139162124, now seen corresponding path program 6 times [2019-11-23 20:48:40,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:40,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111499629] [2019-11-23 20:48:40,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 12 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:40,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111499629] [2019-11-23 20:48:40,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283674927] [2019-11-23 20:48:40,958 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:41,016 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-23 20:48:41,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:41,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 20:48:41,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:41,151 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:41,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:41,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:41,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:41,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:41,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:41,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:48:41,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:41,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:41,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:41,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:48:41,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 12 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:41,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:41,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2019-11-23 20:48:41,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968516698] [2019-11-23 20:48:41,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-23 20:48:41,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:41,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-23 20:48:41,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:48:41,512 INFO L87 Difference]: Start difference. First operand 159 states and 173 transitions. Second operand 31 states. [2019-11-23 20:48:44,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:44,173 INFO L93 Difference]: Finished difference Result 281 states and 307 transitions. [2019-11-23 20:48:44,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-11-23 20:48:44,173 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 63 [2019-11-23 20:48:44,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:44,175 INFO L225 Difference]: With dead ends: 281 [2019-11-23 20:48:44,176 INFO L226 Difference]: Without dead ends: 271 [2019-11-23 20:48:44,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=613, Invalid=5549, Unknown=0, NotChecked=0, Total=6162 [2019-11-23 20:48:44,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-23 20:48:44,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 165. [2019-11-23 20:48:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-23 20:48:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 180 transitions. [2019-11-23 20:48:44,192 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 180 transitions. Word has length 63 [2019-11-23 20:48:44,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:44,192 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 180 transitions. [2019-11-23 20:48:44,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-23 20:48:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 180 transitions. [2019-11-23 20:48:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 20:48:44,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:44,193 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:44,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:44,397 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:44,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash 993753918, now seen corresponding path program 3 times [2019-11-23 20:48:44,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:44,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229421524] [2019-11-23 20:48:44,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:44,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229421524] [2019-11-23 20:48:44,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025197554] [2019-11-23 20:48:44,600 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 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:48:44,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-23 20:48:44,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:44,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-23 20:48:44,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:44,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:44,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:44,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:44,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:44,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:48:44,697 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2019-11-23 20:48:44,708 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:44,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2019-11-23 20:48:44,709 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:44,726 INFO L567 ElimStorePlain]: treesize reduction 29, result has 46.3 percent of original size [2019-11-23 20:48:44,726 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:44,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:44,735 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:48:44,736 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:31 [2019-11-23 20:48:45,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:45,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:45,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2019-11-23 20:48:45,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395783227] [2019-11-23 20:48:45,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 20:48:45,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:45,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 20:48:45,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:48:45,079 INFO L87 Difference]: Start difference. First operand 165 states and 180 transitions. Second operand 26 states. [2019-11-23 20:48:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:48,590 INFO L93 Difference]: Finished difference Result 399 states and 445 transitions. [2019-11-23 20:48:48,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-11-23 20:48:48,590 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 63 [2019-11-23 20:48:48,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:48,592 INFO L225 Difference]: With dead ends: 399 [2019-11-23 20:48:48,592 INFO L226 Difference]: Without dead ends: 397 [2019-11-23 20:48:48,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4751 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1284, Invalid=12056, Unknown=0, NotChecked=0, Total=13340 [2019-11-23 20:48:48,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-23 20:48:48,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 177. [2019-11-23 20:48:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-23 20:48:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 194 transitions. [2019-11-23 20:48:48,613 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 194 transitions. Word has length 63 [2019-11-23 20:48:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:48,613 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 194 transitions. [2019-11-23 20:48:48,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 20:48:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 194 transitions. [2019-11-23 20:48:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-23 20:48:48,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:48,614 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:48,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:48,815 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:48,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:48,816 INFO L82 PathProgramCache]: Analyzing trace with hash 240906877, now seen corresponding path program 10 times [2019-11-23 20:48:48,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:48,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126395672] [2019-11-23 20:48:48,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 14 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:49,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126395672] [2019-11-23 20:48:49,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318754107] [2019-11-23 20:48:49,245 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 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:48:49,322 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:48:49,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:49,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-23 20:48:49,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:49,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:48:49,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:49,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:49,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:49,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:48:49,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:49,950 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 14 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:49,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:49,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2019-11-23 20:48:49,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885805844] [2019-11-23 20:48:49,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-23 20:48:49,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:49,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-23 20:48:49,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1024, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 20:48:49,952 INFO L87 Difference]: Start difference. First operand 177 states and 194 transitions. Second operand 34 states. [2019-11-23 20:48:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:53,378 INFO L93 Difference]: Finished difference Result 304 states and 328 transitions. [2019-11-23 20:48:53,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-11-23 20:48:53,378 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 69 [2019-11-23 20:48:53,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:53,380 INFO L225 Difference]: With dead ends: 304 [2019-11-23 20:48:53,380 INFO L226 Difference]: Without dead ends: 294 [2019-11-23 20:48:53,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=685, Invalid=5477, Unknown=0, NotChecked=0, Total=6162 [2019-11-23 20:48:53,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-23 20:48:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 183. [2019-11-23 20:48:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-11-23 20:48:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 200 transitions. [2019-11-23 20:48:53,397 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 200 transitions. Word has length 69 [2019-11-23 20:48:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:53,398 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 200 transitions. [2019-11-23 20:48:53,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-23 20:48:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 200 transitions. [2019-11-23 20:48:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-23 20:48:53,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:53,399 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:53,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:53,603 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:53,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:53,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1135027903, now seen corresponding path program 7 times [2019-11-23 20:48:53,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:53,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731914310] [2019-11-23 20:48:53,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:53,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731914310] [2019-11-23 20:48:53,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800059130] [2019-11-23 20:48:53,825 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:53,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-23 20:48:53,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:53,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:48:53,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:53,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:53,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:53,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-23 20:48:54,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:54,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:54,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2019-11-23 20:48:54,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617899360] [2019-11-23 20:48:54,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-23 20:48:54,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:54,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-23 20:48:54,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 20:48:54,249 INFO L87 Difference]: Start difference. First operand 183 states and 200 transitions. Second operand 33 states. [2019-11-23 20:49:00,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:00,704 INFO L93 Difference]: Finished difference Result 587 states and 655 transitions. [2019-11-23 20:49:00,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-11-23 20:49:00,704 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 69 [2019-11-23 20:49:00,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:00,707 INFO L225 Difference]: With dead ends: 587 [2019-11-23 20:49:00,707 INFO L226 Difference]: Without dead ends: 585 [2019-11-23 20:49:00,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14991 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2949, Invalid=34493, Unknown=0, NotChecked=0, Total=37442 [2019-11-23 20:49:00,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-11-23 20:49:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 189. [2019-11-23 20:49:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-23 20:49:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2019-11-23 20:49:00,728 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 69 [2019-11-23 20:49:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:00,728 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2019-11-23 20:49:00,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-23 20:49:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2019-11-23 20:49:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-23 20:49:00,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:00,729 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:00,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:00,932 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:00,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:00,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1440971664, now seen corresponding path program 11 times [2019-11-23 20:49:00,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:00,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142801488] [2019-11-23 20:49:00,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 157 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:01,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142801488] [2019-11-23 20:49:01,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579387262] [2019-11-23 20:49:01,564 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:01,638 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-23 20:49:01,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:01,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:49:01,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:01,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:01,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:49:01,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:49:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 200 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:02,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:02,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2019-11-23 20:49:02,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943293240] [2019-11-23 20:49:02,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-23 20:49:02,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:02,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-23 20:49:02,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 20:49:02,199 INFO L87 Difference]: Start difference. First operand 189 states and 206 transitions. Second operand 33 states. [2019-11-23 20:49:02,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:02,795 INFO L93 Difference]: Finished difference Result 354 states and 386 transitions. [2019-11-23 20:49:02,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 20:49:02,795 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 75 [2019-11-23 20:49:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:02,797 INFO L225 Difference]: With dead ends: 354 [2019-11-23 20:49:02,797 INFO L226 Difference]: Without dead ends: 210 [2019-11-23 20:49:02,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=372, Invalid=1268, Unknown=0, NotChecked=0, Total=1640 [2019-11-23 20:49:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-23 20:49:02,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 201. [2019-11-23 20:49:02,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-23 20:49:02,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2019-11-23 20:49:02,818 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 75 [2019-11-23 20:49:02,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:02,818 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2019-11-23 20:49:02,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-23 20:49:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2019-11-23 20:49:02,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-23 20:49:02,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:02,820 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:03,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:03,024 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:03,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:03,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1957940649, now seen corresponding path program 12 times [2019-11-23 20:49:03,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:03,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839539942] [2019-11-23 20:49:03,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 16 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:03,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839539942] [2019-11-23 20:49:03,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721356821] [2019-11-23 20:49:03,444 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:03,524 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-11-23 20:49:03,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:03,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 20:49:03,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:03,638 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:49:03,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:03,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:03,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:03,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2019-11-23 20:49:03,690 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:49:03,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:49:03,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:03,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:03,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:03,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-11-23 20:49:03,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 16 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:04,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:04,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 37 [2019-11-23 20:49:04,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909246779] [2019-11-23 20:49:04,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-23 20:49:04,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:04,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-23 20:49:04,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1225, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 20:49:04,006 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand 37 states. [2019-11-23 20:49:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:08,384 INFO L93 Difference]: Finished difference Result 423 states and 453 transitions. [2019-11-23 20:49:08,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-11-23 20:49:08,385 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 79 [2019-11-23 20:49:08,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:08,386 INFO L225 Difference]: With dead ends: 423 [2019-11-23 20:49:08,386 INFO L226 Difference]: Without dead ends: 413 [2019-11-23 20:49:08,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=893, Invalid=10027, Unknown=0, NotChecked=0, Total=10920 [2019-11-23 20:49:08,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-11-23 20:49:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 213. [2019-11-23 20:49:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-23 20:49:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 231 transitions. [2019-11-23 20:49:08,409 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 231 transitions. Word has length 79 [2019-11-23 20:49:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:08,409 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 231 transitions. [2019-11-23 20:49:08,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-23 20:49:08,410 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 231 transitions. [2019-11-23 20:49:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-23 20:49:08,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:08,410 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:08,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:08,614 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:08,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:08,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1881560359, now seen corresponding path program 4 times [2019-11-23 20:49:08,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:08,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170248548] [2019-11-23 20:49:08,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:08,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170248548] [2019-11-23 20:49:08,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896682923] [2019-11-23 20:49:08,929 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:08,991 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:49:08,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:08,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-23 20:49:08,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:09,164 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:49:09,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:09,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:09,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:09,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:49:09,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:09,212 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:49:09,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:09,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:09,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:09,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:49:09,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:09,651 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:09,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:09,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2019-11-23 20:49:09,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252912225] [2019-11-23 20:49:09,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-23 20:49:09,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:09,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-23 20:49:09,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 20:49:09,652 INFO L87 Difference]: Start difference. First operand 213 states and 231 transitions. Second operand 38 states. [2019-11-23 20:49:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:16,286 INFO L93 Difference]: Finished difference Result 602 states and 673 transitions. [2019-11-23 20:49:16,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-11-23 20:49:16,286 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-11-23 20:49:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:16,290 INFO L225 Difference]: With dead ends: 602 [2019-11-23 20:49:16,290 INFO L226 Difference]: Without dead ends: 600 [2019-11-23 20:49:16,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14371 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2947, Invalid=34109, Unknown=0, NotChecked=0, Total=37056 [2019-11-23 20:49:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-11-23 20:49:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 225. [2019-11-23 20:49:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-23 20:49:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 245 transitions. [2019-11-23 20:49:16,310 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 245 transitions. Word has length 79 [2019-11-23 20:49:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:16,310 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 245 transitions. [2019-11-23 20:49:16,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-23 20:49:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 245 transitions. [2019-11-23 20:49:16,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 20:49:16,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:16,312 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:16,514 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:16,515 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:16,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1082765668, now seen corresponding path program 13 times [2019-11-23 20:49:16,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:16,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483737126] [2019-11-23 20:49:16,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 18 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:16,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483737126] [2019-11-23 20:49:16,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475794403] [2019-11-23 20:49:16,908 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:16,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-23 20:49:16,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:17,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:49:17,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:17,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:17,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:17,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:49:17,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 18 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:17,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:17,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2019-11-23 20:49:17,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939858658] [2019-11-23 20:49:17,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-23 20:49:17,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:17,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-23 20:49:17,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1444, Unknown=0, NotChecked=0, Total=1560 [2019-11-23 20:49:17,652 INFO L87 Difference]: Start difference. First operand 225 states and 245 transitions. Second operand 40 states. [2019-11-23 20:49:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:23,011 INFO L93 Difference]: Finished difference Result 378 states and 406 transitions. [2019-11-23 20:49:23,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-11-23 20:49:23,012 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 85 [2019-11-23 20:49:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:23,013 INFO L225 Difference]: With dead ends: 378 [2019-11-23 20:49:23,013 INFO L226 Difference]: Without dead ends: 368 [2019-11-23 20:49:23,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2099 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=887, Invalid=8619, Unknown=0, NotChecked=0, Total=9506 [2019-11-23 20:49:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-11-23 20:49:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 231. [2019-11-23 20:49:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-23 20:49:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 251 transitions. [2019-11-23 20:49:23,042 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 251 transitions. Word has length 85 [2019-11-23 20:49:23,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:23,042 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 251 transitions. [2019-11-23 20:49:23,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-23 20:49:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 251 transitions. [2019-11-23 20:49:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 20:49:23,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:23,043 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:23,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:23,244 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:23,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:23,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1221636126, now seen corresponding path program 8 times [2019-11-23 20:49:23,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:23,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094120022] [2019-11-23 20:49:23,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:23,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094120022] [2019-11-23 20:49:23,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125226037] [2019-11-23 20:49:23,631 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:23,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:49:23,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:23,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-23 20:49:23,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:23,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:49:23,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:23,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:23,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:23,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-23 20:49:24,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:24,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:24,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2019-11-23 20:49:24,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323072197] [2019-11-23 20:49:24,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-23 20:49:24,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:24,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-23 20:49:24,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1339, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 20:49:24,295 INFO L87 Difference]: Start difference. First operand 231 states and 251 transitions. Second operand 39 states. [2019-11-23 20:49:34,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:34,506 INFO L93 Difference]: Finished difference Result 842 states and 941 transitions. [2019-11-23 20:49:34,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-11-23 20:49:34,506 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 85 [2019-11-23 20:49:34,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:34,509 INFO L225 Difference]: With dead ends: 842 [2019-11-23 20:49:34,509 INFO L226 Difference]: Without dead ends: 840 [2019-11-23 20:49:34,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33402 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=4865, Invalid=74377, Unknown=0, NotChecked=0, Total=79242 [2019-11-23 20:49:34,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-11-23 20:49:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 237. [2019-11-23 20:49:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-23 20:49:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 257 transitions. [2019-11-23 20:49:34,532 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 257 transitions. Word has length 85 [2019-11-23 20:49:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:34,533 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 257 transitions. [2019-11-23 20:49:34,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-23 20:49:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 257 transitions. [2019-11-23 20:49:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-23 20:49:34,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:34,533 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:34,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:34,734 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:34,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:34,735 INFO L82 PathProgramCache]: Analyzing trace with hash -991752881, now seen corresponding path program 14 times [2019-11-23 20:49:34,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:34,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938451710] [2019-11-23 20:49:34,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 255 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:35,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938451710] [2019-11-23 20:49:35,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573297294] [2019-11-23 20:49:35,686 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:35,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:49:35,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:35,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-23 20:49:35,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:35,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:35,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:49:35,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:49:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 310 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:36,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:36,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2019-11-23 20:49:36,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042815982] [2019-11-23 20:49:36,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-23 20:49:36,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:36,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-23 20:49:36,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1155, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 20:49:36,285 INFO L87 Difference]: Start difference. First operand 237 states and 257 transitions. Second operand 39 states. [2019-11-23 20:49:36,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:36,882 INFO L93 Difference]: Finished difference Result 438 states and 476 transitions. [2019-11-23 20:49:36,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 20:49:36,882 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 91 [2019-11-23 20:49:36,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:36,884 INFO L225 Difference]: With dead ends: 438 [2019-11-23 20:49:36,884 INFO L226 Difference]: Without dead ends: 258 [2019-11-23 20:49:36,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=498, Invalid=1758, Unknown=0, NotChecked=0, Total=2256 [2019-11-23 20:49:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-23 20:49:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2019-11-23 20:49:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-23 20:49:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 269 transitions. [2019-11-23 20:49:36,911 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 269 transitions. Word has length 91 [2019-11-23 20:49:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:36,911 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 269 transitions. [2019-11-23 20:49:36,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-23 20:49:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 269 transitions. [2019-11-23 20:49:36,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-23 20:49:36,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:36,913 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:37,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:37,116 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash -409287544, now seen corresponding path program 15 times [2019-11-23 20:49:37,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:37,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976835033] [2019-11-23 20:49:37,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 20 proven. 356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:37,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976835033] [2019-11-23 20:49:37,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422278118] [2019-11-23 20:49:37,599 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:37,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-11-23 20:49:37,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:37,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-23 20:49:37,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:37,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:49:37,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:37,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:37,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:37,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:49:38,034 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:49:38,034 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:49:38,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:38,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:38,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:38,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2019-11-23 20:49:38,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 20 proven. 356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:38,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:38,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 45 [2019-11-23 20:49:38,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609187629] [2019-11-23 20:49:38,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-23 20:49:38,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:38,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-23 20:49:38,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1842, Unknown=0, NotChecked=0, Total=1980 [2019-11-23 20:49:38,635 INFO L87 Difference]: Start difference. First operand 249 states and 269 transitions. Second operand 45 states.