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-c6af20d [2019-09-03 19:19:47,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:19:47,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:19:47,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:19:47,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:19:47,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:19:47,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:19:47,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:19:47,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:19:47,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:19:47,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:19:47,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:19:47,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:19:47,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:19:47,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:19:47,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:19:47,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:19:47,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:19:47,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:19:47,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:19:47,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:19:47,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:19:47,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:19:47,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:19:47,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:19:47,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:19:47,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:19:47,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:19:47,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:19:47,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:19:47,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:19:47,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:19:47,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:19:47,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:19:47,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:19:47,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:19:47,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:19:47,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:19:47,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:19:47,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:19:47,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:19:47,616 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-03 19:19:47,631 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:19:47,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:19:47,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:19:47,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:19:47,633 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:19:47,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:19:47,633 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:19:47,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:19:47,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:19:47,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:19:47,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:19:47,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:19:47,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:19:47,635 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:19:47,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:19:47,635 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:19:47,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:19:47,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:19:47,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:19:47,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:19:47,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:19:47,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:19:47,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:19:47,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:19:47,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:19:47,637 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:19:47,637 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:19:47,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:19:47,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:19:47,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:19:47,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:19:47,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:19:47,683 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:19:47,683 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:19:47,684 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-03 19:19:47,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/824aa2d67/f17ccc9300664d6abdccc5c1557814ec/FLAG5fe0c0b26 [2019-09-03 19:19:48,168 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:19:48,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-1.c [2019-09-03 19:19:48,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/824aa2d67/f17ccc9300664d6abdccc5c1557814ec/FLAG5fe0c0b26 [2019-09-03 19:19:48,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/824aa2d67/f17ccc9300664d6abdccc5c1557814ec [2019-09-03 19:19:48,567 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:19:48,568 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:19:48,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:19:48,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:19:48,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:19:48,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:19:48" (1/1) ... [2019-09-03 19:19:48,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbe1c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:48, skipping insertion in model container [2019-09-03 19:19:48,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:19:48" (1/1) ... [2019-09-03 19:19:48,585 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:19:48,602 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:19:48,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:19:48,762 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:19:48,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:19:48,803 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:19:48,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:48 WrapperNode [2019-09-03 19:19:48,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:19:48,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:19:48,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:19:48,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:19:48,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:48" (1/1) ... [2019-09-03 19:19:48,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:48" (1/1) ... [2019-09-03 19:19:48,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:48" (1/1) ... [2019-09-03 19:19:48,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:48" (1/1) ... [2019-09-03 19:19:48,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:48" (1/1) ... [2019-09-03 19:19:48,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:48" (1/1) ... [2019-09-03 19:19:48,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:48" (1/1) ... [2019-09-03 19:19:48,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:19:48,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:19:48,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:19:48,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:19:48,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:48" (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-03 19:19:49,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:19:49,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:19:49,016 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:19:49,016 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:19:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:19:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:19:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 19:19:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:19:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 19:19:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:19:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:19:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:19:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:19:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:19:49,258 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:19:49,258 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-03 19:19:49,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:19:49 BoogieIcfgContainer [2019-09-03 19:19:49,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:19:49,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:19:49,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:19:49,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:19:49,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:19:48" (1/3) ... [2019-09-03 19:19:49,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e71d1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:19:49, skipping insertion in model container [2019-09-03 19:19:49,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:48" (2/3) ... [2019-09-03 19:19:49,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e71d1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:19:49, skipping insertion in model container [2019-09-03 19:19:49,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:19:49" (3/3) ... [2019-09-03 19:19:49,271 INFO L109 eAbstractionObserver]: Analyzing ICFG insertion_sort-1.c [2019-09-03 19:19:49,287 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:19:49,303 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:19:49,353 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:19:49,394 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:19:49,395 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:19:49,395 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:19:49,395 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:19:49,396 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:19:49,396 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:19:49,396 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:19:49,396 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:19:49,396 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:19:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-09-03 19:19:49,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:19:49,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:49,419 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:49,421 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:49,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:49,426 INFO L82 PathProgramCache]: Analyzing trace with hash 342854797, now seen corresponding path program 1 times [2019-09-03 19:19:49,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:49,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:49,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:49,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:49,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:49,746 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-03 19:19:49,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:49,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:19:49,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:19:49,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:19:49,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:19:49,771 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2019-09-03 19:19:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:49,879 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2019-09-03 19:19:49,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:19:49,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-03 19:19:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:49,890 INFO L225 Difference]: With dead ends: 67 [2019-09-03 19:19:49,890 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 19:19:49,893 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-03 19:19:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 19:19:49,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-09-03 19:19:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 19:19:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-03 19:19:49,931 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2019-09-03 19:19:49,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:49,932 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-03 19:19:49,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:19:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-03 19:19:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:19:49,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:49,934 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-03 19:19:49,934 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:49,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:49,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1336061280, now seen corresponding path program 1 times [2019-09-03 19:19:49,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:49,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:49,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:49,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:49,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:50,539 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-03 19:19:50,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:50,540 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:50,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:50,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:19:50,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:50,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:50,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:50,846 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-03 19:19:50,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:50,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:50,864 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-03 19:19:50,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-09-03 19:19:50,908 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:50,908 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-03 19:19:50,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:50,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:50,911 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-03 19:19:50,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:19:50,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:50,947 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-03 19:19:50,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:50,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2019-09-03 19:19:50,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:19:50,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:19:50,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:19:50,955 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 19 states. [2019-09-03 19:19:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:51,622 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2019-09-03 19:19:51,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:19:51,623 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-09-03 19:19:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:51,627 INFO L225 Difference]: With dead ends: 86 [2019-09-03 19:19:51,627 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 19:19:51,629 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-03 19:19:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 19:19:51,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2019-09-03 19:19:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 19:19:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-09-03 19:19:51,650 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 19 [2019-09-03 19:19:51,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:51,650 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-09-03 19:19:51,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:19:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-09-03 19:19:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:19:51,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:51,653 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-03 19:19:51,654 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:51,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:51,658 INFO L82 PathProgramCache]: Analyzing trace with hash -455852680, now seen corresponding path program 1 times [2019-09-03 19:19:51,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:51,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:51,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:51,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:51,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:52,328 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-03 19:19:52,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:52,329 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) [2019-09-03 19:19:52,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:52,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:19:52,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:52,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:52,531 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-09-03 19:19:52,532 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-03 19:19:52,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:52,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:52,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:52,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-09-03 19:19:52,797 INFO L341 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-09-03 19:19:52,798 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-03 19:19:52,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:52,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:52,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:52,844 INFO L567 ElimStorePlain]: treesize reduction 131, result has 22.0 percent of original size [2019-09-03 19:19:52,845 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-03 19:19:52,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2019-09-03 19:19:52,995 INFO L341 Elim1Store]: treesize reduction 27, result has 67.1 percent of original size [2019-09-03 19:19:52,996 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-03 19:19:52,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:52,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-09-03 19:19:53,067 INFO L567 ElimStorePlain]: treesize reduction 143, result has 7.7 percent of original size [2019-09-03 19:19:53,068 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-03 19:19:53,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2019-09-03 19:19:53,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,133 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-03 19:19:53,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:53,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2019-09-03 19:19:53,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:19:53,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:19:53,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:19:53,142 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 29 states. [2019-09-03 19:19:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:54,064 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2019-09-03 19:19:54,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:19:54,065 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 24 [2019-09-03 19:19:54,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:54,068 INFO L225 Difference]: With dead ends: 105 [2019-09-03 19:19:54,069 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 19:19:54,070 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-03 19:19:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 19:19:54,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. [2019-09-03 19:19:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 19:19:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-09-03 19:19:54,081 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 24 [2019-09-03 19:19:54,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:54,081 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-09-03 19:19:54,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:19:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-09-03 19:19:54,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 19:19:54,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:54,082 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-03 19:19:54,083 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:54,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:54,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2042668019, now seen corresponding path program 2 times [2019-09-03 19:19:54,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:54,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:54,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:54,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:54,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:54,624 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-03 19:19:54,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:54,624 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) [2019-09-03 19:19:54,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:54,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:19:54,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:54,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:19:54,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:54,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:54,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:54,816 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-03 19:19:54,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:54,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:54,829 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-03 19:19:54,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-03 19:19:54,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:54,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:54,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:54,924 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:54,924 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-03 19:19:54,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:54,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:54,936 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-03 19:19:54,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2019-09-03 19:19:54,972 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:54,973 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-03 19:19:54,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:54,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:54,975 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-03 19:19:54,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:19:54,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:55,011 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-03 19:19:55,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:55,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2019-09-03 19:19:55,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:19:55,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:19:55,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:19:55,016 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 23 states. [2019-09-03 19:19:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:56,142 INFO L93 Difference]: Finished difference Result 136 states and 169 transitions. [2019-09-03 19:19:56,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:19:56,143 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2019-09-03 19:19:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:56,146 INFO L225 Difference]: With dead ends: 136 [2019-09-03 19:19:56,146 INFO L226 Difference]: Without dead ends: 117 [2019-09-03 19:19:56,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:19:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-03 19:19:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 57. [2019-09-03 19:19:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 19:19:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2019-09-03 19:19:56,159 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 25 [2019-09-03 19:19:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:56,160 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2019-09-03 19:19:56,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:19:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2019-09-03 19:19:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:19:56,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:56,161 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-03 19:19:56,161 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:56,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:56,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2145817879, now seen corresponding path program 1 times [2019-09-03 19:19:56,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:56,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:56,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:56,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:56,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:56,243 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-03 19:19:56,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:56,243 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-03 19:19:56,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:56,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:19:56,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:56,327 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-03 19:19:56,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:56,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 19:19:56,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:19:56,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:19:56,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:19:56,335 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 8 states. [2019-09-03 19:19:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:56,434 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2019-09-03 19:19:56,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:19:56,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-09-03 19:19:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:56,435 INFO L225 Difference]: With dead ends: 82 [2019-09-03 19:19:56,435 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 19:19:56,436 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-03 19:19:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 19:19:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2019-09-03 19:19:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 19:19:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2019-09-03 19:19:56,444 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 27 [2019-09-03 19:19:56,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:56,445 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2019-09-03 19:19:56,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:19:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2019-09-03 19:19:56,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:19:56,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:56,446 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-03 19:19:56,446 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:56,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:56,447 INFO L82 PathProgramCache]: Analyzing trace with hash 504300867, now seen corresponding path program 1 times [2019-09-03 19:19:56,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:56,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:56,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:56,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:56,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:56,696 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-03 19:19:56,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:56,697 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-03 19:19:56,716 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-03 19:19:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:56,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:19:56,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:56,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:56,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:56,845 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-03 19:19:56,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:56,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:56,854 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-03 19:19:56,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-09-03 19:19:56,877 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:56,877 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-03 19:19:56,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:56,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:56,879 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-03 19:19:56,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:19:56,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:56,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-03 19:19:56,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:56,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 20 [2019-09-03 19:19:56,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:19:56,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:19:56,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:19:56,906 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 20 states. [2019-09-03 19:19:58,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:58,119 INFO L93 Difference]: Finished difference Result 162 states and 212 transitions. [2019-09-03 19:19:58,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 19:19:58,119 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-09-03 19:19:58,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:58,120 INFO L225 Difference]: With dead ends: 162 [2019-09-03 19:19:58,120 INFO L226 Difference]: Without dead ends: 143 [2019-09-03 19:19:58,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=570, Invalid=2186, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:19:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-03 19:19:58,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 67. [2019-09-03 19:19:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 19:19:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-09-03 19:19:58,135 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 30 [2019-09-03 19:19:58,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:58,135 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-09-03 19:19:58,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:19:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2019-09-03 19:19:58,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:19:58,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:58,136 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-03 19:19:58,137 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:58,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:58,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1205365445, now seen corresponding path program 2 times [2019-09-03 19:19:58,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:58,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:58,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:58,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:58,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:58,185 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-03 19:19:58,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:58,185 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) [2019-09-03 19:19:58,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:58,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:19:58,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:58,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:19:58,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:58,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:58,230 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-03 19:19:58,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:58,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-03 19:19:58,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:19:58,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:19:58,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:19:58,235 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 7 states. [2019-09-03 19:19:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:58,356 INFO L93 Difference]: Finished difference Result 146 states and 186 transitions. [2019-09-03 19:19:58,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:19:58,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-09-03 19:19:58,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:58,357 INFO L225 Difference]: With dead ends: 146 [2019-09-03 19:19:58,357 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 19:19:58,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:19:58,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 19:19:58,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 76. [2019-09-03 19:19:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-03 19:19:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2019-09-03 19:19:58,377 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 30 [2019-09-03 19:19:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:58,378 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2019-09-03 19:19:58,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:19:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2019-09-03 19:19:58,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:19:58,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:58,383 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-03 19:19:58,383 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:58,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:58,384 INFO L82 PathProgramCache]: Analyzing trace with hash 488358411, now seen corresponding path program 3 times [2019-09-03 19:19:58,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:58,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:58,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:58,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:58,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:58,990 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-03 19:19:58,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:58,990 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-03 19:19:59,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:19:59,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:19:59,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:59,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:19:59,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:59,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:59,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:59,061 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-03 19:19:59,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:53 [2019-09-03 19:19:59,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:59,258 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:19:59,259 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,259 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-03 19:19:59,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,283 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-09-03 19:19:59,284 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-03 19:19:59,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:37 [2019-09-03 19:19:59,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:59,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:59,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:59,433 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,433 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-03 19:19:59,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,446 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-03 19:19:59,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:27 [2019-09-03 19:19:59,507 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,508 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-03 19:19:59,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,511 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-03 19:19:59,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-03 19:19:59,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:59,575 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-03 19:19:59,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:59,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 28 [2019-09-03 19:19:59,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:19:59,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:19:59,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:19:59,580 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand 28 states. [2019-09-03 19:20:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:00,880 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2019-09-03 19:20:00,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:20:00,881 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2019-09-03 19:20:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:00,882 INFO L225 Difference]: With dead ends: 135 [2019-09-03 19:20:00,882 INFO L226 Difference]: Without dead ends: 133 [2019-09-03 19:20:00,883 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-03 19:20:00,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-03 19:20:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 70. [2019-09-03 19:20:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 19:20:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2019-09-03 19:20:00,893 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 30 [2019-09-03 19:20:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:00,895 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2019-09-03 19:20:00,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:20:00,896 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2019-09-03 19:20:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 19:20:00,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:00,897 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-03 19:20:00,897 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:00,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:00,897 INFO L82 PathProgramCache]: Analyzing trace with hash 586827946, now seen corresponding path program 2 times [2019-09-03 19:20:00,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:00,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:00,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:00,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:00,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:01,191 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-03 19:20:01,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:01,192 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-03 19:20:01,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:20:01,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:20:01,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:01,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:20:01,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:01,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:01,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:01,379 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-03 19:20:01,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:01,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:01,389 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-03 19:20:01,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-03 19:20:01,591 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:01,592 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-03 19:20:01,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:01,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:01,593 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-03 19:20:01,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:20:01,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:01,633 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-03 19:20:01,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:01,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2019-09-03 19:20:01,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:20:01,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:20:01,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:20:01,638 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 28 states. [2019-09-03 19:20:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:16,501 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2019-09-03 19:20:16,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:20:16,501 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2019-09-03 19:20:16,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:16,503 INFO L225 Difference]: With dead ends: 131 [2019-09-03 19:20:16,503 INFO L226 Difference]: Without dead ends: 129 [2019-09-03 19:20:16,504 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-03 19:20:16,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-03 19:20:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 82. [2019-09-03 19:20:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-03 19:20:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2019-09-03 19:20:16,515 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 33 [2019-09-03 19:20:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:16,516 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2019-09-03 19:20:16,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:20:16,516 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2019-09-03 19:20:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 19:20:16,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:16,517 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-03 19:20:16,517 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:16,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:16,517 INFO L82 PathProgramCache]: Analyzing trace with hash 853695349, now seen corresponding path program 4 times [2019-09-03 19:20:16,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:16,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:16,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:16,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:16,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:16,905 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-03 19:20:16,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:16,906 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-03 19:20:16,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:20:16,934 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:20:16,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:16,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:20:16,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:16,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,039 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-09-03 19:20:17,040 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-03 19:20:17,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:17,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:17,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:17,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:38 [2019-09-03 19:20:17,247 INFO L341 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-09-03 19:20:17,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, 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-03 19:20:17,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:17,291 INFO L567 ElimStorePlain]: treesize reduction 129, result has 22.3 percent of original size [2019-09-03 19:20:17,292 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-03 19:20:17,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:29 [2019-09-03 19:20:17,396 INFO L341 Elim1Store]: treesize reduction 27, result has 67.1 percent of original size [2019-09-03 19:20:17,397 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-03 19:20:17,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-03 19:20:17,447 INFO L567 ElimStorePlain]: treesize reduction 123, result has 8.9 percent of original size [2019-09-03 19:20:17,448 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-03 19:20:17,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2019-09-03 19:20:17,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:17,483 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-03 19:20:17,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:17,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2019-09-03 19:20:17,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:20:17,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:20:17,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:20:17,487 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand 28 states. [2019-09-03 19:20:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:18,881 INFO L93 Difference]: Finished difference Result 168 states and 202 transitions. [2019-09-03 19:20:18,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:20:18,881 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2019-09-03 19:20:18,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:18,883 INFO L225 Difference]: With dead ends: 168 [2019-09-03 19:20:18,883 INFO L226 Difference]: Without dead ends: 126 [2019-09-03 19:20:18,885 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-03 19:20:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-03 19:20:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 85. [2019-09-03 19:20:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-03 19:20:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2019-09-03 19:20:18,903 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 35 [2019-09-03 19:20:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:18,903 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2019-09-03 19:20:18,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:20:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2019-09-03 19:20:18,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:20:18,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:18,908 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-03 19:20:18,908 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:18,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:18,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1400428558, now seen corresponding path program 1 times [2019-09-03 19:20:18,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:18,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:18,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:18,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:18,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:19,551 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-03 19:20:19,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:19,552 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:19,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:19,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:20:19,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:19,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:19,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:19,780 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:20:19,781 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:19,782 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-03 19:20:19,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:19,799 INFO L567 ElimStorePlain]: treesize reduction 19, result has 61.2 percent of original size [2019-09-03 19:20:19,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:19,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:30 [2019-09-03 19:20:19,921 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-03 19:20:19,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:19,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:19,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:19,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:19,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:19,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:19,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:19,933 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-03 19:20:19,934 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:19,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:19,940 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:19,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:19,947 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-03 19:20:19,947 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-09-03 19:20:20,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:20,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:20,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:20,029 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:20,029 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-03 19:20:20,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:20,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:20,038 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-03 19:20:20,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-09-03 19:20:20,064 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:20,064 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-03 19:20:20,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:20,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:20,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:20,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:20:20,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:20,115 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-03 19:20:20,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:20,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 28 [2019-09-03 19:20:20,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:20:20,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:20:20,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:20:20,121 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 28 states. [2019-09-03 19:20:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:21,682 INFO L93 Difference]: Finished difference Result 254 states and 303 transitions. [2019-09-03 19:20:21,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:20:21,683 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2019-09-03 19:20:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:21,687 INFO L225 Difference]: With dead ends: 254 [2019-09-03 19:20:21,687 INFO L226 Difference]: Without dead ends: 209 [2019-09-03 19:20:21,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=278, Invalid=1792, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:20:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-03 19:20:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-09-03 19:20:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-03 19:20:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 138 transitions. [2019-09-03 19:20:21,709 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 138 transitions. Word has length 36 [2019-09-03 19:20:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:21,711 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 138 transitions. [2019-09-03 19:20:21,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:20:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2019-09-03 19:20:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:20:21,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:21,712 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-03 19:20:21,712 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash -311016042, now seen corresponding path program 2 times [2019-09-03 19:20:21,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:21,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:21,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:21,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:21,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:22,418 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-03 19:20:22,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:22,418 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:22,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:20:22,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:20:22,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:22,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:20:22,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:22,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:22,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:22,656 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-03 19:20:22,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:22,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:22,669 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-03 19:20:22,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-09-03 19:20:22,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:22,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:22,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:22,755 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:22,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-09-03 19:20:22,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:22,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:22,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-03 19:20:22,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-09-03 19:20:22,785 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:22,785 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-03 19:20:22,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:22,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:22,787 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-03 19:20:22,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:20:22,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:22,824 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-03 19:20:22,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:22,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 30 [2019-09-03 19:20:22,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:20:22,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:20:22,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:20:22,828 INFO L87 Difference]: Start difference. First operand 115 states and 138 transitions. Second operand 30 states. [2019-09-03 19:20:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:24,721 INFO L93 Difference]: Finished difference Result 253 states and 304 transitions. [2019-09-03 19:20:24,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:20:24,722 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-03 19:20:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:24,724 INFO L225 Difference]: With dead ends: 253 [2019-09-03 19:20:24,724 INFO L226 Difference]: Without dead ends: 208 [2019-09-03 19:20:24,726 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-03 19:20:24,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-03 19:20:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 134. [2019-09-03 19:20:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-03 19:20:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 163 transitions. [2019-09-03 19:20:24,741 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 163 transitions. Word has length 36 [2019-09-03 19:20:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:24,741 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 163 transitions. [2019-09-03 19:20:24,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:20:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 163 transitions. [2019-09-03 19:20:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:20:24,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:24,742 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-03 19:20:24,742 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:24,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:24,743 INFO L82 PathProgramCache]: Analyzing trace with hash -591767046, now seen corresponding path program 1 times [2019-09-03 19:20:24,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:24,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:24,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:24,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:24,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:25,147 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-03 19:20:25,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:25,147 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) [2019-09-03 19:20:25,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:25,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:20:25,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:25,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:25,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:25,334 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-03 19:20:25,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:25,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:25,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:25,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:41 [2019-09-03 19:20:25,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:25,524 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:20:25,525 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:25,525 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-03 19:20:25,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:25,543 INFO L567 ElimStorePlain]: treesize reduction 9, result has 78.6 percent of original size [2019-09-03 19:20:25,544 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-03 19:20:25,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-09-03 19:20:25,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:25,826 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:20:25,828 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:25,828 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-03 19:20:25,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:25,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:25,834 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-03 19:20:25,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-09-03 19:20:25,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:25,884 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-03 19:20:25,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:25,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2019-09-03 19:20:25,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:20:25,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:20:25,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:20:25,889 INFO L87 Difference]: Start difference. First operand 134 states and 163 transitions. Second operand 36 states. [2019-09-03 19:20:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:28,693 INFO L93 Difference]: Finished difference Result 242 states and 290 transitions. [2019-09-03 19:20:28,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 19:20:28,693 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 38 [2019-09-03 19:20:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:28,696 INFO L225 Difference]: With dead ends: 242 [2019-09-03 19:20:28,696 INFO L226 Difference]: Without dead ends: 240 [2019-09-03 19:20:28,698 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-03 19:20:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-03 19:20:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 160. [2019-09-03 19:20:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:20:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 194 transitions. [2019-09-03 19:20:28,729 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 194 transitions. Word has length 38 [2019-09-03 19:20:28,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:28,729 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 194 transitions. [2019-09-03 19:20:28,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:20:28,730 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 194 transitions. [2019-09-03 19:20:28,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 19:20:28,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:28,731 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-03 19:20:28,732 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:28,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:28,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1198506493, now seen corresponding path program 3 times [2019-09-03 19:20:28,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:28,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:28,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:28,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:28,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:29,008 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-03 19:20:29,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:29,009 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-03 19:20:29,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:20:29,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:20:29,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:29,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:20:29,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:29,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:29,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:29,182 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-03 19:20:29,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:29,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:29,192 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-03 19:20:29,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-09-03 19:20:29,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:29,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:29,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:29,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:29,332 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-03 19:20:29,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:29,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:29,340 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-03 19:20:29,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-09-03 19:20:29,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:29,597 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-03 19:20:29,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:29,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:29,599 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-03 19:20:29,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:20:29,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:29,644 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-03 19:20:29,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:29,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 35 [2019-09-03 19:20:29,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:20:29,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:20:29,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:20:29,649 INFO L87 Difference]: Start difference. First operand 160 states and 194 transitions. Second operand 35 states. [2019-09-03 19:20:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:51,459 INFO L93 Difference]: Finished difference Result 302 states and 360 transitions. [2019-09-03 19:20:51,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:20:51,460 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 39 [2019-09-03 19:20:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:51,462 INFO L225 Difference]: With dead ends: 302 [2019-09-03 19:20:51,462 INFO L226 Difference]: Without dead ends: 242 [2019-09-03 19:20:51,464 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-03 19:20:51,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-03 19:20:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 149. [2019-09-03 19:20:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-03 19:20:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 181 transitions. [2019-09-03 19:20:51,483 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 181 transitions. Word has length 39 [2019-09-03 19:20:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:51,483 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 181 transitions. [2019-09-03 19:20:51,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:20:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 181 transitions. [2019-09-03 19:20:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 19:20:51,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:51,484 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-03 19:20:51,484 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:51,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:51,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1463502433, now seen corresponding path program 4 times [2019-09-03 19:20:51,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:51,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:51,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:51,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:51,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:51,591 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-03 19:20:51,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:51,592 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) [2019-09-03 19:20:51,614 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:51,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:20:51,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:51,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:20:51,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:51,718 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-03 19:20:51,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:51,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-09-03 19:20:51,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:20:51,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:20:51,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:20:51,723 INFO L87 Difference]: Start difference. First operand 149 states and 181 transitions. Second operand 11 states. [2019-09-03 19:20:51,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:51,873 INFO L93 Difference]: Finished difference Result 238 states and 289 transitions. [2019-09-03 19:20:51,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:20:51,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-09-03 19:20:51,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:51,875 INFO L225 Difference]: With dead ends: 238 [2019-09-03 19:20:51,875 INFO L226 Difference]: Without dead ends: 218 [2019-09-03 19:20:51,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:20:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-03 19:20:51,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 167. [2019-09-03 19:20:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-03 19:20:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 199 transitions. [2019-09-03 19:20:51,907 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 199 transitions. Word has length 41 [2019-09-03 19:20:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:51,908 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 199 transitions. [2019-09-03 19:20:51,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:20:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 199 transitions. [2019-09-03 19:20:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 19:20:51,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:51,909 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-03 19:20:51,909 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:51,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:51,910 INFO L82 PathProgramCache]: Analyzing trace with hash -2065125816, now seen corresponding path program 5 times [2019-09-03 19:20:51,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:51,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:51,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:51,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:51,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:52,555 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-03 19:20:52,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:52,556 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-03 19:20:52,565 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:20:52,594 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:20:52,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:52,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:20:52,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:52,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:52,852 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-09-03 19:20:52,853 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-03 19:20:52,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:52,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:52,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:52,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-09-03 19:20:52,960 INFO L341 Elim1Store]: treesize reduction 60, result has 16.7 percent of original size [2019-09-03 19:20:52,961 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-03 19:20:52,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:52,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:52,971 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-03 19:20:52,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:39 [2019-09-03 19:20:53,222 INFO L341 Elim1Store]: treesize reduction 18, result has 85.6 percent of original size [2019-09-03 19:20:53,222 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-03 19:20:53,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:53,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:53,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:53,266 INFO L567 ElimStorePlain]: treesize reduction 81, result has 38.6 percent of original size [2019-09-03 19:20:53,267 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-03 19:20:53,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:34 [2019-09-03 19:20:53,459 INFO L341 Elim1Store]: treesize reduction 28, result has 67.1 percent of original size [2019-09-03 19:20:53,459 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-03 19:20:53,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:53,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:53,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:53,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:53,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:53,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:53,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:53,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:53,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:53,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:53,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:53,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:53,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-09-03 19:20:53,511 INFO L567 ElimStorePlain]: treesize reduction 116, result has 12.1 percent of original size [2019-09-03 19:20:53,511 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-03 19:20:53,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:5 [2019-09-03 19:20:53,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:53,609 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-03 19:20:53,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:53,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2019-09-03 19:20:53,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:20:53,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:20:53,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1319, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:20:53,624 INFO L87 Difference]: Start difference. First operand 167 states and 199 transitions. Second operand 39 states. [2019-09-03 19:20:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:57,900 INFO L93 Difference]: Finished difference Result 407 states and 498 transitions. [2019-09-03 19:20:57,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 19:20:57,901 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 41 [2019-09-03 19:20:57,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:57,909 INFO L225 Difference]: With dead ends: 407 [2019-09-03 19:20:57,909 INFO L226 Difference]: Without dead ends: 347 [2019-09-03 19:20:57,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2528 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=920, Invalid=7090, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 19:20:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-03 19:20:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 227. [2019-09-03 19:20:58,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-03 19:20:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 275 transitions. [2019-09-03 19:20:58,005 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 275 transitions. Word has length 41 [2019-09-03 19:20:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:58,005 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 275 transitions. [2019-09-03 19:20:58,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:20:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 275 transitions. [2019-09-03 19:20:58,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 19:20:58,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:58,007 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-03 19:20:58,007 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:58,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:58,008 INFO L82 PathProgramCache]: Analyzing trace with hash 591821558, now seen corresponding path program 1 times [2019-09-03 19:20:58,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:58,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:58,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:58,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:58,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:59,026 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-03 19:20:59,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:59,026 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-03 19:20:59,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:59,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:20:59,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:59,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:59,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:59,244 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-03 19:20:59,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:59,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:59,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:59,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:49 [2019-09-03 19:20:59,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:59,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:20:59,472 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:59,472 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-03 19:20:59,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:59,505 INFO L567 ElimStorePlain]: treesize reduction 11, result has 81.7 percent of original size [2019-09-03 19:20:59,506 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-03 19:20:59,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:73, output treesize:46 [2019-09-03 19:20:59,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:59,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:59,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:59,660 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:59,660 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-03 19:20:59,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:59,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:59,680 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-03 19:20:59,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:41 [2019-09-03 19:20:59,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:59,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:59,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:59,852 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:59,853 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-03 19:20:59,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:59,884 INFO L567 ElimStorePlain]: treesize reduction 3, result has 94.6 percent of original size [2019-09-03 19:20:59,885 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-03 19:20:59,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-09-03 19:20:59,998 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:20:59,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:00,000 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:00,005 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:00,005 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-03 19:21:00,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:00,020 INFO L567 ElimStorePlain]: treesize reduction 3, result has 85.0 percent of original size [2019-09-03 19:21:00,020 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-03 19:21:00,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:5 [2019-09-03 19:21:00,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:00,110 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-03 19:21:00,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:00,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2019-09-03 19:21:00,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:21:00,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:21:00,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:21:00,114 INFO L87 Difference]: Start difference. First operand 227 states and 275 transitions. Second operand 40 states. [2019-09-03 19:21:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:02,120 INFO L93 Difference]: Finished difference Result 397 states and 481 transitions. [2019-09-03 19:21:02,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:21:02,120 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 41 [2019-09-03 19:21:02,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:02,123 INFO L225 Difference]: With dead ends: 397 [2019-09-03 19:21:02,124 INFO L226 Difference]: Without dead ends: 318 [2019-09-03 19:21:02,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=394, Invalid=3512, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:21:02,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-03 19:21:02,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 254. [2019-09-03 19:21:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-03 19:21:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 311 transitions. [2019-09-03 19:21:02,158 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 311 transitions. Word has length 41 [2019-09-03 19:21:02,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:02,158 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 311 transitions. [2019-09-03 19:21:02,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:21:02,158 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 311 transitions. [2019-09-03 19:21:02,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:21:02,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:02,159 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-03 19:21:02,160 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:02,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:02,160 INFO L82 PathProgramCache]: Analyzing trace with hash 369785307, now seen corresponding path program 2 times [2019-09-03 19:21:02,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:02,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:02,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:02,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:21:02,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:02,877 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-03 19:21:02,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:02,878 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-03 19:21:02,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:21:02,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:21:02,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:02,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:21:02,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:02,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:03,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:03,038 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-03 19:21:03,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:03,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:03,049 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-03 19:21:03,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 [2019-09-03 19:21:03,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:03,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:03,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:03,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:03,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:21:03,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:03,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:03,175 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-03 19:21:03,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-03 19:21:03,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:03,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:03,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:03,256 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:03,256 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-03 19:21:03,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:03,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:03,268 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-03 19:21:03,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-03 19:21:03,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:03,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:03,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:03,369 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:03,370 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-03 19:21:03,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:03,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:03,380 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-03 19:21:03,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:26 [2019-09-03 19:21:03,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:03,420 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-03 19:21:03,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:03,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:03,423 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-03 19:21:03,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:21:03,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:03,470 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-03 19:21:03,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:03,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 32 [2019-09-03 19:21:03,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:21:03,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:21:03,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:21:03,477 INFO L87 Difference]: Start difference. First operand 254 states and 311 transitions. Second operand 32 states. [2019-09-03 19:21:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:05,789 INFO L93 Difference]: Finished difference Result 538 states and 665 transitions. [2019-09-03 19:21:05,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:21:05,789 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2019-09-03 19:21:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:05,792 INFO L225 Difference]: With dead ends: 538 [2019-09-03 19:21:05,793 INFO L226 Difference]: Without dead ends: 459 [2019-09-03 19:21:05,794 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-03 19:21:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-03 19:21:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 301. [2019-09-03 19:21:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-03 19:21:05,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 371 transitions. [2019-09-03 19:21:05,831 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 371 transitions. Word has length 42 [2019-09-03 19:21:05,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:05,831 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 371 transitions. [2019-09-03 19:21:05,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:21:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 371 transitions. [2019-09-03 19:21:05,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 19:21:05,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:05,832 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-03 19:21:05,832 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:05,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:05,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1630887468, now seen corresponding path program 1 times [2019-09-03 19:21:05,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:05,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:05,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:05,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:21:05,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:06,951 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-03 19:21:06,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:06,951 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-03 19:21:06,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:21:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:06,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:21:06,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:07,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:07,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:07,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 28 treesize of output 27 [2019-09-03 19:21:07,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:07,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:07,196 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-03 19:21:07,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-03 19:21:07,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:07,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:07,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:07,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:07,254 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:07,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:07,256 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-03 19:21:07,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:07,275 INFO L567 ElimStorePlain]: treesize reduction 17, result has 70.7 percent of original size [2019-09-03 19:21:07,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:07,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:41 [2019-09-03 19:21:07,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:07,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:07,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:07,509 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:07,510 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:07,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:07,512 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:07,512 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-03 19:21:07,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:07,543 INFO L567 ElimStorePlain]: treesize reduction 40, result has 58.3 percent of original size [2019-09-03 19:21:07,543 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-03 19:21:07,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:56 [2019-09-03 19:21:07,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:07,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:07,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:07,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:07,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:07,790 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:07,791 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-03 19:21:07,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:07,831 INFO L567 ElimStorePlain]: treesize reduction 25, result has 77.1 percent of original size [2019-09-03 19:21:07,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:07,833 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-03 19:21:07,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:75, output treesize:94 [2019-09-03 19:21:08,075 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:08,075 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-03 19:21:08,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:08,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:08,077 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-03 19:21:08,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:21:08,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:08,142 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-03 19:21:08,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:08,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 43 [2019-09-03 19:21:08,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:21:08,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:21:08,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1646, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:21:08,150 INFO L87 Difference]: Start difference. First operand 301 states and 371 transitions. Second operand 43 states. [2019-09-03 19:21:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:26,214 INFO L93 Difference]: Finished difference Result 344 states and 418 transitions. [2019-09-03 19:21:26,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:21:26,214 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-09-03 19:21:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:26,215 INFO L225 Difference]: With dead ends: 344 [2019-09-03 19:21:26,216 INFO L226 Difference]: Without dead ends: 327 [2019-09-03 19:21:26,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=393, Invalid=3897, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:21:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-03 19:21:26,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 314. [2019-09-03 19:21:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-03 19:21:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 385 transitions. [2019-09-03 19:21:26,253 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 385 transitions. Word has length 43 [2019-09-03 19:21:26,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:26,253 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 385 transitions. [2019-09-03 19:21:26,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:21:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 385 transitions. [2019-09-03 19:21:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:21:26,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:26,254 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-03 19:21:26,254 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:26,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:26,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1316368837, now seen corresponding path program 1 times [2019-09-03 19:21:26,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:26,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:26,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:26,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:21:26,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:26,459 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-03 19:21:26,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:26,460 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) [2019-09-03 19:21:26,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:21:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:26,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:21:26,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:26,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:26,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:26,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:26,765 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-03 19:21:26,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:26,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:26,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-03 19:21:26,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-09-03 19:21:27,068 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:27,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:27,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:27,071 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:27,074 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:27,075 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-03 19:21:27,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:27,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:27,082 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-03 19:21:27,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2019-09-03 19:21:27,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:27,132 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-03 19:21:27,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:27,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 32 [2019-09-03 19:21:27,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:21:27,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:21:27,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:21:27,136 INFO L87 Difference]: Start difference. First operand 314 states and 385 transitions. Second operand 32 states. [2019-09-03 19:21:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:46,323 INFO L93 Difference]: Finished difference Result 705 states and 866 transitions. [2019-09-03 19:21:46,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:21:46,323 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2019-09-03 19:21:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:46,326 INFO L225 Difference]: With dead ends: 705 [2019-09-03 19:21:46,326 INFO L226 Difference]: Without dead ends: 568 [2019-09-03 19:21:46,327 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-03 19:21:46,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-03 19:21:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 341. [2019-09-03 19:21:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-03 19:21:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 419 transitions. [2019-09-03 19:21:46,369 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 419 transitions. Word has length 44 [2019-09-03 19:21:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:46,369 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 419 transitions. [2019-09-03 19:21:46,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:21:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 419 transitions. [2019-09-03 19:21:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:21:46,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:46,370 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-03 19:21:46,371 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:46,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:46,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2095999155, now seen corresponding path program 2 times [2019-09-03 19:21:46,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:46,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:46,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:46,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:21:46,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:46,911 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-03 19:21:46,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:46,912 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-03 19:21:46,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:21:46,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:21:46,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:46,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:21:46,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:47,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:47,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:47,102 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-03 19:21:47,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:47,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:47,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:47,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-09-03 19:21:47,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:47,295 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:47,296 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:47,297 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-03 19:21:47,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:47,321 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-09-03 19:21:47,322 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-03 19:21:47,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:37 [2019-09-03 19:21:47,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:47,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:47,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:47,447 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:47,447 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-03 19:21:47,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:47,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:47,459 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-03 19:21:47,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2019-09-03 19:21:47,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:47,757 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:47,759 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:47,759 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-03 19:21:47,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:47,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:47,766 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-03 19:21:47,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-09-03 19:21:47,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:47,859 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-03 19:21:47,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:47,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2019-09-03 19:21:47,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:21:47,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:21:47,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1475, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:21:47,864 INFO L87 Difference]: Start difference. First operand 341 states and 419 transitions. Second operand 41 states. [2019-09-03 19:21:49,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:49,148 INFO L93 Difference]: Finished difference Result 383 states and 465 transitions. [2019-09-03 19:21:49,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:21:49,149 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 44 [2019-09-03 19:21:49,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:49,151 INFO L225 Difference]: With dead ends: 383 [2019-09-03 19:21:49,151 INFO L226 Difference]: Without dead ends: 381 [2019-09-03 19:21:49,152 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-03 19:21:49,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-09-03 19:21:49,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 341. [2019-09-03 19:21:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-03 19:21:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 419 transitions. [2019-09-03 19:21:49,198 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 419 transitions. Word has length 44 [2019-09-03 19:21:49,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:49,198 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 419 transitions. [2019-09-03 19:21:49,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:21:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 419 transitions. [2019-09-03 19:21:49,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 19:21:49,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:49,200 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-03 19:21:49,200 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:49,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:49,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1588085580, now seen corresponding path program 5 times [2019-09-03 19:21:49,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:49,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:49,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:49,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:21:49,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:49,471 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-03 19:21:49,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:49,472 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-03 19:21:49,497 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:21:49,544 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 19:21:49,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:49,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:21:49,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:49,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:49,758 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-03 19:21:49,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:49,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:49,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:49,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-09-03 19:21:49,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:49,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:49,922 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-03 19:21:49,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:49,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:49,932 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-03 19:21:49,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-09-03 19:21:50,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,449 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:50,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,451 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:50,454 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:50,455 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-03 19:21:50,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:50,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:50,460 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-03 19:21:50,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2019-09-03 19:21:50,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:50,520 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-03 19:21:50,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:50,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 36 [2019-09-03 19:21:50,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:21:50,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:21:50,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:21:50,524 INFO L87 Difference]: Start difference. First operand 341 states and 419 transitions. Second operand 36 states. [2019-09-03 19:22:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:11,210 INFO L93 Difference]: Finished difference Result 468 states and 568 transitions. [2019-09-03 19:22:11,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:22:11,211 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 47 [2019-09-03 19:22:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:11,213 INFO L225 Difference]: With dead ends: 468 [2019-09-03 19:22:11,213 INFO L226 Difference]: Without dead ends: 466 [2019-09-03 19:22:11,214 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-03 19:22:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-03 19:22:11,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 385. [2019-09-03 19:22:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-09-03 19:22:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 468 transitions. [2019-09-03 19:22:11,260 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 468 transitions. Word has length 47 [2019-09-03 19:22:11,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:11,260 INFO L475 AbstractCegarLoop]: Abstraction has 385 states and 468 transitions. [2019-09-03 19:22:11,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:22:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 468 transitions. [2019-09-03 19:22:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 19:22:11,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:11,261 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-03 19:22:11,261 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:11,261 INFO L82 PathProgramCache]: Analyzing trace with hash 907149979, now seen corresponding path program 1 times [2019-09-03 19:22:11,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:11,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:11,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:11,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:11,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:11,721 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-03 19:22:11,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:11,721 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) [2019-09-03 19:22:11,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:11,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:22:11,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:11,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:12,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:12,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-03 19:22:12,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:12,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:12,057 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-03 19:22:12,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-03 19:22:12,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:12,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:12,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:12,179 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:12,179 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-03 19:22:12,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:12,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:12,192 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-03 19:22:12,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:30 [2019-09-03 19:22:12,250 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:12,250 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-03 19:22:12,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:12,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:12,252 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-03 19:22:12,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:22:12,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:12,300 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-03 19:22:12,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:12,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2019-09-03 19:22:12,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:22:12,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:22:12,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:22:12,305 INFO L87 Difference]: Start difference. First operand 385 states and 468 transitions. Second operand 31 states. [2019-09-03 19:22:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:14,344 INFO L93 Difference]: Finished difference Result 712 states and 877 transitions. [2019-09-03 19:22:14,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:22:14,344 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 47 [2019-09-03 19:22:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:14,347 INFO L225 Difference]: With dead ends: 712 [2019-09-03 19:22:14,347 INFO L226 Difference]: Without dead ends: 591 [2019-09-03 19:22:14,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=502, Invalid=2468, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:22:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-03 19:22:14,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 437. [2019-09-03 19:22:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-09-03 19:22:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 537 transitions. [2019-09-03 19:22:14,423 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 537 transitions. Word has length 47 [2019-09-03 19:22:14,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:14,424 INFO L475 AbstractCegarLoop]: Abstraction has 437 states and 537 transitions. [2019-09-03 19:22:14,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:22:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 537 transitions. [2019-09-03 19:22:14,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 19:22:14,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:14,425 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-03 19:22:14,425 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:14,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:14,426 INFO L82 PathProgramCache]: Analyzing trace with hash -681197923, now seen corresponding path program 2 times [2019-09-03 19:22:14,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:14,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:14,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:14,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:14,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:14,459 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-03 19:22:14,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:14,460 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) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:14,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:22:14,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:22:14,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:14,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:22:14,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:14,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:14,514 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-03 19:22:14,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:14,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-03 19:22:14,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:22:14,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:22:14,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:22:14,519 INFO L87 Difference]: Start difference. First operand 437 states and 537 transitions. Second operand 6 states. [2019-09-03 19:22:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:14,629 INFO L93 Difference]: Finished difference Result 615 states and 758 transitions. [2019-09-03 19:22:14,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:22:14,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-09-03 19:22:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:14,631 INFO L225 Difference]: With dead ends: 615 [2019-09-03 19:22:14,631 INFO L226 Difference]: Without dead ends: 476 [2019-09-03 19:22:14,632 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-03 19:22:14,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-09-03 19:22:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 423. [2019-09-03 19:22:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-03 19:22:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 513 transitions. [2019-09-03 19:22:14,685 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 513 transitions. Word has length 47 [2019-09-03 19:22:14,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:14,685 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 513 transitions. [2019-09-03 19:22:14,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:22:14,685 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 513 transitions. [2019-09-03 19:22:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 19:22:14,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:14,687 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-03 19:22:14,687 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:14,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:14,687 INFO L82 PathProgramCache]: Analyzing trace with hash 595421449, now seen corresponding path program 3 times [2019-09-03 19:22:14,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:14,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:14,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:14,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:14,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:15,578 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-03 19:22:15,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:15,578 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) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:15,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:22:15,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 19:22:15,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:15,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:22:15,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:15,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:15,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:15,655 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-03 19:22:15,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:15,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:15,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:22:15,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-09-03 19:22:15,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:15,754 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:22:15,756 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:15,756 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-03 19:22:15,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:15,778 INFO L567 ElimStorePlain]: treesize reduction 12, result has 74.5 percent of original size [2019-09-03 19:22:15,778 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-03 19:22:15,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2019-09-03 19:22:15,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:15,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:15,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:15,856 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:15,856 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-03 19:22:15,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:15,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:15,866 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-03 19:22:15,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-09-03 19:22:15,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:15,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:15,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:15,981 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:15,981 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-03 19:22:15,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:15,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:15,992 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-03 19:22:15,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:22 [2019-09-03 19:22:16,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:16,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:16,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:16,101 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:16,102 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-03 19:22:16,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:16,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:16,109 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-03 19:22:16,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:19 [2019-09-03 19:22:16,127 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:16,127 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-03 19:22:16,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:16,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:16,128 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-03 19:22:16,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-03 19:22:16,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:16,176 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-03 19:22:16,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:16,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 36 [2019-09-03 19:22:16,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:22:16,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:22:16,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:22:16,181 INFO L87 Difference]: Start difference. First operand 423 states and 513 transitions. Second operand 36 states. [2019-09-03 19:22:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:18,975 INFO L93 Difference]: Finished difference Result 669 states and 813 transitions. [2019-09-03 19:22:18,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:22:18,976 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 47 [2019-09-03 19:22:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:18,979 INFO L225 Difference]: With dead ends: 669 [2019-09-03 19:22:18,979 INFO L226 Difference]: Without dead ends: 585 [2019-09-03 19:22:18,979 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-03 19:22:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-03 19:22:19,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 436. [2019-09-03 19:22:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-09-03 19:22:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 530 transitions. [2019-09-03 19:22:19,039 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 530 transitions. Word has length 47 [2019-09-03 19:22:19,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:19,040 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 530 transitions. [2019-09-03 19:22:19,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:22:19,040 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 530 transitions. [2019-09-03 19:22:19,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:22:19,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:19,041 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-03 19:22:19,042 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:19,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:19,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1128146500, now seen corresponding path program 2 times [2019-09-03 19:22:19,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:19,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:19,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:19,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:19,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:20,242 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-03 19:22:20,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:20,242 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-03 19:22:20,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:22:20,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:22:20,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:20,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:22:20,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:20,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:20,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:20,376 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-03 19:22:20,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:20,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:20,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:22:20,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-09-03 19:22:20,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:20,559 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:22:20,561 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:20,561 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-03 19:22:20,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:20,598 INFO L567 ElimStorePlain]: treesize reduction 12, result has 74.5 percent of original size [2019-09-03 19:22:20,598 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-03 19:22:20,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2019-09-03 19:22:20,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:20,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:20,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:20,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:20,659 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:22:20,660 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:20,661 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-03 19:22:20,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:20,681 INFO L567 ElimStorePlain]: treesize reduction 18, result has 72.7 percent of original size [2019-09-03 19:22:20,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:22:20,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:48 [2019-09-03 19:22:20,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:20,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:20,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:20,895 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:22:20,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:20,897 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:22:20,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:20,900 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-03 19:22:20,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:20,938 INFO L567 ElimStorePlain]: treesize reduction 20, result has 79.4 percent of original size [2019-09-03 19:22:20,939 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-03 19:22:20,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:77 [2019-09-03 19:22:21,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:21,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:21,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:21,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:21,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:21,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:21,192 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:21,193 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-03 19:22:21,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:21,255 INFO L567 ElimStorePlain]: treesize reduction 60, result has 63.6 percent of original size [2019-09-03 19:22:21,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:21,257 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-03 19:22:21,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:96, output treesize:137 [2019-09-03 19:22:21,547 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:21,547 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-03 19:22:21,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:21,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:21,550 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-03 19:22:21,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-03 19:22:21,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:21,652 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-03 19:22:21,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:21,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 46 [2019-09-03 19:22:21,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:22:21,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:22:21,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1862, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:22:21,665 INFO L87 Difference]: Start difference. First operand 436 states and 530 transitions. Second operand 46 states. [2019-09-03 19:22:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:24,133 INFO L93 Difference]: Finished difference Result 460 states and 554 transitions. [2019-09-03 19:22:24,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:22:24,134 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 48 [2019-09-03 19:22:24,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:24,136 INFO L225 Difference]: With dead ends: 460 [2019-09-03 19:22:24,136 INFO L226 Difference]: Without dead ends: 443 [2019-09-03 19:22:24,137 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-03 19:22:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-03 19:22:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 403. [2019-09-03 19:22:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-03 19:22:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 492 transitions. [2019-09-03 19:22:24,193 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 492 transitions. Word has length 48 [2019-09-03 19:22:24,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:24,194 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 492 transitions. [2019-09-03 19:22:24,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:22:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 492 transitions. [2019-09-03 19:22:24,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 19:22:24,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:24,197 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-03 19:22:24,198 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:24,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:24,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1834674623, now seen corresponding path program 1 times [2019-09-03 19:22:24,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:24,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:24,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:24,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:24,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:24,485 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-03 19:22:24,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:24,485 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-03 19:22:24,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:24,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:22:24,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:24,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:24,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:24,711 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-03 19:22:24,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:24,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:24,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:22:24,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-09-03 19:22:24,912 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:22:24,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:24,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:24,915 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-03 19:22:24,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:24,941 INFO L567 ElimStorePlain]: treesize reduction 14, result has 74.5 percent of original size [2019-09-03 19:22:24,942 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-03 19:22:24,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:38 [2019-09-03 19:22:25,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:25,247 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:22:25,247 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:22:25,251 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:25,252 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-03 19:22:25,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:25,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:25,259 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-03 19:22:25,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:5 [2019-09-03 19:22:25,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:25,315 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-03 19:22:25,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:25,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 37 [2019-09-03 19:22:25,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:22:25,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:22:25,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:22:25,319 INFO L87 Difference]: Start difference. First operand 403 states and 492 transitions. Second operand 37 states. [2019-09-03 19:22:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:29,796 INFO L93 Difference]: Finished difference Result 596 states and 723 transitions. [2019-09-03 19:22:29,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 19:22:29,796 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 49 [2019-09-03 19:22:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:29,799 INFO L225 Difference]: With dead ends: 596 [2019-09-03 19:22:29,799 INFO L226 Difference]: Without dead ends: 594 [2019-09-03 19:22:29,800 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-03 19:22:29,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-03 19:22:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 415. [2019-09-03 19:22:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-03 19:22:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 507 transitions. [2019-09-03 19:22:29,863 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 507 transitions. Word has length 49 [2019-09-03 19:22:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:29,863 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 507 transitions. [2019-09-03 19:22:29,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:22:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 507 transitions. [2019-09-03 19:22:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 19:22:29,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:29,865 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-03 19:22:29,865 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:29,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:29,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1831939583, now seen corresponding path program 3 times [2019-09-03 19:22:29,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:29,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:29,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:29,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:29,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:31,306 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-03 19:22:31,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:31,306 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-03 19:22:31,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:22:31,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:22:31,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:31,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:22:31,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:31,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:31,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,511 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-03 19:22:31,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:31,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:31,521 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-03 19:22:31,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-09-03 19:22:31,547 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-03 19:22:31,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,569 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-03 19:22:31,569 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:31,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:31,575 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:22:31,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:31,588 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-03 19:22:31,589 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:50 [2019-09-03 19:22:31,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,830 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:31,830 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-03 19:22:31,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:31,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:31,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:31,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:31,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:31,954 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2019-09-03 19:22:31,955 INFO L567 ElimStorePlain]: treesize reduction 329, result has 21.1 percent of original size [2019-09-03 19:22:31,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:31,956 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-03 19:22:31,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:87 [2019-09-03 19:22:31,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:32,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:32,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:32,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:32,400 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:22:32,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:32,403 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:32,404 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-03 19:22:32,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:32,430 INFO L567 ElimStorePlain]: treesize reduction 7, result has 87.7 percent of original size [2019-09-03 19:22:32,431 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-03 19:22:32,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:38 [2019-09-03 19:22:32,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:32,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:32,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:32,535 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:32,535 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-03 19:22:32,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:32,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:32,545 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-03 19:22:32,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-09-03 19:22:32,776 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:32,777 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-03 19:22:32,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:32,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:32,778 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-03 19:22:32,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:22:32,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:22:32,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:32,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 45 [2019-09-03 19:22:32,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:22:32,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:22:32,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1784, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:22:32,879 INFO L87 Difference]: Start difference. First operand 415 states and 507 transitions. Second operand 45 states. [2019-09-03 19:22:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:49,564 INFO L93 Difference]: Finished difference Result 521 states and 623 transitions. [2019-09-03 19:22:49,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:22:49,565 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 49 [2019-09-03 19:22:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:49,567 INFO L225 Difference]: With dead ends: 521 [2019-09-03 19:22:49,567 INFO L226 Difference]: Without dead ends: 519 [2019-09-03 19:22:49,568 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-03 19:22:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-09-03 19:22:49,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 449. [2019-09-03 19:22:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-03 19:22:49,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 546 transitions. [2019-09-03 19:22:49,638 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 546 transitions. Word has length 49 [2019-09-03 19:22:49,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:49,638 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 546 transitions. [2019-09-03 19:22:49,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:22:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 546 transitions. [2019-09-03 19:22:49,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 19:22:49,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:49,640 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-03 19:22:49,640 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:49,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:49,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1264339310, now seen corresponding path program 2 times [2019-09-03 19:22:49,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:49,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:49,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:49,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:49,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:50,156 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-03 19:22:50,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:50,156 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-03 19:22:50,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:22:50,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:22:50,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:50,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:22:50,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:50,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:50,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:50,359 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-03 19:22:50,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:50,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:50,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:22:50,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-09-03 19:22:50,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:50,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:50,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:50,468 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:50,469 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-03 19:22:50,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:50,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:50,478 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-03 19:22:50,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-09-03 19:22:50,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:50,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:50,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:50,572 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:50,572 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-03 19:22:50,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:50,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:50,579 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-03 19:22:50,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-03 19:22:50,804 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:50,804 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-03 19:22:50,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:50,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:50,806 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-03 19:22:50,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:22:50,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:50,864 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-03 19:22:50,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:50,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2019-09-03 19:22:50,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:22:50,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:22:50,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1339, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:22:50,869 INFO L87 Difference]: Start difference. First operand 449 states and 546 transitions. Second operand 39 states. [2019-09-03 19:23:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:23:14,530 INFO L93 Difference]: Finished difference Result 611 states and 732 transitions. [2019-09-03 19:23:14,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:23:14,530 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 50 [2019-09-03 19:23:14,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:23:14,533 INFO L225 Difference]: With dead ends: 611 [2019-09-03 19:23:14,533 INFO L226 Difference]: Without dead ends: 609 [2019-09-03 19:23:14,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=416, Invalid=3744, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:23:14,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-09-03 19:23:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 463. [2019-09-03 19:23:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-03 19:23:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 564 transitions. [2019-09-03 19:23:14,603 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 564 transitions. Word has length 50 [2019-09-03 19:23:14,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:23:14,603 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 564 transitions. [2019-09-03 19:23:14,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:23:14,603 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 564 transitions. [2019-09-03 19:23:14,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 19:23:14,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:23:14,605 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-03 19:23:14,605 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:23:14,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:23:14,605 INFO L82 PathProgramCache]: Analyzing trace with hash -891213096, now seen corresponding path program 3 times [2019-09-03 19:23:14,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:23:14,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:23:14,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:14,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:23:14,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:23:14,899 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-03 19:23:14,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:23:14,900 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) [2019-09-03 19:23:14,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:23:14,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:23:14,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:23:14,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:23:14,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:23:15,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:15,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:15,200 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-03 19:23:15,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:15,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:15,207 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-03 19:23:15,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2019-09-03 19:23:15,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:15,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:15,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:15,364 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:15,364 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-03 19:23:15,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:15,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:15,372 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-03 19:23:15,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-09-03 19:23:15,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:15,627 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-03 19:23:15,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:15,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:15,629 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-03 19:23:15,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:23:15,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:15,681 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-03 19:23:15,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:23:15,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 39 [2019-09-03 19:23:15,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:23:15,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:23:15,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:23:15,686 INFO L87 Difference]: Start difference. First operand 463 states and 564 transitions. Second operand 39 states. [2019-09-03 19:23:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:23:43,807 INFO L93 Difference]: Finished difference Result 766 states and 930 transitions. [2019-09-03 19:23:43,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:23:43,807 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 50 [2019-09-03 19:23:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:23:43,810 INFO L225 Difference]: With dead ends: 766 [2019-09-03 19:23:43,810 INFO L226 Difference]: Without dead ends: 764 [2019-09-03 19:23:43,811 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-03 19:23:43,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-03 19:23:43,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 512. [2019-09-03 19:23:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-03 19:23:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 626 transitions. [2019-09-03 19:23:43,901 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 626 transitions. Word has length 50 [2019-09-03 19:23:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:23:43,901 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 626 transitions. [2019-09-03 19:23:43,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:23:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 626 transitions. [2019-09-03 19:23:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 19:23:43,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:23:43,904 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-03 19:23:43,904 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:23:43,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:23:43,904 INFO L82 PathProgramCache]: Analyzing trace with hash -823375264, now seen corresponding path program 3 times [2019-09-03 19:23:43,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:23:43,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:23:43,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:43,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:23:43,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:23:44,497 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-03 19:23:44,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:23:44,498 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-03 19:23:44,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:23:44,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:23:44,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:23:44,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:23:44,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:23:44,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:44,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:44,715 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-03 19:23:44,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:44,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:44,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:44,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-09-03 19:23:44,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:44,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:44,813 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-03 19:23:44,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:44,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:44,820 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-03 19:23:44,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2019-09-03 19:23:44,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:44,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:44,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:44,928 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:44,928 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-03 19:23:44,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:44,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:44,940 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-03 19:23:44,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:24 [2019-09-03 19:23:45,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:45,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:45,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:45,014 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:45,014 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-03 19:23:45,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:45,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:45,023 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-03 19:23:45,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2019-09-03 19:23:45,270 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:45,271 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-03 19:23:45,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:45,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:45,273 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-03 19:23:45,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-03 19:23:45,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:45,359 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-03 19:23:45,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:23:45,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-09-03 19:23:45,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:23:45,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:23:45,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1636, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:23:45,364 INFO L87 Difference]: Start difference. First operand 512 states and 626 transitions. Second operand 43 states. [2019-09-03 19:23:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:23:47,520 INFO L93 Difference]: Finished difference Result 612 states and 739 transitions. [2019-09-03 19:23:47,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:23:47,520 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 50 [2019-09-03 19:23:47,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:23:47,523 INFO L225 Difference]: With dead ends: 612 [2019-09-03 19:23:47,523 INFO L226 Difference]: Without dead ends: 610 [2019-09-03 19:23:47,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=556, Invalid=4994, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 19:23:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-09-03 19:23:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 545. [2019-09-03 19:23:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-03 19:23:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 664 transitions. [2019-09-03 19:23:47,588 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 664 transitions. Word has length 50 [2019-09-03 19:23:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:23:47,588 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 664 transitions. [2019-09-03 19:23:47,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:23:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 664 transitions. [2019-09-03 19:23:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:23:47,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:23:47,590 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-03 19:23:47,590 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:23:47,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:23:47,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1007295364, now seen corresponding path program 4 times [2019-09-03 19:23:47,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:23:47,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:23:47,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:47,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:23:47,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:23:47,834 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-03 19:23:47,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:23:47,834 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) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:23:47,843 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:23:47,866 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:23:47,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:23:47,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:23:47,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:23:47,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:47,976 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-03 19:23:47,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:47,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:47,985 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-03 19:23:47,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-03 19:23:48,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:48,237 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-03 19:23:48,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:48,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:48,239 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-03 19:23:48,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:23:48,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:48,297 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-03 19:23:48,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:23:48,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2019-09-03 19:23:48,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:23:48,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:23:48,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:23:48,302 INFO L87 Difference]: Start difference. First operand 545 states and 664 transitions. Second operand 29 states. [2019-09-03 19:24:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:07,291 INFO L93 Difference]: Finished difference Result 681 states and 823 transitions. [2019-09-03 19:24:07,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:24:07,292 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-09-03 19:24:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:07,294 INFO L225 Difference]: With dead ends: 681 [2019-09-03 19:24:07,294 INFO L226 Difference]: Without dead ends: 679 [2019-09-03 19:24:07,295 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-03 19:24:07,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-09-03 19:24:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 554. [2019-09-03 19:24:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-09-03 19:24:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 676 transitions. [2019-09-03 19:24:07,385 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 676 transitions. Word has length 52 [2019-09-03 19:24:07,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:07,386 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 676 transitions. [2019-09-03 19:24:07,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:24:07,386 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 676 transitions. [2019-09-03 19:24:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-03 19:24:07,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:07,388 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-03 19:24:07,388 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:07,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:07,388 INFO L82 PathProgramCache]: Analyzing trace with hash 745072839, now seen corresponding path program 6 times [2019-09-03 19:24:07,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:07,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:07,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:07,744 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-03 19:24:07,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:07,744 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) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:07,755 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:24:07,806 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-03 19:24:07,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:07,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:24:07,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:07,882 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-03 19:24:07,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:07,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:07,888 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-03 19:24:07,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-09-03 19:24:07,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:08,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:08,028 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-03 19:24:08,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:08,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:08,036 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-03 19:24:08,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-09-03 19:24:08,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:08,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:08,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:08,145 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:08,146 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-03 19:24:08,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:08,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:08,154 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-03 19:24:08,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-09-03 19:24:08,476 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:08,477 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-03 19:24:08,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:08,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:08,479 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-03 19:24:08,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:24:08,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:08,536 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-03 19:24:08,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:08,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2019-09-03 19:24:08,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:24:08,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:24:08,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1275, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:24:08,542 INFO L87 Difference]: Start difference. First operand 554 states and 676 transitions. Second operand 38 states. [2019-09-03 19:24:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:32,576 INFO L93 Difference]: Finished difference Result 756 states and 910 transitions. [2019-09-03 19:24:32,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:24:32,577 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 53 [2019-09-03 19:24:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:32,580 INFO L225 Difference]: With dead ends: 756 [2019-09-03 19:24:32,580 INFO L226 Difference]: Without dead ends: 754 [2019-09-03 19:24:32,581 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-03 19:24:32,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-09-03 19:24:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 614. [2019-09-03 19:24:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-03 19:24:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 749 transitions. [2019-09-03 19:24:32,694 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 749 transitions. Word has length 53 [2019-09-03 19:24:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:32,694 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 749 transitions. [2019-09-03 19:24:32,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:24:32,694 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 749 transitions. [2019-09-03 19:24:32,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 19:24:32,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:32,696 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-03 19:24:32,697 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:32,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:32,697 INFO L82 PathProgramCache]: Analyzing trace with hash -175042453, now seen corresponding path program 7 times [2019-09-03 19:24:32,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:32,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:32,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:32,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:32,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:32,872 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-03 19:24:32,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:32,872 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-03 19:24:32,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:32,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:24:32,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:33,080 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-03 19:24:33,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:33,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2019-09-03 19:24:33,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:24:33,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:24:33,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:24:33,093 INFO L87 Difference]: Start difference. First operand 614 states and 749 transitions. Second operand 16 states. [2019-09-03 19:24:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:33,558 INFO L93 Difference]: Finished difference Result 865 states and 1044 transitions. [2019-09-03 19:24:33,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:24:33,559 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-09-03 19:24:33,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:33,562 INFO L225 Difference]: With dead ends: 865 [2019-09-03 19:24:33,562 INFO L226 Difference]: Without dead ends: 815 [2019-09-03 19:24:33,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:24:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2019-09-03 19:24:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 630. [2019-09-03 19:24:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-03 19:24:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 761 transitions. [2019-09-03 19:24:33,693 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 761 transitions. Word has length 55 [2019-09-03 19:24:33,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:33,694 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 761 transitions. [2019-09-03 19:24:33,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:24:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 761 transitions. [2019-09-03 19:24:33,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:24:33,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:33,696 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-03 19:24:33,696 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:33,696 INFO L82 PathProgramCache]: Analyzing trace with hash 892264603, now seen corresponding path program 3 times [2019-09-03 19:24:33,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:33,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:33,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:33,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:33,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:33,789 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-03 19:24:33,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:33,789 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-03 19:24:33,801 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-03 19:24:33,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 19:24:33,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:33,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:24:33,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:33,849 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-03 19:24:33,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:33,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-03 19:24:33,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:24:33,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:24:33,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:24:33,854 INFO L87 Difference]: Start difference. First operand 630 states and 761 transitions. Second operand 9 states. [2019-09-03 19:24:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:34,176 INFO L93 Difference]: Finished difference Result 1128 states and 1395 transitions. [2019-09-03 19:24:34,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:24:34,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-09-03 19:24:34,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:34,179 INFO L225 Difference]: With dead ends: 1128 [2019-09-03 19:24:34,180 INFO L226 Difference]: Without dead ends: 943 [2019-09-03 19:24:34,180 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-03 19:24:34,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-09-03 19:24:34,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 732. [2019-09-03 19:24:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-09-03 19:24:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 891 transitions. [2019-09-03 19:24:34,282 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 891 transitions. Word has length 52 [2019-09-03 19:24:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:34,282 INFO L475 AbstractCegarLoop]: Abstraction has 732 states and 891 transitions. [2019-09-03 19:24:34,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:24:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 891 transitions. [2019-09-03 19:24:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-03 19:24:34,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:34,284 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-03 19:24:34,284 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:34,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:34,284 INFO L82 PathProgramCache]: Analyzing trace with hash 441671596, now seen corresponding path program 4 times [2019-09-03 19:24:34,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:34,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:34,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:34,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:34,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:35,147 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-03 19:24:35,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:35,148 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-03 19:24:35,157 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:24:35,189 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:24:35,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:35,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:24:35,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:35,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:35,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:35,244 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-03 19:24:35,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:35,266 INFO L567 ElimStorePlain]: treesize reduction 7, result has 86.3 percent of original size [2019-09-03 19:24:35,266 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-03 19:24:35,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:41 [2019-09-03 19:24:35,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:35,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:35,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:35,385 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:35,385 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-03 19:24:35,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:35,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:35,398 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-03 19:24:35,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-03 19:24:35,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:35,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:35,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:35,508 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:35,508 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-03 19:24:35,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:35,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:35,518 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-03 19:24:35,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-03 19:24:35,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:35,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:35,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:35,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:35,616 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-03 19:24:35,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:35,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:35,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:35,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-03 19:24:35,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:35,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:35,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:35,816 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:35,816 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-03 19:24:35,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:35,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:35,827 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-03 19:24:35,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:26 [2019-09-03 19:24:35,878 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:35,879 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-03 19:24:35,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:35,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:35,881 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-03 19:24:35,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:24:35,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:35,955 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-03 19:24:35,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:35,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 36 [2019-09-03 19:24:35,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:24:35,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:24:35,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1101, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:24:35,969 INFO L87 Difference]: Start difference. First operand 732 states and 891 transitions. Second operand 36 states. [2019-09-03 19:24:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:39,408 INFO L93 Difference]: Finished difference Result 1151 states and 1418 transitions. [2019-09-03 19:24:39,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:24:39,409 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 53 [2019-09-03 19:24:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:39,413 INFO L225 Difference]: With dead ends: 1151 [2019-09-03 19:24:39,413 INFO L226 Difference]: Without dead ends: 1091 [2019-09-03 19:24:39,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 35 SyntacticMatches, 9 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=702, Invalid=4410, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:24:39,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-09-03 19:24:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 797. [2019-09-03 19:24:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-09-03 19:24:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 971 transitions. [2019-09-03 19:24:39,546 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 971 transitions. Word has length 53 [2019-09-03 19:24:39,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:39,547 INFO L475 AbstractCegarLoop]: Abstraction has 797 states and 971 transitions. [2019-09-03 19:24:39,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:24:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 971 transitions. [2019-09-03 19:24:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 19:24:39,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:39,549 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-03 19:24:39,549 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:39,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:39,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1983848057, now seen corresponding path program 1 times [2019-09-03 19:24:39,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:39,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:39,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:39,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:39,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:40,804 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-03 19:24:40,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:40,804 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-03 19:24:40,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:40,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:24:40,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:40,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:41,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,025 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-03 19:24:41,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:41,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:41,038 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-03 19:24:41,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-03 19:24:41,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03 19:24:41,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,099 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-03 19:24:41,099 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:41,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:41,105 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:41,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:41,116 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-03 19:24:41,116 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:23 [2019-09-03 19:24:41,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,330 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:24:41,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:41,333 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-03 19:24:41,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:41,370 INFO L567 ElimStorePlain]: treesize reduction 23, result has 68.5 percent of original size [2019-09-03 19:24:41,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:41,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:45 [2019-09-03 19:24:41,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,544 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:24:41,546 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:41,547 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-03 19:24:41,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:41,569 INFO L567 ElimStorePlain]: treesize reduction 18, result has 71.9 percent of original size [2019-09-03 19:24:41,569 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-03 19:24:41,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:46 [2019-09-03 19:24:41,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,749 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:24:41,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:41,779 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:41,780 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-03 19:24:41,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:41,826 INFO L567 ElimStorePlain]: treesize reduction 75, result has 48.6 percent of original size [2019-09-03 19:24:41,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:41,828 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-03 19:24:41,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:92 [2019-09-03 19:24:42,178 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:42,179 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-03 19:24:42,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:42,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:42,181 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-03 19:24:42,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:24:42,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:42,248 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-03 19:24:42,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:42,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 48 [2019-09-03 19:24:42,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:24:42,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:24:42,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1957, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:24:42,252 INFO L87 Difference]: Start difference. First operand 797 states and 971 transitions. Second operand 48 states. [2019-09-03 19:25:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:25:19,903 INFO L93 Difference]: Finished difference Result 1017 states and 1233 transitions. [2019-09-03 19:25:19,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:25:19,903 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 54 [2019-09-03 19:25:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:25:19,907 INFO L225 Difference]: With dead ends: 1017 [2019-09-03 19:25:19,907 INFO L226 Difference]: Without dead ends: 1015 [2019-09-03 19:25:19,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 25 SyntacticMatches, 11 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3155 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1161, Invalid=7029, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 19:25:19,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-09-03 19:25:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 857. [2019-09-03 19:25:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-09-03 19:25:20,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1038 transitions. [2019-09-03 19:25:20,044 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1038 transitions. Word has length 54 [2019-09-03 19:25:20,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:25:20,044 INFO L475 AbstractCegarLoop]: Abstraction has 857 states and 1038 transitions. [2019-09-03 19:25:20,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:25:20,045 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1038 transitions. [2019-09-03 19:25:20,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 19:25:20,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:25:20,047 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-03 19:25:20,047 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:25:20,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:25:20,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2098824215, now seen corresponding path program 4 times [2019-09-03 19:25:20,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:25:20,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:25:20,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:20,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:25:20,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:21,517 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-03 19:25:21,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:21,518 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-03 19:25:21,528 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:25:21,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:25:21,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:25:21,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:25:21,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:21,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:21,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:21,704 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-03 19:25:21,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:21,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:21,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:25:21,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-09-03 19:25:21,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:21,918 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:21,919 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-03 19:25:21,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:21,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:21,933 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-03 19:25:21,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:41 [2019-09-03 19:25:21,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:21,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:22,035 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:22,036 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-03 19:25:22,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:22,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:22,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:22,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:22,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:22,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:22,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:22,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:22,155 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2019-09-03 19:25:22,155 INFO L567 ElimStorePlain]: treesize reduction 220, result has 25.2 percent of original size [2019-09-03 19:25:22,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:25:22,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:73 [2019-09-03 19:25:22,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:22,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:22,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:22,465 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:25:22,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:22,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:22,467 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:25:22,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:22,471 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-03 19:25:22,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:22,501 INFO L567 ElimStorePlain]: treesize reduction 37, result has 59.3 percent of original size [2019-09-03 19:25:22,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:25:22,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:54 [2019-09-03 19:25:22,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:22,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:22,612 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:25:22,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:22,614 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:22,614 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-03 19:25:22,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:22,644 INFO L567 ElimStorePlain]: treesize reduction 7, result has 88.3 percent of original size [2019-09-03 19:25:22,644 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-03 19:25:22,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:41 [2019-09-03 19:25:22,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:22,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:22,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:22,771 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:22,771 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-03 19:25:22,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:22,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:22,782 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-03 19:25:22,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2019-09-03 19:25:23,032 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:23,032 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-03 19:25:23,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:23,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:23,034 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-03 19:25:23,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-03 19:25:23,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:23,116 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-03 19:25:23,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:23,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 51 [2019-09-03 19:25:23,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:25:23,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:25:23,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2322, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:25:23,121 INFO L87 Difference]: Start difference. First operand 857 states and 1038 transitions. Second operand 51 states. [2019-09-03 19:25:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:25:26,135 INFO L93 Difference]: Finished difference Result 915 states and 1100 transitions. [2019-09-03 19:25:26,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:25:26,135 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 54 [2019-09-03 19:25:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:25:26,139 INFO L225 Difference]: With dead ends: 915 [2019-09-03 19:25:26,139 INFO L226 Difference]: Without dead ends: 902 [2019-09-03 19:25:26,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2150 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=518, Invalid=5644, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:25:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-09-03 19:25:26,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 788. [2019-09-03 19:25:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-09-03 19:25:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 960 transitions. [2019-09-03 19:25:26,252 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 960 transitions. Word has length 54 [2019-09-03 19:25:26,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:25:26,252 INFO L475 AbstractCegarLoop]: Abstraction has 788 states and 960 transitions. [2019-09-03 19:25:26,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:25:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 960 transitions. [2019-09-03 19:25:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 19:25:26,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:25:26,254 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-03 19:25:26,255 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:25:26,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:25:26,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2049125808, now seen corresponding path program 5 times [2019-09-03 19:25:26,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:25:26,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:25:26,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:26,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:25:26,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:26,662 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-03 19:25:26,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:26,662 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-03 19:25:26,709 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-03 19:25:26,762 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 19:25:26,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:25:26,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:25:26,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:26,907 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-03 19:25:26,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:26,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:26,913 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-03 19:25:26,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-09-03 19:25:26,992 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-03 19:25:26,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:27,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:27,003 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-03 19:25:27,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:10 [2019-09-03 19:25:27,062 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-03 19:25:27,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:27,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:27,072 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-03 19:25:27,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:10 [2019-09-03 19:25:27,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:27,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:27,264 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-03 19:25:27,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:27,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:27,276 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-03 19:25:27,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-09-03 19:25:27,590 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:25:27,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:27,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:27,592 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:25:27,596 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:27,596 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-03 19:25:27,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:27,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:27,603 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-03 19:25:27,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2019-09-03 19:25:27,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:27,664 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-03 19:25:27,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:27,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26] total 42 [2019-09-03 19:25:27,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:25:27,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:25:27,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1593, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:25:27,668 INFO L87 Difference]: Start difference. First operand 788 states and 960 transitions. Second operand 42 states. [2019-09-03 19:26:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:04,707 INFO L93 Difference]: Finished difference Result 1331 states and 1617 transitions. [2019-09-03 19:26:04,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 19:26:04,708 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 55 [2019-09-03 19:26:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:04,711 INFO L225 Difference]: With dead ends: 1331 [2019-09-03 19:26:04,711 INFO L226 Difference]: Without dead ends: 1174 [2019-09-03 19:26:04,712 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-03 19:26:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-09-03 19:26:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 829. [2019-09-03 19:26:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-03 19:26:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1003 transitions. [2019-09-03 19:26:04,848 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1003 transitions. Word has length 55 [2019-09-03 19:26:04,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:04,848 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1003 transitions. [2019-09-03 19:26:04,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:26:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1003 transitions. [2019-09-03 19:26:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 19:26:04,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:04,850 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-03 19:26:04,850 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:04,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:04,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1811316562, now seen corresponding path program 2 times [2019-09-03 19:26:04,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:04,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:04,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:04,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:04,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:05,238 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-03 19:26:05,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:05,239 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-03 19:26:05,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:26:05,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:26:05,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:05,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:26:05,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:05,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:05,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:05,540 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-03 19:26:05,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:05,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:05,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:26:05,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:49 [2019-09-03 19:26:05,865 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:05,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:05,871 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:05,871 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-03 19:26:05,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:05,911 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-09-03 19:26:05,912 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-03 19:26:05,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:73, output treesize:43 [2019-09-03 19:26:06,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:06,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:06,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:06,164 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:06,164 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-03 19:26:06,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:06,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:06,187 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-03 19:26:06,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:38 [2019-09-03 19:26:06,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:06,666 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:06,666 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:06,671 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:06,671 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-03 19:26:06,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:06,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:06,678 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-03 19:26:06,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:5 [2019-09-03 19:26:06,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:06,747 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-03 19:26:06,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:06,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26] total 43 [2019-09-03 19:26:06,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:26:06,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:26:06,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1626, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:26:06,752 INFO L87 Difference]: Start difference. First operand 829 states and 1003 transitions. Second operand 43 states. [2019-09-03 19:26:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:11,640 INFO L93 Difference]: Finished difference Result 1127 states and 1364 transitions. [2019-09-03 19:26:11,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 19:26:11,641 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 55 [2019-09-03 19:26:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:11,645 INFO L225 Difference]: With dead ends: 1127 [2019-09-03 19:26:11,645 INFO L226 Difference]: Without dead ends: 1036 [2019-09-03 19:26:11,646 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-03 19:26:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-09-03 19:26:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 860. [2019-09-03 19:26:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-09-03 19:26:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1037 transitions. [2019-09-03 19:26:11,810 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1037 transitions. Word has length 55 [2019-09-03 19:26:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:11,811 INFO L475 AbstractCegarLoop]: Abstraction has 860 states and 1037 transitions. [2019-09-03 19:26:11,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:26:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1037 transitions. [2019-09-03 19:26:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:26:11,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:11,812 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-03 19:26:11,813 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:11,813 INFO L82 PathProgramCache]: Analyzing trace with hash 402369951, now seen corresponding path program 6 times [2019-09-03 19:26:11,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:11,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:11,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:11,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:11,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:12,361 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-03 19:26:12,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:12,361 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) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:12,371 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:26:12,408 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:26:12,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:12,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:26:12,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:12,461 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-03 19:26:12,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:12,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:12,468 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-03 19:26:12,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-09-03 19:26:12,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:12,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:12,630 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:12,631 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:12,631 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-03 19:26:12,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:12,644 INFO L567 ElimStorePlain]: treesize reduction 19, result has 58.7 percent of original size [2019-09-03 19:26:12,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:26:12,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:27 [2019-09-03 19:26:12,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:12,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:12,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:12,756 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:12,756 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-03 19:26:12,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:12,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:12,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:26:12,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:28 [2019-09-03 19:26:12,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:12,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:12,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:12,858 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:12,858 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-03 19:26:12,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:12,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:12,868 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-03 19:26:12,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-09-03 19:26:12,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:12,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:12,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:12,999 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:13,000 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-03 19:26:13,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:13,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:13,009 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-03 19:26:13,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-09-03 19:26:13,261 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:13,262 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-03 19:26:13,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:13,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:13,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-03 19:26:13,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:26:13,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:13,333 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-03 19:26:13,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:13,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2019-09-03 19:26:13,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:26:13,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:26:13,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1783, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:26:13,337 INFO L87 Difference]: Start difference. First operand 860 states and 1037 transitions. Second operand 45 states. [2019-09-03 19:26:42,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:42,114 INFO L93 Difference]: Finished difference Result 1093 states and 1310 transitions. [2019-09-03 19:26:42,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:26:42,114 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 56 [2019-09-03 19:26:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:42,118 INFO L225 Difference]: With dead ends: 1093 [2019-09-03 19:26:42,118 INFO L226 Difference]: Without dead ends: 1091 [2019-09-03 19:26:42,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=713, Invalid=4987, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:26:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-09-03 19:26:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 909. [2019-09-03 19:26:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-03 19:26:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1098 transitions. [2019-09-03 19:26:42,280 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1098 transitions. Word has length 56 [2019-09-03 19:26:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:42,280 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1098 transitions. [2019-09-03 19:26:42,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:26:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1098 transitions. [2019-09-03 19:26:42,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-03 19:26:42,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:42,282 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-03 19:26:42,282 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:42,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:42,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1963459190, now seen corresponding path program 3 times [2019-09-03 19:26:42,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:42,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:42,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:42,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:42,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 19:26:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 19:26:42,338 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-03 19:26:42,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:26:42 BoogieIcfgContainer [2019-09-03 19:26:42,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:26:42,388 INFO L168 Benchmark]: Toolchain (without parser) took 413820.39 ms. Allocated memory was 140.0 MB in the beginning and 298.8 MB in the end (delta: 158.9 MB). Free memory was 87.2 MB in the beginning and 142.6 MB in the end (delta: -55.4 MB). Peak memory consumption was 103.5 MB. Max. memory is 7.1 GB. [2019-09-03 19:26:42,388 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:26:42,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.94 ms. Allocated memory is still 140.0 MB. Free memory was 87.0 MB in the beginning and 77.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-09-03 19:26:42,389 INFO L168 Benchmark]: Boogie Preprocessor took 133.88 ms. Allocated memory was 140.0 MB in the beginning and 199.2 MB in the end (delta: 59.2 MB). Free memory was 77.1 MB in the beginning and 176.0 MB in the end (delta: -99.0 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-09-03 19:26:42,389 INFO L168 Benchmark]: RCFGBuilder took 321.40 ms. Allocated memory is still 199.2 MB. Free memory was 176.0 MB in the beginning and 160.4 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-09-03 19:26:42,390 INFO L168 Benchmark]: TraceAbstraction took 413123.25 ms. Allocated memory was 199.2 MB in the beginning and 298.8 MB in the end (delta: 99.6 MB). Free memory was 160.4 MB in the beginning and 142.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 117.4 MB. Max. memory is 7.1 GB. [2019-09-03 19:26:42,393 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.22 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 234.94 ms. Allocated memory is still 140.0 MB. Free memory was 87.0 MB in the beginning and 77.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.88 ms. Allocated memory was 140.0 MB in the beginning and 199.2 MB in the end (delta: 59.2 MB). Free memory was 77.1 MB in the beginning and 176.0 MB in the end (delta: -99.0 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 321.40 ms. Allocated memory is still 199.2 MB. Free memory was 176.0 MB in the beginning and 160.4 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 413123.25 ms. Allocated memory was 199.2 MB in the beginning and 298.8 MB in the end (delta: 99.6 MB). Free memory was 160.4 MB in the beginning and 142.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 117.4 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