java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:29:11,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:29:11,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:29:11,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:29:11,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:29:11,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:29:11,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:29:11,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:29:11,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:29:11,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:29:11,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:29:11,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:29:11,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:29:11,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:29:11,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:29:11,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:29:11,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:29:11,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:29:11,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:29:11,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:29:11,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:29:11,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:29:11,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:29:11,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:29:11,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:29:11,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:29:11,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:29:11,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:29:11,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:29:11,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:29:11,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:29:11,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:29:11,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:29:11,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:29:11,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:29:11,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:29:11,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:29:11,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:29:11,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:29:11,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:29:11,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:29:11,469 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-09-05 11:29:11,486 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:29:11,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:29:11,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:29:11,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:29:11,490 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:29:11,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:29:11,491 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:29:11,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:29:11,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:29:11,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:29:11,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:29:11,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:29:11,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:29:11,493 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:29:11,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:29:11,493 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:29:11,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:29:11,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:29:11,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:29:11,494 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:29:11,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:29:11,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:29:11,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:29:11,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:29:11,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:29:11,496 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:29:11,496 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:29:11,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:29:11,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:29:11,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:29:11,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:29:11,568 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:29:11,569 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:29:11,570 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:29:11,570 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-1.c [2019-09-05 11:29:11,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2ac3904f/d4dc6ace86884fed9d08b78d0b896913/FLAG11892ca5f [2019-09-05 11:29:12,070 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:29:12,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-1.c [2019-09-05 11:29:12,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2ac3904f/d4dc6ace86884fed9d08b78d0b896913/FLAG11892ca5f [2019-09-05 11:29:12,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2ac3904f/d4dc6ace86884fed9d08b78d0b896913 [2019-09-05 11:29:12,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:29:12,432 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:29:12,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:12,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:29:12,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:29:12,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:12" (1/1) ... [2019-09-05 11:29:12,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227ea5d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:12, skipping insertion in model container [2019-09-05 11:29:12,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:12" (1/1) ... [2019-09-05 11:29:12,447 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:29:12,464 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:29:12,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:12,676 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:29:12,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:12,713 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:29:12,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:12 WrapperNode [2019-09-05 11:29:12,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:12,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:29:12,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:29:12,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:29:12,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:12" (1/1) ... [2019-09-05 11:29:12,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:12" (1/1) ... [2019-09-05 11:29:12,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:12" (1/1) ... [2019-09-05 11:29:12,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:12" (1/1) ... [2019-09-05 11:29:12,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:12" (1/1) ... [2019-09-05 11:29:12,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:12" (1/1) ... [2019-09-05 11:29:12,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:12" (1/1) ... [2019-09-05 11:29:12,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:29:12,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:29:12,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:29:12,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:29:12,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:12" (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-09-05 11:29:12,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:29:12,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:29:12,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:29:12,902 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:29:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:29:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:29:12,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-05 11:29:12,903 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:29:12,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-05 11:29:12,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-05 11:29:12,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-05 11:29:12,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-05 11:29:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:29:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:29:13,132 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:29:13,132 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-05 11:29:13,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:13 BoogieIcfgContainer [2019-09-05 11:29:13,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:29:13,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:29:13,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:29:13,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:29:13,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:29:12" (1/3) ... [2019-09-05 11:29:13,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b1808e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:13, skipping insertion in model container [2019-09-05 11:29:13,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:12" (2/3) ... [2019-09-05 11:29:13,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b1808e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:13, skipping insertion in model container [2019-09-05 11:29:13,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:13" (3/3) ... [2019-09-05 11:29:13,146 INFO L109 eAbstractionObserver]: Analyzing ICFG insertion_sort-1.c [2019-09-05 11:29:13,165 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:29:13,182 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:29:13,224 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:29:13,273 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:29:13,273 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:29:13,273 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:29:13,274 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:29:13,274 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:29:13,274 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:29:13,274 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:29:13,274 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:29:13,274 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:29:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-09-05 11:29:13,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 11:29:13,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:13,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:13,297 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:13,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:13,301 INFO L82 PathProgramCache]: Analyzing trace with hash 342854797, now seen corresponding path program 1 times [2019-09-05 11:29:13,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:13,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:13,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:13,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:13,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:13,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:13,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:29:13,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:29:13,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:29:13,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:29:13,631 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2019-09-05 11:29:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:13,719 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2019-09-05 11:29:13,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:29:13,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-05 11:29:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:13,729 INFO L225 Difference]: With dead ends: 67 [2019-09-05 11:29:13,729 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 11:29:13,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:29:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 11:29:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-09-05 11:29:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 11:29:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-05 11:29:13,780 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2019-09-05 11:29:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:13,782 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-05 11:29:13,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:29:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-05 11:29:13,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 11:29:13,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:13,786 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:13,786 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:13,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:13,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1336061280, now seen corresponding path program 1 times [2019-09-05 11:29:13,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:13,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:13,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:13,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:13,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:14,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:14,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:14,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:14,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 11:29:14,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:14,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:14,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:14,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-05 11:29:14,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:14,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:14,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:14,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-09-05 11:29:14,685 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:14,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:29:14,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:14,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:14,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:14,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:29:14,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:14,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:14,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2019-09-05 11:29:14,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:29:14,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:29:14,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:29:14,758 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 19 states. [2019-09-05 11:29:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:15,423 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2019-09-05 11:29:15,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:29:15,424 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-09-05 11:29:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:15,427 INFO L225 Difference]: With dead ends: 86 [2019-09-05 11:29:15,428 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 11:29:15,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:29:15,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 11:29:15,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2019-09-05 11:29:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 11:29:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-09-05 11:29:15,443 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 19 [2019-09-05 11:29:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:15,444 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-09-05 11:29:15,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:29:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-09-05 11:29:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 11:29:15,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:15,446 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:15,446 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:15,447 INFO L82 PathProgramCache]: Analyzing trace with hash -455852680, now seen corresponding path program 1 times [2019-09-05 11:29:15,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:15,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:15,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:15,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:15,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:16,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:16,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:16,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:16,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 11:29:16,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:16,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,325 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-09-05 11:29:16,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2019-09-05 11:29:16,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:16,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:16,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:16,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-09-05 11:29:16,577 INFO L341 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-09-05 11:29:16,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 123 [2019-09-05 11:29:16,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:16,619 INFO L567 ElimStorePlain]: treesize reduction 131, result has 22.0 percent of original size [2019-09-05 11:29:16,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:16,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2019-09-05 11:29:16,753 INFO L341 Elim1Store]: treesize reduction 27, result has 67.1 percent of original size [2019-09-05 11:29:16,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 66 [2019-09-05 11:29:16,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-09-05 11:29:16,809 INFO L567 ElimStorePlain]: treesize reduction 143, result has 7.7 percent of original size [2019-09-05 11:29:16,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:16,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2019-09-05 11:29:16,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:16,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:16,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2019-09-05 11:29:16,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:29:16,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:29:16,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:29:16,900 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 29 states. [2019-09-05 11:29:17,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:17,946 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2019-09-05 11:29:17,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 11:29:17,947 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 24 [2019-09-05 11:29:17,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:17,950 INFO L225 Difference]: With dead ends: 105 [2019-09-05 11:29:17,951 INFO L226 Difference]: Without dead ends: 70 [2019-09-05 11:29:17,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=219, Invalid=1421, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:29:17,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-05 11:29:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. [2019-09-05 11:29:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 11:29:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-09-05 11:29:17,971 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 24 [2019-09-05 11:29:17,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:17,972 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-09-05 11:29:17,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:29:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-09-05 11:29:17,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-05 11:29:17,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:17,973 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:17,973 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:17,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:17,974 INFO L82 PathProgramCache]: Analyzing trace with hash 2042668019, now seen corresponding path program 2 times [2019-09-05 11:29:17,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:17,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:17,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:17,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:17,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:18,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:18,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:18,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:18,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:18,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:18,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 11:29:18,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:18,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:18,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:18,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-05 11:29:18,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:18,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:18,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-05 11:29:18,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:18,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:18,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:18,875 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:18,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-05 11:29:18,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:18,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:18,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2019-09-05 11:29:18,927 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:18,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:29:18,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:18,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:29:18,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:18,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:18,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2019-09-05 11:29:18,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:29:18,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:29:18,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:29:18,973 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 23 states. [2019-09-05 11:29:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:20,060 INFO L93 Difference]: Finished difference Result 136 states and 169 transitions. [2019-09-05 11:29:20,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 11:29:20,060 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2019-09-05 11:29:20,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:20,063 INFO L225 Difference]: With dead ends: 136 [2019-09-05 11:29:20,063 INFO L226 Difference]: Without dead ends: 117 [2019-09-05 11:29:20,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:29:20,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-05 11:29:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 57. [2019-09-05 11:29:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-05 11:29:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2019-09-05 11:29:20,076 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 25 [2019-09-05 11:29:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:20,076 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2019-09-05 11:29:20,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:29:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2019-09-05 11:29:20,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 11:29:20,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:20,078 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:20,078 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:20,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:20,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2145817879, now seen corresponding path program 1 times [2019-09-05 11:29:20,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:20,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:20,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:20,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:20,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:20,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:20,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:20,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:20,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 11:29:20,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:20,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:20,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-05 11:29:20,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:29:20,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:29:20,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:29:20,274 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 8 states. [2019-09-05 11:29:20,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:20,369 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2019-09-05 11:29:20,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:29:20,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-09-05 11:29:20,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:20,370 INFO L225 Difference]: With dead ends: 82 [2019-09-05 11:29:20,370 INFO L226 Difference]: Without dead ends: 66 [2019-09-05 11:29:20,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:29:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-05 11:29:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2019-09-05 11:29:20,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-05 11:29:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2019-09-05 11:29:20,383 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 27 [2019-09-05 11:29:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:20,383 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2019-09-05 11:29:20,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:29:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2019-09-05 11:29:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:29:20,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:20,386 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:20,387 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:20,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:20,387 INFO L82 PathProgramCache]: Analyzing trace with hash 504300867, now seen corresponding path program 1 times [2019-09-05 11:29:20,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:20,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:20,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:20,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:20,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:20,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:20,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:20,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:20,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 11:29:20,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:20,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:20,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:20,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-09-05 11:29:20,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:20,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:20,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:20,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-09-05 11:29:20,867 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:20,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:29:20,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:20,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:20,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:20,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:29:20,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:20,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:20,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 20 [2019-09-05 11:29:20,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:29:20,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:29:20,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:29:20,909 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 20 states. [2019-09-05 11:29:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:22,075 INFO L93 Difference]: Finished difference Result 162 states and 212 transitions. [2019-09-05 11:29:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 11:29:22,075 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-09-05 11:29:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:22,077 INFO L225 Difference]: With dead ends: 162 [2019-09-05 11:29:22,077 INFO L226 Difference]: Without dead ends: 143 [2019-09-05 11:29:22,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=570, Invalid=2186, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 11:29:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-05 11:29:22,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 67. [2019-09-05 11:29:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-05 11:29:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-09-05 11:29:22,090 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 30 [2019-09-05 11:29:22,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:22,091 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-09-05 11:29:22,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:29:22,091 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2019-09-05 11:29:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:29:22,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:22,093 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:22,093 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:22,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1205365445, now seen corresponding path program 2 times [2019-09-05 11:29:22,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:22,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:22,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:22,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:22,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:22,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:22,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:22,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:22,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:22,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:22,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:29:22,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:22,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:22,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:22,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-05 11:29:22,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:29:22,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:29:22,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:29:22,176 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 7 states. [2019-09-05 11:29:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:22,441 INFO L93 Difference]: Finished difference Result 146 states and 186 transitions. [2019-09-05 11:29:22,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:29:22,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-09-05 11:29:22,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:22,443 INFO L225 Difference]: With dead ends: 146 [2019-09-05 11:29:22,443 INFO L226 Difference]: Without dead ends: 104 [2019-09-05 11:29:22,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:29:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-05 11:29:22,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 76. [2019-09-05 11:29:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-05 11:29:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2019-09-05 11:29:22,455 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 30 [2019-09-05 11:29:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:22,456 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2019-09-05 11:29:22,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:29:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2019-09-05 11:29:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:29:22,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:22,457 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:22,457 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:22,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:22,458 INFO L82 PathProgramCache]: Analyzing trace with hash 488358411, now seen corresponding path program 3 times [2019-09-05 11:29:22,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:22,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:22,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:22,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:22,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:22,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:22,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:22,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:29:23,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 11:29:23,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:23,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 11:29:23,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:23,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:23,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:23,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-09-05 11:29:23,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:23,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:23,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:23,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:53 [2019-09-05 11:29:23,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:23,263 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:29:23,265 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:23,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 44 [2019-09-05 11:29:23,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:23,288 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-09-05 11:29:23,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:23,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:37 [2019-09-05 11:29:23,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:23,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:23,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:23,452 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:23,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-09-05 11:29:23,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:23,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:23,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:23,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:27 [2019-09-05 11:29:23,497 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:23,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-05 11:29:23,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:23,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:23,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:23,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-05 11:29:23,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:23,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:23,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 28 [2019-09-05 11:29:23,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 11:29:23,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 11:29:23,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:29:23,569 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand 28 states. [2019-09-05 11:29:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:24,912 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2019-09-05 11:29:24,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 11:29:24,913 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2019-09-05 11:29:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:24,914 INFO L225 Difference]: With dead ends: 135 [2019-09-05 11:29:24,914 INFO L226 Difference]: Without dead ends: 133 [2019-09-05 11:29:24,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=279, Invalid=1791, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 11:29:24,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-05 11:29:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 70. [2019-09-05 11:29:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-05 11:29:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2019-09-05 11:29:24,927 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 30 [2019-09-05 11:29:24,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:24,927 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2019-09-05 11:29:24,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 11:29:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2019-09-05 11:29:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 11:29:24,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:24,929 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:24,929 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:24,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:24,930 INFO L82 PathProgramCache]: Analyzing trace with hash 586827946, now seen corresponding path program 2 times [2019-09-05 11:29:24,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:24,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:24,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:24,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:24,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:25,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:25,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:25,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:25,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:25,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:25,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 11:29:25,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:25,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:25,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:25,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09-05 11:29:25,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:25,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:25,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:25,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-05 11:29:25,600 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:25,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:29:25,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:25,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:25,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:25,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:29:25,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:25,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:25,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2019-09-05 11:29:25,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 11:29:25,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 11:29:25,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:29:25,650 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 28 states. [2019-09-05 11:29:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:40,482 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2019-09-05 11:29:40,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 11:29:40,482 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2019-09-05 11:29:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:40,484 INFO L225 Difference]: With dead ends: 131 [2019-09-05 11:29:40,484 INFO L226 Difference]: Without dead ends: 129 [2019-09-05 11:29:40,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=245, Invalid=1647, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 11:29:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-05 11:29:40,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 82. [2019-09-05 11:29:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-05 11:29:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2019-09-05 11:29:40,496 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 33 [2019-09-05 11:29:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:40,497 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2019-09-05 11:29:40,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 11:29:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2019-09-05 11:29:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-05 11:29:40,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:40,499 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:40,499 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:40,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:40,499 INFO L82 PathProgramCache]: Analyzing trace with hash 853695349, now seen corresponding path program 4 times [2019-09-05 11:29:40,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:40,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:40,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:40,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:40,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:40,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:40,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:40,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:29:40,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:29:40,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:40,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 11:29:40,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:40,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:40,990 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-09-05 11:29:40,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2019-09-05 11:29:40,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:40,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:40,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:40,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:38 [2019-09-05 11:29:41,195 INFO L341 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-09-05 11:29:41,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 123 [2019-09-05 11:29:41,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:41,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:41,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:41,240 INFO L567 ElimStorePlain]: treesize reduction 129, result has 22.3 percent of original size [2019-09-05 11:29:41,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:41,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:29 [2019-09-05 11:29:41,343 INFO L341 Elim1Store]: treesize reduction 27, result has 67.1 percent of original size [2019-09-05 11:29:41,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 66 [2019-09-05 11:29:41,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:41,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:41,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:41,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:41,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:41,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:41,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:41,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:41,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:41,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:41,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:41,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:41,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-05 11:29:41,385 INFO L567 ElimStorePlain]: treesize reduction 123, result has 8.9 percent of original size [2019-09-05 11:29:41,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:41,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2019-09-05 11:29:41,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:41,421 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-05 11:29:41,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:41,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2019-09-05 11:29:41,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 11:29:41,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 11:29:41,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:29:41,426 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand 28 states. [2019-09-05 11:29:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:42,824 INFO L93 Difference]: Finished difference Result 168 states and 202 transitions. [2019-09-05 11:29:42,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 11:29:42,824 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2019-09-05 11:29:42,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:42,826 INFO L225 Difference]: With dead ends: 168 [2019-09-05 11:29:42,826 INFO L226 Difference]: Without dead ends: 126 [2019-09-05 11:29:42,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=421, Invalid=2659, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 11:29:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-05 11:29:42,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 85. [2019-09-05 11:29:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-05 11:29:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2019-09-05 11:29:42,840 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 35 [2019-09-05 11:29:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:42,840 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2019-09-05 11:29:42,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 11:29:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2019-09-05 11:29:42,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 11:29:42,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:42,842 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:42,842 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:42,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1400428558, now seen corresponding path program 1 times [2019-09-05 11:29:42,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:42,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:42,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:42,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:42,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:43,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:43,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:43,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:43,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 11:29:43,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:43,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:43,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:43,840 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:29:43,842 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:43,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2019-09-05 11:29:43,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:43,859 INFO L567 ElimStorePlain]: treesize reduction 19, result has 61.2 percent of original size [2019-09-05 11:29:43,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:43,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:30 [2019-09-05 11:29:43,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-09-05 11:29:43,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:43,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:43,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:43,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:43,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:43,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:43,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:43,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2019-09-05 11:29:43,976 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:43,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:43,981 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:43,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:43,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:43,987 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-09-05 11:29:44,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:44,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:44,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:44,060 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:44,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-09-05 11:29:44,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:44,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:44,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:44,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-09-05 11:29:44,088 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:44,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:29:44,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:44,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:44,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:44,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:29:44,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 11:29:44,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:44,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 28 [2019-09-05 11:29:44,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 11:29:44,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 11:29:44,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:29:44,144 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 28 states. [2019-09-05 11:29:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:45,666 INFO L93 Difference]: Finished difference Result 254 states and 303 transitions. [2019-09-05 11:29:45,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 11:29:45,667 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2019-09-05 11:29:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:45,669 INFO L225 Difference]: With dead ends: 254 [2019-09-05 11:29:45,669 INFO L226 Difference]: Without dead ends: 209 [2019-09-05 11:29:45,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=278, Invalid=1792, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 11:29:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-05 11:29:45,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-09-05 11:29:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-05 11:29:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 138 transitions. [2019-09-05 11:29:45,694 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 138 transitions. Word has length 36 [2019-09-05 11:29:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:45,694 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 138 transitions. [2019-09-05 11:29:45,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 11:29:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2019-09-05 11:29:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 11:29:45,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:45,696 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:45,696 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:45,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:45,696 INFO L82 PathProgramCache]: Analyzing trace with hash -311016042, now seen corresponding path program 2 times [2019-09-05 11:29:45,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:45,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:45,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:45,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:45,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:46,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:46,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:46,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:46,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:46,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:46,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 11:29:46,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:46,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:46,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:46,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-09-05 11:29:46,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:46,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:46,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:46,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-09-05 11:29:46,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:46,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:46,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:46,758 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:46,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-09-05 11:29:46,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:46,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:46,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:46,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-09-05 11:29:46,788 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:46,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:29:46,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:46,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:46,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:46,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:29:46,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:46,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:46,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 30 [2019-09-05 11:29:46,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 11:29:46,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 11:29:46,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:29:46,845 INFO L87 Difference]: Start difference. First operand 115 states and 138 transitions. Second operand 30 states. [2019-09-05 11:29:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:48,740 INFO L93 Difference]: Finished difference Result 253 states and 304 transitions. [2019-09-05 11:29:48,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 11:29:48,740 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-05 11:29:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:48,743 INFO L225 Difference]: With dead ends: 253 [2019-09-05 11:29:48,743 INFO L226 Difference]: Without dead ends: 208 [2019-09-05 11:29:48,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=403, Invalid=2567, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 11:29:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-05 11:29:48,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 134. [2019-09-05 11:29:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-05 11:29:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 163 transitions. [2019-09-05 11:29:48,760 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 163 transitions. Word has length 36 [2019-09-05 11:29:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:48,761 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 163 transitions. [2019-09-05 11:29:48,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 11:29:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 163 transitions. [2019-09-05 11:29:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 11:29:48,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:48,762 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:48,762 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:48,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:48,763 INFO L82 PathProgramCache]: Analyzing trace with hash -591767046, now seen corresponding path program 1 times [2019-09-05 11:29:48,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:48,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:48,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:48,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:48,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:49,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:49,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:49,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:49,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 11:29:49,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:49,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:49,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:49,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-09-05 11:29:49,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:49,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:49,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:49,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:41 [2019-09-05 11:29:49,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:49,535 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:29:49,537 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:49,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2019-09-05 11:29:49,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:49,560 INFO L567 ElimStorePlain]: treesize reduction 9, result has 78.6 percent of original size [2019-09-05 11:29:49,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:49,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-09-05 11:29:49,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:49,886 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:29:49,887 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:49,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 15 [2019-09-05 11:29:49,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:49,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:49,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:49,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-09-05 11:29:49,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:49,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:49,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2019-09-05 11:29:49,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 11:29:49,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 11:29:49,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:29:49,965 INFO L87 Difference]: Start difference. First operand 134 states and 163 transitions. Second operand 36 states. [2019-09-05 11:29:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:52,720 INFO L93 Difference]: Finished difference Result 242 states and 290 transitions. [2019-09-05 11:29:52,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-05 11:29:52,720 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 38 [2019-09-05 11:29:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:52,723 INFO L225 Difference]: With dead ends: 242 [2019-09-05 11:29:52,723 INFO L226 Difference]: Without dead ends: 240 [2019-09-05 11:29:52,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1675 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=627, Invalid=4775, Unknown=0, NotChecked=0, Total=5402 [2019-09-05 11:29:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-05 11:29:52,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 160. [2019-09-05 11:29:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-05 11:29:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 194 transitions. [2019-09-05 11:29:52,746 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 194 transitions. Word has length 38 [2019-09-05 11:29:52,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:52,746 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 194 transitions. [2019-09-05 11:29:52,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 11:29:52,747 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 194 transitions. [2019-09-05 11:29:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-05 11:29:52,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:52,749 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:52,749 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:52,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:52,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1198506493, now seen corresponding path program 3 times [2019-09-05 11:29:52,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:52,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:52,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:52,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:52,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:53,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:53,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:53,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:29:53,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 11:29:53,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:53,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 11:29:53,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:53,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:53,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:53,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-05 11:29:53,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:53,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:53,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:53,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-09-05 11:29:53,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:53,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:53,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:53,377 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:53,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2019-09-05 11:29:53,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:53,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:53,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:53,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-09-05 11:29:53,644 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:53,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:29:53,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:53,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:53,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:53,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:29:53,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:53,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:53,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 35 [2019-09-05 11:29:53,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 11:29:53,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 11:29:53,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:29:53,698 INFO L87 Difference]: Start difference. First operand 160 states and 194 transitions. Second operand 35 states. [2019-09-05 11:30:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:15,549 INFO L93 Difference]: Finished difference Result 302 states and 360 transitions. [2019-09-05 11:30:15,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-05 11:30:15,549 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 39 [2019-09-05 11:30:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:15,552 INFO L225 Difference]: With dead ends: 302 [2019-09-05 11:30:15,552 INFO L226 Difference]: Without dead ends: 242 [2019-09-05 11:30:15,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=429, Invalid=3603, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 11:30:15,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-05 11:30:15,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 149. [2019-09-05 11:30:15,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-05 11:30:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 181 transitions. [2019-09-05 11:30:15,573 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 181 transitions. Word has length 39 [2019-09-05 11:30:15,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:15,573 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 181 transitions. [2019-09-05 11:30:15,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 11:30:15,573 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 181 transitions. [2019-09-05 11:30:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 11:30:15,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:15,574 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:15,574 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:15,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:15,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1463502433, now seen corresponding path program 4 times [2019-09-05 11:30:15,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:15,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:15,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:15,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:15,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 11:30:15,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:15,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:15,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:30:15,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:30:15,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:15,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 11:30:15,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 11:30:15,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:15,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-09-05 11:30:15,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:30:15,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:30:15,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:30:15,817 INFO L87 Difference]: Start difference. First operand 149 states and 181 transitions. Second operand 11 states. [2019-09-05 11:30:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:15,988 INFO L93 Difference]: Finished difference Result 238 states and 289 transitions. [2019-09-05 11:30:15,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:30:15,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-09-05 11:30:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:15,991 INFO L225 Difference]: With dead ends: 238 [2019-09-05 11:30:15,991 INFO L226 Difference]: Without dead ends: 218 [2019-09-05 11:30:15,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:30:15,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-05 11:30:16,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 167. [2019-09-05 11:30:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-05 11:30:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 199 transitions. [2019-09-05 11:30:16,016 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 199 transitions. Word has length 41 [2019-09-05 11:30:16,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:16,017 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 199 transitions. [2019-09-05 11:30:16,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:30:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 199 transitions. [2019-09-05 11:30:16,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 11:30:16,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:16,018 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:16,018 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:16,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:16,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2065125816, now seen corresponding path program 5 times [2019-09-05 11:30:16,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:16,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:16,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:16,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:16,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:16,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:16,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:16,683 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:30:16,746 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-05 11:30:16,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:16,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 11:30:16,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:16,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:16,990 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-09-05 11:30:16,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2019-09-05 11:30:16,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:17,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:17,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:17,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-09-05 11:30:17,097 INFO L341 Elim1Store]: treesize reduction 60, result has 16.7 percent of original size [2019-09-05 11:30:17,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 33 [2019-09-05 11:30:17,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:17,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:17,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:17,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:39 [2019-09-05 11:30:17,278 INFO L341 Elim1Store]: treesize reduction 18, result has 85.6 percent of original size [2019-09-05 11:30:17,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 124 [2019-09-05 11:30:17,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:17,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:17,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:17,312 INFO L567 ElimStorePlain]: treesize reduction 81, result has 38.6 percent of original size [2019-09-05 11:30:17,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:17,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:34 [2019-09-05 11:30:17,430 INFO L341 Elim1Store]: treesize reduction 28, result has 67.1 percent of original size [2019-09-05 11:30:17,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 68 [2019-09-05 11:30:17,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:17,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:17,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:17,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:17,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:17,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:17,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:17,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:17,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:17,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:17,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:17,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:17,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-09-05 11:30:17,477 INFO L567 ElimStorePlain]: treesize reduction 116, result has 12.1 percent of original size [2019-09-05 11:30:17,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:17,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:5 [2019-09-05 11:30:17,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:30:17,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:17,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2019-09-05 11:30:17,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 11:30:17,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 11:30:17,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1319, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 11:30:17,532 INFO L87 Difference]: Start difference. First operand 167 states and 199 transitions. Second operand 39 states. [2019-09-05 11:30:21,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:21,568 INFO L93 Difference]: Finished difference Result 407 states and 498 transitions. [2019-09-05 11:30:21,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-05 11:30:21,569 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 41 [2019-09-05 11:30:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:21,572 INFO L225 Difference]: With dead ends: 407 [2019-09-05 11:30:21,572 INFO L226 Difference]: Without dead ends: 347 [2019-09-05 11:30:21,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2528 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=920, Invalid=7090, Unknown=0, NotChecked=0, Total=8010 [2019-09-05 11:30:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-05 11:30:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 227. [2019-09-05 11:30:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-05 11:30:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 275 transitions. [2019-09-05 11:30:21,609 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 275 transitions. Word has length 41 [2019-09-05 11:30:21,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:21,609 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 275 transitions. [2019-09-05 11:30:21,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 11:30:21,609 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 275 transitions. [2019-09-05 11:30:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 11:30:21,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:21,610 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:21,611 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:21,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:21,611 INFO L82 PathProgramCache]: Analyzing trace with hash 591821558, now seen corresponding path program 1 times [2019-09-05 11:30:21,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:21,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:21,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:21,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:21,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:22,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:22,527 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:22,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:30:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:22,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 11:30:22,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:22,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:22,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:22,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-09-05 11:30:22,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:22,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:22,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:22,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:49 [2019-09-05 11:30:22,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:22,960 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:30:22,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:22,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2019-09-05 11:30:22,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:22,999 INFO L567 ElimStorePlain]: treesize reduction 11, result has 81.7 percent of original size [2019-09-05 11:30:23,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:23,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:73, output treesize:46 [2019-09-05 11:30:23,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:23,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:23,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:23,151 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:23,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2019-09-05 11:30:23,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:23,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:23,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:23,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:41 [2019-09-05 11:30:23,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:23,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:23,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:23,339 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:23,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2019-09-05 11:30:23,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:23,368 INFO L567 ElimStorePlain]: treesize reduction 3, result has 94.6 percent of original size [2019-09-05 11:30:23,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:23,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-09-05 11:30:23,479 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:30:23,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:23,482 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:30:23,486 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:23,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 18 [2019-09-05 11:30:23,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:23,500 INFO L567 ElimStorePlain]: treesize reduction 3, result has 85.0 percent of original size [2019-09-05 11:30:23,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:23,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:5 [2019-09-05 11:30:23,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 11:30:23,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:23,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2019-09-05 11:30:23,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 11:30:23,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 11:30:23,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 11:30:23,695 INFO L87 Difference]: Start difference. First operand 227 states and 275 transitions. Second operand 40 states. [2019-09-05 11:30:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:25,705 INFO L93 Difference]: Finished difference Result 397 states and 481 transitions. [2019-09-05 11:30:25,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 11:30:25,705 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 41 [2019-09-05 11:30:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:25,708 INFO L225 Difference]: With dead ends: 397 [2019-09-05 11:30:25,708 INFO L226 Difference]: Without dead ends: 318 [2019-09-05 11:30:25,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=394, Invalid=3512, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 11:30:25,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-05 11:30:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 254. [2019-09-05 11:30:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-05 11:30:25,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 311 transitions. [2019-09-05 11:30:25,738 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 311 transitions. Word has length 41 [2019-09-05 11:30:25,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:25,738 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 311 transitions. [2019-09-05 11:30:25,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 11:30:25,738 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 311 transitions. [2019-09-05 11:30:25,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 11:30:25,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:25,739 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:25,740 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:25,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:25,740 INFO L82 PathProgramCache]: Analyzing trace with hash 369785307, now seen corresponding path program 2 times [2019-09-05 11:30:25,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:25,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:25,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:25,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:30:25,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:26,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:26,462 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:26,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:30:26,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:30:26,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:26,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 11:30:26,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:26,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:26,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:26,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-05 11:30:26,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:26,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:26,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:26,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 [2019-09-05 11:30:26,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:26,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:26,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:26,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:26,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-05 11:30:26,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:26,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:26,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:26,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-05 11:30:26,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:26,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:26,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:26,829 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:26,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-05 11:30:26,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:26,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:26,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:26,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-05 11:30:26,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:26,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:26,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:26,957 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:26,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2019-09-05 11:30:26,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:26,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:26,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:26,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:26 [2019-09-05 11:30:27,009 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:27,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:30:27,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:27,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:27,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:27,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:30:27,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:27,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:27,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 32 [2019-09-05 11:30:27,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:30:27,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:30:27,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:30:27,066 INFO L87 Difference]: Start difference. First operand 254 states and 311 transitions. Second operand 32 states. [2019-09-05 11:30:29,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:29,347 INFO L93 Difference]: Finished difference Result 538 states and 665 transitions. [2019-09-05 11:30:29,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 11:30:29,348 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2019-09-05 11:30:29,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:29,351 INFO L225 Difference]: With dead ends: 538 [2019-09-05 11:30:29,351 INFO L226 Difference]: Without dead ends: 459 [2019-09-05 11:30:29,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=448, Invalid=2744, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 11:30:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-05 11:30:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 301. [2019-09-05 11:30:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-05 11:30:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 371 transitions. [2019-09-05 11:30:29,393 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 371 transitions. Word has length 42 [2019-09-05 11:30:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:29,393 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 371 transitions. [2019-09-05 11:30:29,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:30:29,393 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 371 transitions. [2019-09-05 11:30:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-05 11:30:29,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:29,394 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:29,395 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:29,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:29,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1630887468, now seen corresponding path program 1 times [2019-09-05 11:30:29,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:29,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:29,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:29,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:29,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:30,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:30,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:30,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:30:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:30,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 11:30:30,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:30,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:30,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:30,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-05 11:30:30,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:30,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:30,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:30,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-05 11:30:30,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:30,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:30,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:30,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:30,878 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:30:30,879 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:30,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 46 [2019-09-05 11:30:30,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:30,901 INFO L567 ElimStorePlain]: treesize reduction 17, result has 70.7 percent of original size [2019-09-05 11:30:30,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:30,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:41 [2019-09-05 11:30:31,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:31,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:31,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:31,110 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:30:31,111 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:30:31,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:31,114 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:31,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 61 [2019-09-05 11:30:31,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:31,143 INFO L567 ElimStorePlain]: treesize reduction 40, result has 58.3 percent of original size [2019-09-05 11:30:31,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:31,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:56 [2019-09-05 11:30:31,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:31,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:31,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:31,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:31,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:31,358 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:31,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 92 [2019-09-05 11:30:31,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:31,405 INFO L567 ElimStorePlain]: treesize reduction 25, result has 77.1 percent of original size [2019-09-05 11:30:31,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:31,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:31,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:75, output treesize:94 [2019-09-05 11:30:31,662 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:31,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:30:31,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:31,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:31,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:31,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:30:31,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:31,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:31,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 43 [2019-09-05 11:30:31,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 11:30:31,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 11:30:31,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1646, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 11:30:31,736 INFO L87 Difference]: Start difference. First operand 301 states and 371 transitions. Second operand 43 states. [2019-09-05 11:30:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:49,795 INFO L93 Difference]: Finished difference Result 344 states and 418 transitions. [2019-09-05 11:30:49,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 11:30:49,795 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-09-05 11:30:49,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:49,797 INFO L225 Difference]: With dead ends: 344 [2019-09-05 11:30:49,797 INFO L226 Difference]: Without dead ends: 327 [2019-09-05 11:30:49,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=393, Invalid=3897, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 11:30:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-05 11:30:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 314. [2019-09-05 11:30:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-05 11:30:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 385 transitions. [2019-09-05 11:30:49,834 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 385 transitions. Word has length 43 [2019-09-05 11:30:49,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:49,835 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 385 transitions. [2019-09-05 11:30:49,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 11:30:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 385 transitions. [2019-09-05 11:30:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 11:30:49,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:49,836 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:49,836 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1316368837, now seen corresponding path program 1 times [2019-09-05 11:30:49,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:49,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:49,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:49,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:30:49,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:50,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:50,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:50,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:30:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:50,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 11:30:50,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:50,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:50,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:50,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:50,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-05 11:30:50,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:50,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:50,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:50,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-09-05 11:30:50,589 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:30:50,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:50,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:50,592 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:30:50,596 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:50,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 16 [2019-09-05 11:30:50,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:50,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:50,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:50,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2019-09-05 11:30:50,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:50,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:50,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 32 [2019-09-05 11:30:50,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:30:50,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:30:50,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:30:50,672 INFO L87 Difference]: Start difference. First operand 314 states and 385 transitions. Second operand 32 states. [2019-09-05 11:31:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:10,463 INFO L93 Difference]: Finished difference Result 705 states and 866 transitions. [2019-09-05 11:31:10,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-05 11:31:10,464 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2019-09-05 11:31:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:10,467 INFO L225 Difference]: With dead ends: 705 [2019-09-05 11:31:10,467 INFO L226 Difference]: Without dead ends: 568 [2019-09-05 11:31:10,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=495, Invalid=3537, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 11:31:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-05 11:31:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 341. [2019-09-05 11:31:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-05 11:31:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 419 transitions. [2019-09-05 11:31:10,514 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 419 transitions. Word has length 44 [2019-09-05 11:31:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:10,514 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 419 transitions. [2019-09-05 11:31:10,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:31:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 419 transitions. [2019-09-05 11:31:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 11:31:10,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:10,515 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:10,515 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:10,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:10,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2095999155, now seen corresponding path program 2 times [2019-09-05 11:31:10,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:10,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:10,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:10,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:31:10,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:11,090 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:31:11,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:11,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:11,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:31:11,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:31:11,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:31:11,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 11:31:11,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:11,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:11,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:11,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-09-05 11:31:11,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:11,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:11,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:11,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-09-05 11:31:11,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:11,483 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:31:11,484 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:11,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2019-09-05 11:31:11,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:11,510 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-09-05 11:31:11,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:31:11,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:37 [2019-09-05 11:31:11,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:11,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:11,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:11,638 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:11,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-09-05 11:31:11,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:11,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:11,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:31:11,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2019-09-05 11:31:11,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:11,919 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:31:11,921 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:11,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 15 [2019-09-05 11:31:11,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:11,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:11,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:11,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-09-05 11:31:11,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:31:12,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:12,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2019-09-05 11:31:12,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-05 11:31:12,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-05 11:31:12,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1475, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:31:12,017 INFO L87 Difference]: Start difference. First operand 341 states and 419 transitions. Second operand 41 states. [2019-09-05 11:31:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:13,337 INFO L93 Difference]: Finished difference Result 383 states and 465 transitions. [2019-09-05 11:31:13,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 11:31:13,338 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 44 [2019-09-05 11:31:13,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:13,340 INFO L225 Difference]: With dead ends: 383 [2019-09-05 11:31:13,340 INFO L226 Difference]: Without dead ends: 381 [2019-09-05 11:31:13,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=333, Invalid=2973, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 11:31:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-09-05 11:31:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 341. [2019-09-05 11:31:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-05 11:31:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 419 transitions. [2019-09-05 11:31:13,389 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 419 transitions. Word has length 44 [2019-09-05 11:31:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:13,389 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 419 transitions. [2019-09-05 11:31:13,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-05 11:31:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 419 transitions. [2019-09-05 11:31:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-05 11:31:13,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:13,390 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:13,391 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:13,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1588085580, now seen corresponding path program 5 times [2019-09-05 11:31:13,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:13,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:13,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:13,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:13,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 11:31:13,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:13,685 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:13,699 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:31:13,738 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-05 11:31:13,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:31:13,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 11:31:13,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:13,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:13,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 11:31:13,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:13,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:13,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:13,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-09-05 11:31:13,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:14,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:14,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-05 11:31:14,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:14,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:14,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:31:14,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-09-05 11:31:14,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:14,521 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:31:14,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:14,523 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:31:14,531 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:14,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 16 [2019-09-05 11:31:14,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:14,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:14,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:14,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2019-09-05 11:31:14,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:31:14,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:14,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 36 [2019-09-05 11:31:14,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 11:31:14,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 11:31:14,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:31:14,605 INFO L87 Difference]: Start difference. First operand 341 states and 419 transitions. Second operand 36 states. [2019-09-05 11:31:34,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:34,769 INFO L93 Difference]: Finished difference Result 468 states and 568 transitions. [2019-09-05 11:31:34,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:31:34,769 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 47 [2019-09-05 11:31:34,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:34,772 INFO L225 Difference]: With dead ends: 468 [2019-09-05 11:31:34,772 INFO L226 Difference]: Without dead ends: 466 [2019-09-05 11:31:34,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=285, Invalid=2471, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 11:31:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-05 11:31:34,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 385. [2019-09-05 11:31:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-09-05 11:31:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 468 transitions. [2019-09-05 11:31:34,831 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 468 transitions. Word has length 47 [2019-09-05 11:31:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:34,832 INFO L475 AbstractCegarLoop]: Abstraction has 385 states and 468 transitions. [2019-09-05 11:31:34,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 11:31:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 468 transitions. [2019-09-05 11:31:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-05 11:31:34,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:34,833 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:34,833 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:34,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:34,834 INFO L82 PathProgramCache]: Analyzing trace with hash 907149979, now seen corresponding path program 1 times [2019-09-05 11:31:34,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:34,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:34,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:34,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:34,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 11:31:35,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:35,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:35,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:31:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:35,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 11:31:35,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:35,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:35,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:35,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-05 11:31:35,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:35,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:35,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:31:35,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-05 11:31:35,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:35,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:35,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:35,632 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:35,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2019-09-05 11:31:35,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:35,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:35,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:31:35,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:30 [2019-09-05 11:31:35,686 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:35,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:31:35,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:35,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:35,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:35,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:31:35,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 11 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:31:35,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:35,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2019-09-05 11:31:35,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:31:35,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:31:35,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:31:35,774 INFO L87 Difference]: Start difference. First operand 385 states and 468 transitions. Second operand 31 states. [2019-09-05 11:31:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:37,848 INFO L93 Difference]: Finished difference Result 712 states and 877 transitions. [2019-09-05 11:31:37,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-05 11:31:37,849 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 47 [2019-09-05 11:31:37,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:37,853 INFO L225 Difference]: With dead ends: 712 [2019-09-05 11:31:37,854 INFO L226 Difference]: Without dead ends: 591 [2019-09-05 11:31:37,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=502, Invalid=2468, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 11:31:37,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-05 11:31:37,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 437. [2019-09-05 11:31:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-09-05 11:31:37,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 537 transitions. [2019-09-05 11:31:37,935 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 537 transitions. Word has length 47 [2019-09-05 11:31:37,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:37,935 INFO L475 AbstractCegarLoop]: Abstraction has 437 states and 537 transitions. [2019-09-05 11:31:37,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:31:37,935 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 537 transitions. [2019-09-05 11:31:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-05 11:31:37,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:37,937 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:37,937 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:37,937 INFO L82 PathProgramCache]: Analyzing trace with hash -681197923, now seen corresponding path program 2 times [2019-09-05 11:31:37,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:37,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:37,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:37,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:31:37,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-05 11:31:37,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:37,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:31:37,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:38,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:31:38,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:31:38,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:31:38,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:38,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-05 11:31:38,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:38,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-05 11:31:38,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:31:38,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:31:38,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:31:38,032 INFO L87 Difference]: Start difference. First operand 437 states and 537 transitions. Second operand 6 states. [2019-09-05 11:31:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:38,144 INFO L93 Difference]: Finished difference Result 615 states and 758 transitions. [2019-09-05 11:31:38,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:31:38,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-09-05 11:31:38,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:38,147 INFO L225 Difference]: With dead ends: 615 [2019-09-05 11:31:38,147 INFO L226 Difference]: Without dead ends: 476 [2019-09-05 11:31:38,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:31:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-09-05 11:31:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 423. [2019-09-05 11:31:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-05 11:31:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 513 transitions. [2019-09-05 11:31:38,213 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 513 transitions. Word has length 47 [2019-09-05 11:31:38,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:38,213 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 513 transitions. [2019-09-05 11:31:38,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:31:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 513 transitions. [2019-09-05 11:31:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-05 11:31:38,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:38,215 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:38,215 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:38,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:38,215 INFO L82 PathProgramCache]: Analyzing trace with hash 595421449, now seen corresponding path program 3 times [2019-09-05 11:31:38,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:38,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:38,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:39,131 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:31:39,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:39,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:31:39,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:39,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-05 11:31:39,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:31:39,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 11:31:39,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:39,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:39,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:39,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-09-05 11:31:39,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:39,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:39,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:39,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-09-05 11:31:39,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:39,296 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:31:39,297 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:39,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2019-09-05 11:31:39,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:39,319 INFO L567 ElimStorePlain]: treesize reduction 12, result has 74.5 percent of original size [2019-09-05 11:31:39,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:39,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2019-09-05 11:31:39,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:39,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:39,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:39,394 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:39,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-09-05 11:31:39,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:39,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:39,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:31:39,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-09-05 11:31:39,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:39,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:39,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:39,518 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:39,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-05 11:31:39,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:39,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:39,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:39,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:22 [2019-09-05 11:31:39,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:39,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:39,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:39,638 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:39,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 34 [2019-09-05 11:31:39,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:39,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:39,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:39,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:19 [2019-09-05 11:31:39,663 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:39,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-05 11:31:39,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:39,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:39,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:39,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-05 11:31:39,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 5 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 11:31:39,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:39,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 36 [2019-09-05 11:31:39,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 11:31:39,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 11:31:39,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:31:39,715 INFO L87 Difference]: Start difference. First operand 423 states and 513 transitions. Second operand 36 states. [2019-09-05 11:31:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:42,492 INFO L93 Difference]: Finished difference Result 669 states and 813 transitions. [2019-09-05 11:31:42,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-05 11:31:42,493 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 47 [2019-09-05 11:31:42,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:42,496 INFO L225 Difference]: With dead ends: 669 [2019-09-05 11:31:42,496 INFO L226 Difference]: Without dead ends: 585 [2019-09-05 11:31:42,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1714 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=607, Invalid=4085, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 11:31:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-05 11:31:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 436. [2019-09-05 11:31:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-09-05 11:31:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 530 transitions. [2019-09-05 11:31:42,562 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 530 transitions. Word has length 47 [2019-09-05 11:31:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:42,562 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 530 transitions. [2019-09-05 11:31:42,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 11:31:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 530 transitions. [2019-09-05 11:31:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 11:31:42,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:42,564 INFO L399 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:42,564 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:42,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:42,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1128146500, now seen corresponding path program 2 times [2019-09-05 11:31:42,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:42,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:42,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:42,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:42,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:31:43,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:43,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:43,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:31:43,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:31:43,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:31:43,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-05 11:31:43,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:43,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:43,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:43,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-09-05 11:31:43,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:43,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:43,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:43,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-09-05 11:31:44,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:44,059 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:31:44,062 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:44,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2019-09-05 11:31:44,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:44,080 INFO L567 ElimStorePlain]: treesize reduction 12, result has 74.5 percent of original size [2019-09-05 11:31:44,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:44,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2019-09-05 11:31:44,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:44,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:44,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:44,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:44,184 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:31:44,185 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:44,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2019-09-05 11:31:44,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:44,206 INFO L567 ElimStorePlain]: treesize reduction 18, result has 72.7 percent of original size [2019-09-05 11:31:44,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:44,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:48 [2019-09-05 11:31:44,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:44,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:44,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:44,444 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:31:44,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:44,446 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:31:44,450 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:44,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 65 [2019-09-05 11:31:44,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:44,486 INFO L567 ElimStorePlain]: treesize reduction 20, result has 79.4 percent of original size [2019-09-05 11:31:44,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:31:44,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:77 [2019-09-05 11:31:44,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:44,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:44,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:44,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:44,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:44,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:44,738 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:44,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 78 treesize of output 159 [2019-09-05 11:31:44,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:44,799 INFO L567 ElimStorePlain]: treesize reduction 60, result has 63.6 percent of original size [2019-09-05 11:31:44,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:44,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-05 11:31:44,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:96, output treesize:137 [2019-09-05 11:31:45,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:45,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-05 11:31:45,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:45,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:45,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:45,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-05 11:31:45,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:31:45,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:45,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 46 [2019-09-05 11:31:45,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 11:31:45,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 11:31:45,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1862, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 11:31:45,131 INFO L87 Difference]: Start difference. First operand 436 states and 530 transitions. Second operand 46 states. [2019-09-05 11:31:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:47,625 INFO L93 Difference]: Finished difference Result 460 states and 554 transitions. [2019-09-05 11:31:47,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 11:31:47,625 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 48 [2019-09-05 11:31:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:47,627 INFO L225 Difference]: With dead ends: 460 [2019-09-05 11:31:47,627 INFO L226 Difference]: Without dead ends: 443 [2019-09-05 11:31:47,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=437, Invalid=4119, Unknown=0, NotChecked=0, Total=4556 [2019-09-05 11:31:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-05 11:31:47,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 403. [2019-09-05 11:31:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-05 11:31:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 492 transitions. [2019-09-05 11:31:47,686 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 492 transitions. Word has length 48 [2019-09-05 11:31:47,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:47,687 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 492 transitions. [2019-09-05 11:31:47,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 11:31:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 492 transitions. [2019-09-05 11:31:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 11:31:47,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:47,688 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:47,688 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:47,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:47,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1834674623, now seen corresponding path program 1 times [2019-09-05 11:31:47,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:47,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:47,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:47,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:47,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 11:31:47,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:47,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:47,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:31:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:47,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 11:31:47,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:48,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:48,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:48,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-09-05 11:31:48,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:48,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:48,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:48,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-09-05 11:31:48,373 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:31:48,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:48,375 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:48,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 44 [2019-09-05 11:31:48,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:48,402 INFO L567 ElimStorePlain]: treesize reduction 14, result has 74.5 percent of original size [2019-09-05 11:31:48,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:31:48,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:38 [2019-09-05 11:31:48,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:48,700 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:31:48,701 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:31:48,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:48,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 18 [2019-09-05 11:31:48,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:48,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:48,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:48,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:5 [2019-09-05 11:31:48,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:31:48,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:48,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 37 [2019-09-05 11:31:48,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 11:31:48,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 11:31:48,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 11:31:48,787 INFO L87 Difference]: Start difference. First operand 403 states and 492 transitions. Second operand 37 states. [2019-09-05 11:31:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:53,261 INFO L93 Difference]: Finished difference Result 596 states and 723 transitions. [2019-09-05 11:31:53,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-05 11:31:53,261 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 49 [2019-09-05 11:31:53,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:53,264 INFO L225 Difference]: With dead ends: 596 [2019-09-05 11:31:53,264 INFO L226 Difference]: Without dead ends: 594 [2019-09-05 11:31:53,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4184 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1243, Invalid=10967, Unknown=0, NotChecked=0, Total=12210 [2019-09-05 11:31:53,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-05 11:31:53,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 415. [2019-09-05 11:31:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-05 11:31:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 507 transitions. [2019-09-05 11:31:53,331 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 507 transitions. Word has length 49 [2019-09-05 11:31:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:53,332 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 507 transitions. [2019-09-05 11:31:53,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 11:31:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 507 transitions. [2019-09-05 11:31:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 11:31:53,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:53,333 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:53,333 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:53,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:53,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1831939583, now seen corresponding path program 3 times [2019-09-05 11:31:53,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:53,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:53,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:53,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:31:53,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:54,734 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:31:54,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:54,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:54,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:31:54,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 11:31:54,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:31:54,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 11:31:54,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:54,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:54,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:54,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-05 11:31:54,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:54,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:54,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:54,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-09-05 11:31:54,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2019-09-05 11:31:54,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:54,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:54,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:54,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:54,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:54,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:54,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:54,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2019-09-05 11:31:54,999 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:55,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:55,004 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:55,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:55,015 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-09-05 11:31:55,015 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:50 [2019-09-05 11:31:55,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:55,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:55,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:55,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:55,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:55,241 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:55,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 60 treesize of output 184 [2019-09-05 11:31:55,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:55,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:55,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:55,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:55,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:55,391 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2019-09-05 11:31:55,391 INFO L567 ElimStorePlain]: treesize reduction 329, result has 21.1 percent of original size [2019-09-05 11:31:55,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:55,393 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-09-05 11:31:55,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:87 [2019-09-05 11:31:55,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:55,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:55,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:55,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:55,950 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:31:55,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:55,953 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:55,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 53 [2019-09-05 11:31:55,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:55,978 INFO L567 ElimStorePlain]: treesize reduction 7, result has 87.7 percent of original size [2019-09-05 11:31:55,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:31:55,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:38 [2019-09-05 11:31:56,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:56,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:56,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:56,082 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:56,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-05 11:31:56,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:56,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:56,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:56,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-09-05 11:31:56,322 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:56,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:31:56,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:56,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:56,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:56,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:31:56,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:31:56,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:56,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 45 [2019-09-05 11:31:56,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-05 11:31:56,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-05 11:31:56,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1784, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 11:31:56,422 INFO L87 Difference]: Start difference. First operand 415 states and 507 transitions. Second operand 45 states. [2019-09-05 11:32:13,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:32:13,108 INFO L93 Difference]: Finished difference Result 521 states and 623 transitions. [2019-09-05 11:32:13,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-05 11:32:13,108 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 49 [2019-09-05 11:32:13,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:32:13,110 INFO L225 Difference]: With dead ends: 521 [2019-09-05 11:32:13,110 INFO L226 Difference]: Without dead ends: 519 [2019-09-05 11:32:13,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=482, Invalid=4630, Unknown=0, NotChecked=0, Total=5112 [2019-09-05 11:32:13,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-09-05 11:32:13,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 449. [2019-09-05 11:32:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-05 11:32:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 546 transitions. [2019-09-05 11:32:13,180 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 546 transitions. Word has length 49 [2019-09-05 11:32:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:32:13,180 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 546 transitions. [2019-09-05 11:32:13,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-05 11:32:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 546 transitions. [2019-09-05 11:32:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 11:32:13,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:32:13,182 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:32:13,182 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:32:13,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:32:13,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1264339310, now seen corresponding path program 2 times [2019-09-05 11:32:13,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:32:13,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:32:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:13,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:32:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:32:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:32:13,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:32:13,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:32:13,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:32:13,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:32:13,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:32:13,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 11:32:13,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:32:13,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:13,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:13,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-05 11:32:13,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:13,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:13,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:13,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-09-05 11:32:13,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:13,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:13,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:13,941 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:13,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2019-09-05 11:32:13,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:13,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:13,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:13,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-09-05 11:32:14,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:14,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:14,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:14,048 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:14,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2019-09-05 11:32:14,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:14,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:14,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:14,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-05 11:32:14,282 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:14,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:32:14,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:14,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:14,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:14,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:32:14,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:32:14,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:32:14,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2019-09-05 11:32:14,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 11:32:14,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 11:32:14,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1339, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 11:32:14,346 INFO L87 Difference]: Start difference. First operand 449 states and 546 transitions. Second operand 39 states. [2019-09-05 11:32:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:32:38,038 INFO L93 Difference]: Finished difference Result 611 states and 732 transitions. [2019-09-05 11:32:38,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 11:32:38,039 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 50 [2019-09-05 11:32:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:32:38,041 INFO L225 Difference]: With dead ends: 611 [2019-09-05 11:32:38,042 INFO L226 Difference]: Without dead ends: 609 [2019-09-05 11:32:38,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=416, Invalid=3744, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 11:32:38,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-09-05 11:32:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 463. [2019-09-05 11:32:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-05 11:32:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 564 transitions. [2019-09-05 11:32:38,131 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 564 transitions. Word has length 50 [2019-09-05 11:32:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:32:38,132 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 564 transitions. [2019-09-05 11:32:38,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 11:32:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 564 transitions. [2019-09-05 11:32:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 11:32:38,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:32:38,133 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:32:38,134 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:32:38,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:32:38,134 INFO L82 PathProgramCache]: Analyzing trace with hash -891213096, now seen corresponding path program 3 times [2019-09-05 11:32:38,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:32:38,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:32:38,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:38,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:32:38,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:32:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:32:38,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:32:38,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:32:38,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:32:38,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 11:32:38,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:32:38,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 11:32:38,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:32:38,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:38,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:38,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-09-05 11:32:38,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:38,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:38,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:38,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2019-09-05 11:32:38,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:38,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:38,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:38,847 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:38,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2019-09-05 11:32:38,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:38,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:38,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:38,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-09-05 11:32:39,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:39,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:32:39,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:39,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:39,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:39,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:32:39,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:32:39,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:32:39,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 39 [2019-09-05 11:32:39,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 11:32:39,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 11:32:39,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 11:32:39,192 INFO L87 Difference]: Start difference. First operand 463 states and 564 transitions. Second operand 39 states. [2019-09-05 11:33:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:07,330 INFO L93 Difference]: Finished difference Result 766 states and 930 transitions. [2019-09-05 11:33:07,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-05 11:33:07,330 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 50 [2019-09-05 11:33:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:07,334 INFO L225 Difference]: With dead ends: 766 [2019-09-05 11:33:07,334 INFO L226 Difference]: Without dead ends: 764 [2019-09-05 11:33:07,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=496, Invalid=3536, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 11:33:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-05 11:33:07,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 512. [2019-09-05 11:33:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-05 11:33:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 626 transitions. [2019-09-05 11:33:07,423 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 626 transitions. Word has length 50 [2019-09-05 11:33:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:07,423 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 626 transitions. [2019-09-05 11:33:07,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 11:33:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 626 transitions. [2019-09-05 11:33:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 11:33:07,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:07,425 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:07,425 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:07,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:07,425 INFO L82 PathProgramCache]: Analyzing trace with hash -823375264, now seen corresponding path program 3 times [2019-09-05 11:33:07,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:07,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:07,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:07,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:33:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:33:08,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:33:08,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:33:08,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:33:08,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 11:33:08,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:33:08,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-05 11:33:08,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:33:08,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:33:08,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:08,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-09-05 11:33:08,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:08,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:08,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:08,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-09-05 11:33:08,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:08,330 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:08,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 32 [2019-09-05 11:33:08,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:08,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:08,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:08,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2019-09-05 11:33:08,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:08,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:08,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:08,459 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:08,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-09-05 11:33:08,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:08,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:08,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:08,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:24 [2019-09-05 11:33:08,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:08,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:08,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:08,546 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:08,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-09-05 11:33:08,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:08,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:08,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:08,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2019-09-05 11:33:08,778 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:08,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-05 11:33:08,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:08,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:08,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:08,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-05 11:33:08,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:33:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:33:08,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:33:08,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-09-05 11:33:08,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 11:33:08,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 11:33:08,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1636, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 11:33:08,870 INFO L87 Difference]: Start difference. First operand 512 states and 626 transitions. Second operand 43 states. [2019-09-05 11:33:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:10,995 INFO L93 Difference]: Finished difference Result 612 states and 739 transitions. [2019-09-05 11:33:10,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 11:33:10,995 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 50 [2019-09-05 11:33:10,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:10,998 INFO L225 Difference]: With dead ends: 612 [2019-09-05 11:33:10,998 INFO L226 Difference]: Without dead ends: 610 [2019-09-05 11:33:10,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=556, Invalid=4994, Unknown=0, NotChecked=0, Total=5550 [2019-09-05 11:33:10,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-09-05 11:33:11,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 545. [2019-09-05 11:33:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-05 11:33:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 664 transitions. [2019-09-05 11:33:11,099 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 664 transitions. Word has length 50 [2019-09-05 11:33:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:11,100 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 664 transitions. [2019-09-05 11:33:11,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 11:33:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 664 transitions. [2019-09-05 11:33:11,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-05 11:33:11,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:11,102 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:11,102 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:11,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1007295364, now seen corresponding path program 4 times [2019-09-05 11:33:11,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:11,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:11,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:11,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:33:11,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 11:33:11,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:33:11,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:33:11,432 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:33:11,466 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:33:11,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:33:11,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 11:33:11,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:33:11,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:11,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-09-05 11:33:11,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:11,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:11,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:11,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-05 11:33:11,867 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:11,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:33:11,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:11,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:11,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:11,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:33:11,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:33:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:33:11,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:33:11,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2019-09-05 11:33:11,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:33:11,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:33:11,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:33:11,927 INFO L87 Difference]: Start difference. First operand 545 states and 664 transitions. Second operand 29 states. [2019-09-05 11:33:30,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:30,926 INFO L93 Difference]: Finished difference Result 681 states and 823 transitions. [2019-09-05 11:33:30,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 11:33:30,926 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-09-05 11:33:30,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:30,929 INFO L225 Difference]: With dead ends: 681 [2019-09-05 11:33:30,929 INFO L226 Difference]: Without dead ends: 679 [2019-09-05 11:33:30,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=1599, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 11:33:30,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-09-05 11:33:31,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 554. [2019-09-05 11:33:31,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-09-05 11:33:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 676 transitions. [2019-09-05 11:33:31,028 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 676 transitions. Word has length 52 [2019-09-05 11:33:31,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:31,028 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 676 transitions. [2019-09-05 11:33:31,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:33:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 676 transitions. [2019-09-05 11:33:31,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-05 11:33:31,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:31,030 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:31,031 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:31,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:31,031 INFO L82 PathProgramCache]: Analyzing trace with hash 745072839, now seen corresponding path program 6 times [2019-09-05 11:33:31,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:31,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:31,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:31,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:33:31,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 11:33:31,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:33:31,512 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:33:31,529 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:33:31,567 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-05 11:33:31,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:33:31,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 11:33:31,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:33:31,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 11:33:31,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:31,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:31,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:31,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-09-05 11:33:31,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:33:31,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:31,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-05 11:33:31,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:31,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:31,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:31,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-09-05 11:33:31,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:31,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:31,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:31,891 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:31,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-05 11:33:31,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:31,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:31,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:31,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-09-05 11:33:32,219 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:32,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:33:32,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:32,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:32,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:32,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:33:32,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:33:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:33:32,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:33:32,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2019-09-05 11:33:32,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 11:33:32,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 11:33:32,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1275, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:33:32,282 INFO L87 Difference]: Start difference. First operand 554 states and 676 transitions. Second operand 38 states. [2019-09-05 11:33:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:56,308 INFO L93 Difference]: Finished difference Result 756 states and 910 transitions. [2019-09-05 11:33:56,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 11:33:56,308 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 53 [2019-09-05 11:33:56,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:56,311 INFO L225 Difference]: With dead ends: 756 [2019-09-05 11:33:56,311 INFO L226 Difference]: Without dead ends: 754 [2019-09-05 11:33:56,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=444, Invalid=3588, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 11:33:56,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-09-05 11:33:56,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 614. [2019-09-05 11:33:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-05 11:33:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 749 transitions. [2019-09-05 11:33:56,472 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 749 transitions. Word has length 53 [2019-09-05 11:33:56,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:56,472 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 749 transitions. [2019-09-05 11:33:56,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 11:33:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 749 transitions. [2019-09-05 11:33:56,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-05 11:33:56,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:56,474 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:56,474 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:56,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:56,474 INFO L82 PathProgramCache]: Analyzing trace with hash -175042453, now seen corresponding path program 7 times [2019-09-05 11:33:56,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:56,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:56,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:56,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:33:56,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 11:33:56,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:33:56,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:33:56,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:33:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:56,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 11:33:56,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:33:56,749 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 11:33:56,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:33:56,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2019-09-05 11:33:56,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 11:33:56,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 11:33:56,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:33:56,753 INFO L87 Difference]: Start difference. First operand 614 states and 749 transitions. Second operand 16 states. [2019-09-05 11:33:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:57,097 INFO L93 Difference]: Finished difference Result 865 states and 1044 transitions. [2019-09-05 11:33:57,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:33:57,097 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-09-05 11:33:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:57,099 INFO L225 Difference]: With dead ends: 865 [2019-09-05 11:33:57,100 INFO L226 Difference]: Without dead ends: 815 [2019-09-05 11:33:57,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:33:57,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2019-09-05 11:33:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 630. [2019-09-05 11:33:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-05 11:33:57,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 761 transitions. [2019-09-05 11:33:57,197 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 761 transitions. Word has length 55 [2019-09-05 11:33:57,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:57,197 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 761 transitions. [2019-09-05 11:33:57,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 11:33:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 761 transitions. [2019-09-05 11:33:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-05 11:33:57,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:57,199 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:57,199 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:57,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:57,200 INFO L82 PathProgramCache]: Analyzing trace with hash 892264603, now seen corresponding path program 3 times [2019-09-05 11:33:57,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:57,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:57,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:57,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:33:57,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 43 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:33:57,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:33:57,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:33:57,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:33:57,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-05 11:33:57,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:33:57,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 11:33:57,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:33:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 43 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:33:57,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:33:57,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-05 11:33:57,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:33:57,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:33:57,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:33:57,336 INFO L87 Difference]: Start difference. First operand 630 states and 761 transitions. Second operand 9 states. [2019-09-05 11:33:57,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:57,662 INFO L93 Difference]: Finished difference Result 1128 states and 1395 transitions. [2019-09-05 11:33:57,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 11:33:57,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-09-05 11:33:57,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:57,665 INFO L225 Difference]: With dead ends: 1128 [2019-09-05 11:33:57,665 INFO L226 Difference]: Without dead ends: 943 [2019-09-05 11:33:57,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:33:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-09-05 11:33:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 732. [2019-09-05 11:33:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-09-05 11:33:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 891 transitions. [2019-09-05 11:33:57,820 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 891 transitions. Word has length 52 [2019-09-05 11:33:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:57,821 INFO L475 AbstractCegarLoop]: Abstraction has 732 states and 891 transitions. [2019-09-05 11:33:57,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:33:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 891 transitions. [2019-09-05 11:33:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-05 11:33:57,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:57,825 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:57,825 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:57,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:57,826 INFO L82 PathProgramCache]: Analyzing trace with hash 441671596, now seen corresponding path program 4 times [2019-09-05 11:33:57,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:57,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:57,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:57,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:33:57,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:33:58,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:33:58,716 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:33:58,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:33:58,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:33:58,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:33:58,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 11:33:58,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:33:58,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:33:58,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:58,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-09-05 11:33:58,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:58,833 INFO L567 ElimStorePlain]: treesize reduction 7, result has 86.3 percent of original size [2019-09-05 11:33:58,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:58,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:41 [2019-09-05 11:33:58,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:58,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:58,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:58,927 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:58,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-05 11:33:58,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:58,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:58,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:58,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-05 11:33:59,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:59,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:59,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:59,080 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:59,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-05 11:33:59,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:59,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:59,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:59,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-05 11:33:59,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:59,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:59,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:59,248 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:59,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-05 11:33:59,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:59,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:59,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:59,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-05 11:33:59,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:59,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:59,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:33:59,530 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:59,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2019-09-05 11:33:59,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:59,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:59,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:33:59,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:26 [2019-09-05 11:33:59,628 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:59,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:33:59,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:33:59,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:33:59,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:33:59,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:33:59,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:33:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:33:59,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:33:59,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 36 [2019-09-05 11:33:59,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 11:33:59,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 11:33:59,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1101, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:33:59,732 INFO L87 Difference]: Start difference. First operand 732 states and 891 transitions. Second operand 36 states. [2019-09-05 11:34:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:34:03,110 INFO L93 Difference]: Finished difference Result 1151 states and 1418 transitions. [2019-09-05 11:34:03,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-05 11:34:03,112 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 53 [2019-09-05 11:34:03,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:34:03,116 INFO L225 Difference]: With dead ends: 1151 [2019-09-05 11:34:03,116 INFO L226 Difference]: Without dead ends: 1091 [2019-09-05 11:34:03,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 35 SyntacticMatches, 9 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=702, Invalid=4410, Unknown=0, NotChecked=0, Total=5112 [2019-09-05 11:34:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-09-05 11:34:03,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 797. [2019-09-05 11:34:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-09-05 11:34:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 971 transitions. [2019-09-05 11:34:03,260 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 971 transitions. Word has length 53 [2019-09-05 11:34:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:34:03,260 INFO L475 AbstractCegarLoop]: Abstraction has 797 states and 971 transitions. [2019-09-05 11:34:03,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 11:34:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 971 transitions. [2019-09-05 11:34:03,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 11:34:03,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:34:03,262 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:34:03,263 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:34:03,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:34:03,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1983848057, now seen corresponding path program 1 times [2019-09-05 11:34:03,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:34:03,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:34:03,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:34:03,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:34:03,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:34:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:34:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 11 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:34:04,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:34:04,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:34:04,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:34:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:34:04,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 11:34:04,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:34:04,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:34:04,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:04,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-05 11:34:04,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:04,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:04,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:34:04,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-05 11:34:04,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-09-05 11:34:04,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:04,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:04,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:04,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:04,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:04,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:04,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:04,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2019-09-05 11:34:04,760 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:04,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:04,766 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:34:04,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:04,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:34:04,776 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:23 [2019-09-05 11:34:04,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:04,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:04,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:04,956 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:34:04,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:04,959 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:04,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 49 [2019-09-05 11:34:04,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:04,986 INFO L567 ElimStorePlain]: treesize reduction 23, result has 68.5 percent of original size [2019-09-05 11:34:04,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-09-05 11:34:04,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:45 [2019-09-05 11:34:05,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:05,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:05,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:05,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:05,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:05,153 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:34:05,154 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:05,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 52 [2019-09-05 11:34:05,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:05,176 INFO L567 ElimStorePlain]: treesize reduction 18, result has 71.9 percent of original size [2019-09-05 11:34:05,177 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-09-05 11:34:05,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:46 [2019-09-05 11:34:05,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:05,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:05,361 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:34:05,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:05,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:05,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:05,392 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:05,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 128 [2019-09-05 11:34:05,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:05,439 INFO L567 ElimStorePlain]: treesize reduction 75, result has 48.6 percent of original size [2019-09-05 11:34:05,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:34:05,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:34:05,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:92 [2019-09-05 11:34:05,716 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:05,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:34:05,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:05,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:05,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:34:05,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:34:05,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:34:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 9 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:34:05,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:34:05,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 48 [2019-09-05 11:34:05,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-05 11:34:05,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-05 11:34:05,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1957, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 11:34:05,789 INFO L87 Difference]: Start difference. First operand 797 states and 971 transitions. Second operand 48 states. [2019-09-05 11:34:43,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:34:43,458 INFO L93 Difference]: Finished difference Result 1017 states and 1233 transitions. [2019-09-05 11:34:43,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-05 11:34:43,458 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 54 [2019-09-05 11:34:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:34:43,463 INFO L225 Difference]: With dead ends: 1017 [2019-09-05 11:34:43,463 INFO L226 Difference]: Without dead ends: 1015 [2019-09-05 11:34:43,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 25 SyntacticMatches, 11 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3155 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1161, Invalid=7029, Unknown=0, NotChecked=0, Total=8190 [2019-09-05 11:34:43,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-09-05 11:34:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 857. [2019-09-05 11:34:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-09-05 11:34:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1038 transitions. [2019-09-05 11:34:43,592 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1038 transitions. Word has length 54 [2019-09-05 11:34:43,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:34:43,592 INFO L475 AbstractCegarLoop]: Abstraction has 857 states and 1038 transitions. [2019-09-05 11:34:43,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-05 11:34:43,593 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1038 transitions. [2019-09-05 11:34:43,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 11:34:43,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:34:43,595 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:34:43,595 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:34:43,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:34:43,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2098824215, now seen corresponding path program 4 times [2019-09-05 11:34:43,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:34:43,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:34:43,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:34:43,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:34:43,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:34:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:34:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:34:45,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:34:45,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:34:45,148 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:34:45,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:34:45,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:34:45,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 11:34:45,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:34:45,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:34:45,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:45,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-09-05 11:34:45,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:45,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:45,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:34:45,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-09-05 11:34:45,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:45,574 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:45,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2019-09-05 11:34:45,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:45,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:45,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:34:45,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:41 [2019-09-05 11:34:45,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:45,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:45,689 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:45,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 144 [2019-09-05 11:34:45,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:34:45,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:34:45,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:34:45,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:34:45,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:34:45,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:34:45,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:34:45,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:45,801 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2019-09-05 11:34:45,801 INFO L567 ElimStorePlain]: treesize reduction 220, result has 25.2 percent of original size [2019-09-05 11:34:45,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:34:45,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:73 [2019-09-05 11:34:46,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:46,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:46,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:46,087 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:34:46,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:46,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:46,089 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:34:46,093 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:46,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 69 [2019-09-05 11:34:46,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:46,126 INFO L567 ElimStorePlain]: treesize reduction 37, result has 59.3 percent of original size [2019-09-05 11:34:46,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:34:46,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:54 [2019-09-05 11:34:46,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:46,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:46,242 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:34:46,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:46,245 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:46,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 55 [2019-09-05 11:34:46,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:46,276 INFO L567 ElimStorePlain]: treesize reduction 7, result has 88.3 percent of original size [2019-09-05 11:34:46,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:34:46,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:41 [2019-09-05 11:34:46,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:46,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:46,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:46,407 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:46,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2019-09-05 11:34:46,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:46,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:46,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:34:46,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2019-09-05 11:34:46,670 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:46,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-05 11:34:46,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:46,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:46,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:34:46,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-05 11:34:46,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:34:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:34:46,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:34:46,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 51 [2019-09-05 11:34:46,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-05 11:34:46,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-05 11:34:46,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2322, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 11:34:46,758 INFO L87 Difference]: Start difference. First operand 857 states and 1038 transitions. Second operand 51 states. [2019-09-05 11:34:49,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:34:49,746 INFO L93 Difference]: Finished difference Result 915 states and 1100 transitions. [2019-09-05 11:34:49,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 11:34:49,746 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 54 [2019-09-05 11:34:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:34:49,749 INFO L225 Difference]: With dead ends: 915 [2019-09-05 11:34:49,749 INFO L226 Difference]: Without dead ends: 902 [2019-09-05 11:34:49,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2150 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=518, Invalid=5644, Unknown=0, NotChecked=0, Total=6162 [2019-09-05 11:34:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-09-05 11:34:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 788. [2019-09-05 11:34:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-09-05 11:34:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 960 transitions. [2019-09-05 11:34:49,871 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 960 transitions. Word has length 54 [2019-09-05 11:34:49,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:34:49,871 INFO L475 AbstractCegarLoop]: Abstraction has 788 states and 960 transitions. [2019-09-05 11:34:49,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-05 11:34:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 960 transitions. [2019-09-05 11:34:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-05 11:34:49,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:34:49,873 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:34:49,874 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:34:49,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:34:49,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2049125808, now seen corresponding path program 5 times [2019-09-05 11:34:49,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:34:49,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:34:49,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:34:49,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:34:49,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:34:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:34:50,291 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:34:50,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:34:50,292 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:34:50,319 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:34:50,370 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-05 11:34:50,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:34:50,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 11:34:50,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:34:50,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 11:34:50,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:50,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:50,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:34:50,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-09-05 11:34:50,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-09-05 11:34:50,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:50,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:50,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:34:50,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:10 [2019-09-05 11:34:50,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-09-05 11:34:50,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:50,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:50,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:34:50,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:10 [2019-09-05 11:34:50,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:34:50,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:50,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-05 11:34:50,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:50,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:50,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:34:50,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-09-05 11:34:51,211 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:34:51,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:51,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:34:51,213 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:34:51,216 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:51,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 16 [2019-09-05 11:34:51,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:34:51,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:34:51,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:34:51,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2019-09-05 11:34:51,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:34:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:34:51,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:34:51,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26] total 42 [2019-09-05 11:34:51,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-05 11:34:51,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-05 11:34:51,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1593, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 11:34:51,286 INFO L87 Difference]: Start difference. First operand 788 states and 960 transitions. Second operand 42 states. [2019-09-05 11:35:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:35:28,586 INFO L93 Difference]: Finished difference Result 1331 states and 1617 transitions. [2019-09-05 11:35:28,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-05 11:35:28,586 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 55 [2019-09-05 11:35:28,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:35:28,590 INFO L225 Difference]: With dead ends: 1331 [2019-09-05 11:35:28,590 INFO L226 Difference]: Without dead ends: 1174 [2019-09-05 11:35:28,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2955 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=743, Invalid=8569, Unknown=0, NotChecked=0, Total=9312 [2019-09-05 11:35:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-09-05 11:35:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 829. [2019-09-05 11:35:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-05 11:35:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1003 transitions. [2019-09-05 11:35:28,734 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1003 transitions. Word has length 55 [2019-09-05 11:35:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:35:28,734 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1003 transitions. [2019-09-05 11:35:28,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-05 11:35:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1003 transitions. [2019-09-05 11:35:28,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-05 11:35:28,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:35:28,736 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:35:28,736 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:35:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:35:28,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1811316562, now seen corresponding path program 2 times [2019-09-05 11:35:28,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:35:28,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:35:28,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:28,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:35:28,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:35:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 11:35:29,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:35:29,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:35:29,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:35:29,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:35:29,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:35:29,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 11:35:29,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:35:29,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:29,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:29,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-09-05 11:35:29,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:29,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:29,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:29,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:49 [2019-09-05 11:35:29,729 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:29,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:29,732 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:29,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2019-09-05 11:35:29,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:29,768 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-09-05 11:35:29,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:35:29,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:73, output treesize:43 [2019-09-05 11:35:30,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:30,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:30,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:30,019 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:30,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2019-09-05 11:35:30,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:30,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:30,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:35:30,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:38 [2019-09-05 11:35:30,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:30,506 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:30,506 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:30,511 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:30,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 18 [2019-09-05 11:35:30,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:30,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:30,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:30,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:5 [2019-09-05 11:35:30,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:35:30,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:35:30,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26] total 43 [2019-09-05 11:35:30,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 11:35:30,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 11:35:30,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1626, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 11:35:30,594 INFO L87 Difference]: Start difference. First operand 829 states and 1003 transitions. Second operand 43 states. [2019-09-05 11:35:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:35:35,505 INFO L93 Difference]: Finished difference Result 1127 states and 1364 transitions. [2019-09-05 11:35:35,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-05 11:35:35,506 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 55 [2019-09-05 11:35:35,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:35:35,511 INFO L225 Difference]: With dead ends: 1127 [2019-09-05 11:35:35,511 INFO L226 Difference]: Without dead ends: 1036 [2019-09-05 11:35:35,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3222 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1018, Invalid=9082, Unknown=0, NotChecked=0, Total=10100 [2019-09-05 11:35:35,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-09-05 11:35:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 860. [2019-09-05 11:35:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-09-05 11:35:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1037 transitions. [2019-09-05 11:35:35,663 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1037 transitions. Word has length 55 [2019-09-05 11:35:35,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:35:35,664 INFO L475 AbstractCegarLoop]: Abstraction has 860 states and 1037 transitions. [2019-09-05 11:35:35,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 11:35:35,664 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1037 transitions. [2019-09-05 11:35:35,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 11:35:35,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:35:35,666 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:35:35,666 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:35:35,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:35:35,666 INFO L82 PathProgramCache]: Analyzing trace with hash 402369951, now seen corresponding path program 6 times [2019-09-05 11:35:35,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:35:35,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:35:35,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:35,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:35:35,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:35:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:35:36,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:35:36,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:35:36,356 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:35:36,397 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-05 11:35:36,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:35:36,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 11:35:36,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:35:36,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 11:35:36,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:36,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:36,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:36,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-09-05 11:35:36,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:36,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:36,603 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:36,604 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:36,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2019-09-05 11:35:36,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:36,617 INFO L567 ElimStorePlain]: treesize reduction 19, result has 58.7 percent of original size [2019-09-05 11:35:36,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:36,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:27 [2019-09-05 11:35:36,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:36,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:36,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:36,732 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:36,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2019-09-05 11:35:36,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:36,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:36,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:36,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:28 [2019-09-05 11:35:36,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:36,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:36,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:36,828 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:36,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2019-09-05 11:35:36,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:36,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:36,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:36,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-09-05 11:35:36,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:36,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:36,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:36,971 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:36,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-05 11:35:36,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:36,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:36,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:36,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-09-05 11:35:37,239 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:37,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-05 11:35:37,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:37,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:37,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:37,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-05 11:35:37,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:35:37,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:35:37,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2019-09-05 11:35:37,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-05 11:35:37,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-05 11:35:37,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1783, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 11:35:37,308 INFO L87 Difference]: Start difference. First operand 860 states and 1037 transitions. Second operand 45 states. [2019-09-05 11:36:06,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:06,089 INFO L93 Difference]: Finished difference Result 1093 states and 1310 transitions. [2019-09-05 11:36:06,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 11:36:06,089 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 56 [2019-09-05 11:36:06,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:06,093 INFO L225 Difference]: With dead ends: 1093 [2019-09-05 11:36:06,093 INFO L226 Difference]: Without dead ends: 1091 [2019-09-05 11:36:06,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=713, Invalid=4987, Unknown=0, NotChecked=0, Total=5700 [2019-09-05 11:36:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-09-05 11:36:06,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 909. [2019-09-05 11:36:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-05 11:36:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1098 transitions. [2019-09-05 11:36:06,283 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1098 transitions. Word has length 56 [2019-09-05 11:36:06,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:06,284 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1098 transitions. [2019-09-05 11:36:06,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-05 11:36:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1098 transitions. [2019-09-05 11:36:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-05 11:36:06,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:06,285 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:06,285 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:06,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:06,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1963459190, now seen corresponding path program 3 times [2019-09-05 11:36:06,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:06,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:06,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:06,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:06,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-05 11:36:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-05 11:36:06,343 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-05 11:36:06,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 11:36:06 BoogieIcfgContainer [2019-09-05 11:36:06,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 11:36:06,388 INFO L168 Benchmark]: Toolchain (without parser) took 413957.51 ms. Allocated memory was 138.9 MB in the beginning and 272.6 MB in the end (delta: 133.7 MB). Free memory was 86.6 MB in the beginning and 62.8 MB in the end (delta: 23.7 MB). Peak memory consumption was 157.4 MB. Max. memory is 7.1 GB. [2019-09-05 11:36:06,389 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 138.9 MB. Free memory was 105.0 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 11:36:06,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.98 ms. Allocated memory is still 138.9 MB. Free memory was 86.3 MB in the beginning and 76.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-09-05 11:36:06,389 INFO L168 Benchmark]: Boogie Preprocessor took 124.10 ms. Allocated memory was 138.9 MB in the beginning and 198.7 MB in the end (delta: 59.8 MB). Free memory was 76.3 MB in the beginning and 175.4 MB in the end (delta: -99.1 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-09-05 11:36:06,390 INFO L168 Benchmark]: RCFGBuilder took 294.61 ms. Allocated memory is still 198.7 MB. Free memory was 175.4 MB in the beginning and 160.2 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2019-09-05 11:36:06,390 INFO L168 Benchmark]: TraceAbstraction took 413252.50 ms. Allocated memory was 198.7 MB in the beginning and 272.6 MB in the end (delta: 73.9 MB). Free memory was 159.5 MB in the beginning and 62.8 MB in the end (delta: 96.7 MB). Peak memory consumption was 170.6 MB. Max. memory is 7.1 GB. [2019-09-05 11:36:06,391 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 138.9 MB. Free memory was 105.0 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 281.98 ms. Allocated memory is still 138.9 MB. Free memory was 86.3 MB in the beginning and 76.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.10 ms. Allocated memory was 138.9 MB in the beginning and 198.7 MB in the end (delta: 59.8 MB). Free memory was 76.3 MB in the beginning and 175.4 MB in the end (delta: -99.1 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 294.61 ms. Allocated memory is still 198.7 MB. Free memory was 175.4 MB in the beginning and 160.2 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 413252.50 ms. Allocated memory was 198.7 MB in the beginning and 272.6 MB in the end (delta: 73.9 MB). Free memory was 159.5 MB in the beginning and 62.8 MB in the end (delta: 96.7 MB). Peak memory consumption was 170.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] unsigned int SIZE=__VERIFIER_nondet_uint(); [L12] int i, j, k, key; [L13] int v[SIZE]; [L14] j=1 VAL [j=1, SIZE=4, v={2:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=1, k=14, SIZE=4, v={2:0}, v[i]=5] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=0, j=1, k=14, SIZE=4, v={2:0}] [L14] j++ VAL [i=0, j=2, k=14, SIZE=4, v={2:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=1, j=2, k=15, SIZE=4, v={2:0}, v[i]=14] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=1, j=2, k=15, SIZE=4, v={2:0}] [L14] j++ VAL [i=1, j=3, k=15, SIZE=4, v={2:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=2, j=3, k=13, SIZE=4, v={2:0}, v[i]=15] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) VAL [i=2, j=3, k=13, SIZE=4, v={2:0}] [L20] i = i - 1 VAL [i=1, j=3, k=13, SIZE=4, v={2:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=1, j=3, k=13, SIZE=4, v={2:0}, v[i]=14] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR v[i] [L19] v[i+1] = v[i] [L20] i = i - 1 VAL [i=0, j=3, k=13, SIZE=4, v={2:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=3, k=13, SIZE=4, v={2:0}, v[i]=5] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=0, j=3, k=13, SIZE=4, v={2:0}] [L14] j++ VAL [i=0, j=4, k=13, SIZE=4, v={2:0}] [L14] COND FALSE !(j