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/sum_array-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:20:59,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:20:59,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:20:59,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:20:59,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:20:59,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:20:59,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:20:59,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:20:59,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:20:59,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:20:59,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:20:59,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:20:59,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:20:59,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:20:59,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:20:59,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:20:59,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:20:59,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:20:59,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:20:59,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:20:59,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:20:59,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:20:59,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:20:59,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:20:59,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:20:59,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:20:59,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:20:59,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:20:59,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:20:59,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:20:59,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:20:59,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:20:59,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:20:59,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:20:59,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:20:59,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:20:59,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:20:59,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:20:59,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:20:59,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:20:59,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:20:59,776 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:20:59,792 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:20:59,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:20:59,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:20:59,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:20:59,794 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:20:59,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:20:59,795 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:20:59,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:20:59,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:20:59,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:20:59,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:20:59,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:20:59,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:20:59,796 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:20:59,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:20:59,796 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:20:59,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:20:59,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:20:59,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:20:59,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:20:59,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:20:59,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:20:59,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:20:59,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:20:59,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:20:59,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:20:59,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:20:59,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:20:59,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:20:59,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:20:59,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:20:59,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:20:59,854 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:20:59,854 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:20:59,855 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum_array-2.i [2019-09-03 19:20:59,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ca8ab8d/212a85719af245cc8024352ecd101454/FLAGf9d8e106f [2019-09-03 19:21:00,457 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:21:00,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-2.i [2019-09-03 19:21:00,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ca8ab8d/212a85719af245cc8024352ecd101454/FLAGf9d8e106f [2019-09-03 19:21:00,801 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ca8ab8d/212a85719af245cc8024352ecd101454 [2019-09-03 19:21:00,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:21:00,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:21:00,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:21:00,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:21:00,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:21:00,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:21:00" (1/1) ... [2019-09-03 19:21:00,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49beeaaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:21:00, skipping insertion in model container [2019-09-03 19:21:00,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:21:00" (1/1) ... [2019-09-03 19:21:00,833 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:21:00,853 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:21:01,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:21:01,063 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:21:01,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:21:01,117 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:21:01,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:21:01 WrapperNode [2019-09-03 19:21:01,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:21:01,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:21:01,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:21:01,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:21:01,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:21:01" (1/1) ... [2019-09-03 19:21:01,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:21:01" (1/1) ... [2019-09-03 19:21:01,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:21:01" (1/1) ... [2019-09-03 19:21:01,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:21:01" (1/1) ... [2019-09-03 19:21:01,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:21:01" (1/1) ... [2019-09-03 19:21:01,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:21:01" (1/1) ... [2019-09-03 19:21:01,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:21:01" (1/1) ... [2019-09-03 19:21:01,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:21:01,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:21:01,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:21:01,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:21:01,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:21:01" (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:21:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:21:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:21:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:21:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:21:01,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:21:01,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:21:01,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:21:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:21:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 19:21:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:21:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 19:21:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:21:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:21:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:21:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:21:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:21:01,664 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:21:01,664 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-03 19:21:01,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:21:01 BoogieIcfgContainer [2019-09-03 19:21:01,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:21:01,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:21:01,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:21:01,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:21:01,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:21:00" (1/3) ... [2019-09-03 19:21:01,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34472b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:21:01, skipping insertion in model container [2019-09-03 19:21:01,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:21:01" (2/3) ... [2019-09-03 19:21:01,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34472b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:21:01, skipping insertion in model container [2019-09-03 19:21:01,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:21:01" (3/3) ... [2019-09-03 19:21:01,676 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_array-2.i [2019-09-03 19:21:01,687 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:21:01,696 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:21:01,714 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:21:01,745 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:21:01,745 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:21:01,746 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:21:01,746 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:21:01,746 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:21:01,746 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:21:01,746 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:21:01,746 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:21:01,747 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:21:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-09-03 19:21:01,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:21:01,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:01,775 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:21:01,778 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:01,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:01,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1823924036, now seen corresponding path program 1 times [2019-09-03 19:21:01,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:01,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:01,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:01,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:21:01,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:01,931 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:21:01,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:21:01,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:21:01,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:21:01,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:21:01,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:21:01,955 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-09-03 19:21:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:01,979 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-09-03 19:21:01,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:21:01,980 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-09-03 19:21:01,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:01,989 INFO L225 Difference]: With dead ends: 55 [2019-09-03 19:21:01,990 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 19:21:01,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:21:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 19:21:02,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-03 19:21:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 19:21:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-03 19:21:02,038 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2019-09-03 19:21:02,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:02,039 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-03 19:21:02,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:21:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-03 19:21:02,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:21:02,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:02,040 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:21:02,041 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:02,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:02,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1169658974, now seen corresponding path program 1 times [2019-09-03 19:21:02,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:02,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:02,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:02,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:21:02,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:02,223 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:21:02,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:21:02,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:21:02,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:21:02,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:21:02,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:21:02,229 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2019-09-03 19:21:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:02,363 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-09-03 19:21:02,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:21:02,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-03 19:21:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:02,367 INFO L225 Difference]: With dead ends: 62 [2019-09-03 19:21:02,368 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 19:21:02,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:21:02,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 19:21:02,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2019-09-03 19:21:02,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 19:21:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-09-03 19:21:02,381 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2019-09-03 19:21:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:02,382 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-09-03 19:21:02,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:21:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-09-03 19:21:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 19:21:02,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:02,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 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:21:02,384 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:02,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1835570138, now seen corresponding path program 1 times [2019-09-03 19:21:02,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:02,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:02,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:02,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:21:02,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:03,160 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 26 [2019-09-03 19:21:03,402 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 33 [2019-09-03 19:21:03,657 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 37 [2019-09-03 19:21:03,937 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 35 [2019-09-03 19:21:03,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:21:03,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:03,988 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:21:04,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:21:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:04,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:21:04,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:04,161 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:04,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-09-03 19:21:04,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:04,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:04,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:04,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2019-09-03 19:21:04,247 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 0 case distinctions, treesize of input 21 treesize of output 24 [2019-09-03 19:21:04,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:04,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:04,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:04,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-09-03 19:21:04,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-09-03 19:21:04,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:04,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:04,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:04,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:51, output treesize:5 [2019-09-03 19:21:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 19:21:04,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:04,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2019-09-03 19:21:04,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:21:04,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:21:04,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:21:04,460 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 19 states. [2019-09-03 19:21:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:05,194 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-09-03 19:21:05,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:21:05,195 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-03 19:21:05,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:05,197 INFO L225 Difference]: With dead ends: 63 [2019-09-03 19:21:05,197 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 19:21:05,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:21:05,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 19:21:05,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-09-03 19:21:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:21:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-09-03 19:21:05,217 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 25 [2019-09-03 19:21:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:05,217 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-09-03 19:21:05,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:21:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-09-03 19:21:05,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:21:05,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:05,223 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 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:21:05,224 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:05,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:05,225 INFO L82 PathProgramCache]: Analyzing trace with hash 997765806, now seen corresponding path program 1 times [2019-09-03 19:21:05,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:05,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:05,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:05,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:21:05,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 19:21:05,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:05,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:21:05,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:21:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:05,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:21:05,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 19:21:05,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:05,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-03 19:21:05,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:21:05,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:21:05,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:21:05,573 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 11 states. [2019-09-03 19:21:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:05,726 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-09-03 19:21:05,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:21:05,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-09-03 19:21:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:05,729 INFO L225 Difference]: With dead ends: 76 [2019-09-03 19:21:05,729 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 19:21:05,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:21:05,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 19:21:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2019-09-03 19:21:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 19:21:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-09-03 19:21:05,748 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 36 [2019-09-03 19:21:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:05,749 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-09-03 19:21:05,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:21:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-09-03 19:21:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 19:21:05,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:05,753 INFO L399 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2019-09-03 19:21:05,753 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:05,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:05,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1913486187, now seen corresponding path program 2 times [2019-09-03 19:21:05,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:05,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:05,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:05,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:21:05,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:06,460 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 44 [2019-09-03 19:21:06,717 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 39 [2019-09-03 19:21:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 19:21:06,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:06,763 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:21:06,790 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:21:06,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:21:06,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:06,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:21:06,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:06,849 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:06,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-09-03 19:21:06,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:06,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:06,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:06,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-09-03 19:21:06,952 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 0 case distinctions, treesize of input 27 treesize of output 30 [2019-09-03 19:21:06,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:06,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:06,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:06,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-09-03 19:21:09,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 15 [2019-09-03 19:21:09,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:09,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:09,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:09,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:55, output treesize:5 [2019-09-03 19:21:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 19:21:09,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:09,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2019-09-03 19:21:09,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:21:09,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:21:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=441, Unknown=1, NotChecked=0, Total=506 [2019-09-03 19:21:09,469 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 23 states. [2019-09-03 19:21:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:10,905 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-09-03 19:21:10,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:21:10,906 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 41 [2019-09-03 19:21:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:10,908 INFO L225 Difference]: With dead ends: 61 [2019-09-03 19:21:10,908 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 19:21:10,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=197, Invalid=1062, Unknown=1, NotChecked=0, Total=1260 [2019-09-03 19:21:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 19:21:10,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2019-09-03 19:21:10,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 19:21:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-09-03 19:21:10,919 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 41 [2019-09-03 19:21:10,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:10,919 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-09-03 19:21:10,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:21:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-09-03 19:21:10,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 19:21:10,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:10,921 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 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:21:10,921 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:10,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:10,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1115964468, now seen corresponding path program 3 times [2019-09-03 19:21:10,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:10,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:10,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:10,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:21:10,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-03 19:21:11,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:11,098 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:21:11,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:21:11,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 19:21:11,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:11,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:21:11,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-03 19:21:11,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:11,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-09-03 19:21:11,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:21:11,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:21:11,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:21:11,240 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 12 states. [2019-09-03 19:21:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:11,519 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2019-09-03 19:21:11,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:21:11,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2019-09-03 19:21:11,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:11,521 INFO L225 Difference]: With dead ends: 129 [2019-09-03 19:21:11,521 INFO L226 Difference]: Without dead ends: 71 [2019-09-03 19:21:11,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:21:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-03 19:21:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2019-09-03 19:21:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 19:21:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-09-03 19:21:11,532 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 49 [2019-09-03 19:21:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:11,533 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-09-03 19:21:11,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:21:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-09-03 19:21:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-03 19:21:11,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:11,535 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1] [2019-09-03 19:21:11,535 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:11,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:11,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1071400400, now seen corresponding path program 4 times [2019-09-03 19:21:11,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:11,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:11,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:11,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:21:11,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:12,145 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2019-09-03 19:21:12,727 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 43 [2019-09-03 19:21:12,923 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 49 [2019-09-03 19:21:13,369 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 40 [2019-09-03 19:21:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 41 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:21:13,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:13,448 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:21:13,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:21:13,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:21:13,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:13,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:21:13,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:13,536 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:13,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-09-03 19:21:13,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:13,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:13,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:13,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-09-03 19:21:13,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-03 19:21:13,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:13,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:13,720 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:13,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-03 19:21:13,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2019-09-03 19:21:13,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:13,771 INFO L567 ElimStorePlain]: treesize reduction 70, result has 42.1 percent of original size [2019-09-03 19:21:13,771 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_13| vanished before elimination [2019-09-03 19:21:13,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:13,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:125, output treesize:51 [2019-09-03 19:21:13,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:13,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:13,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:13,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:13,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 112 [2019-09-03 19:21:13,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:13,919 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:21:13,919 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:13,953 INFO L567 ElimStorePlain]: treesize reduction 5, result has 94.8 percent of original size [2019-09-03 19:21:13,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:13,954 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:207, output treesize:92 [2019-09-03 19:21:14,133 INFO L341 Elim1Store]: treesize reduction 124, result has 12.1 percent of original size [2019-09-03 19:21:14,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 88 [2019-09-03 19:21:14,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:14,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:14,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:14,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:76 [2019-09-03 19:21:16,403 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#C~0.base_BEFORE_CALL_2| Int) (|v_main_~#C~0.offset_BEFORE_CALL_2| Int) (|v_main_~#B~0.offset_BEFORE_CALL_2| Int) (|v_main_~#B~0.base_BEFORE_CALL_2| Int) (|v_main_~#A~0.offset_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_2|)) (.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_2|)) (.cse2 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|))) (and (not (= |v_main_~#C~0.base_BEFORE_CALL_2| |v_main_~#B~0.base_BEFORE_CALL_2|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_2| 8)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_2| 8)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_2| 8)))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_2| 4)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_2| 4)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_2| 4)))) (= (select .cse0 |v_main_~#C~0.offset_BEFORE_CALL_2|) (+ (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_2|) (select .cse2 |v_main_~#A~0.offset_BEFORE_CALL_2|))) (not (= |v_main_~#A~0.base_BEFORE_CALL_2| |v_main_~#C~0.base_BEFORE_CALL_2|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_2| |v_main_~#B~0.base_BEFORE_CALL_2|))))) is different from true [2019-09-03 19:21:18,513 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 45 [2019-09-03 19:21:37,854 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 41 [2019-09-03 19:21:38,065 INFO L341 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2019-09-03 19:21:38,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 91 treesize of output 25 [2019-09-03 19:21:38,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:38,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:38,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:38,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:103, output treesize:5 [2019-09-03 19:21:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2019-09-03 19:21:38,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:38,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 36 [2019-09-03 19:21:38,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:21:38,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:21:38,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1069, Unknown=8, NotChecked=66, Total=1260 [2019-09-03 19:21:38,169 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 36 states. [2019-09-03 19:22:25,415 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 62 [2019-09-03 19:22:36,694 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2019-09-03 19:22:41,121 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-03 19:23:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:23:21,002 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2019-09-03 19:23:21,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:23:21,039 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 57 [2019-09-03 19:23:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:23:21,041 INFO L225 Difference]: With dead ends: 130 [2019-09-03 19:23:21,041 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 19:23:21,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 41 SyntacticMatches, 10 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 54.2s TimeCoverageRelationStatistics Valid=628, Invalid=4186, Unknown=20, NotChecked=136, Total=4970 [2019-09-03 19:23:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 19:23:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 68. [2019-09-03 19:23:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-03 19:23:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-09-03 19:23:21,063 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 57 [2019-09-03 19:23:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:23:21,063 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-09-03 19:23:21,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:23:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-09-03 19:23:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-03 19:23:21,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:23:21,065 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:23:21,065 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:23:21,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:23:21,065 INFO L82 PathProgramCache]: Analyzing trace with hash 970592775, now seen corresponding path program 5 times [2019-09-03 19:23:21,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:23:21,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:23:21,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:21,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:23:21,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:23:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-03 19:23:21,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:23:21,290 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:23:21,300 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:23:39,712 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 19:23:39,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:23:39,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:23:39,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:23:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-03 19:23:39,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:23:39,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2019-09-03 19:23:39,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:23:39,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:23:39,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:23:39,890 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 15 states. [2019-09-03 19:23:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:23:40,335 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2019-09-03 19:23:40,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:23:40,335 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-09-03 19:23:40,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:23:40,336 INFO L225 Difference]: With dead ends: 164 [2019-09-03 19:23:40,337 INFO L226 Difference]: Without dead ends: 87 [2019-09-03 19:23:40,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:23:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-03 19:23:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2019-09-03 19:23:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-03 19:23:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-09-03 19:23:40,350 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 65 [2019-09-03 19:23:40,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:23:40,350 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-09-03 19:23:40,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:23:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-09-03 19:23:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-03 19:23:40,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:23:40,352 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:23:40,352 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:23:40,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:23:40,352 INFO L82 PathProgramCache]: Analyzing trace with hash -639892289, now seen corresponding path program 6 times [2019-09-03 19:23:40,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:23:40,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:23:40,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:40,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:23:40,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:23:41,098 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 47 [2019-09-03 19:23:41,544 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 50 [2019-09-03 19:23:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-03 19:23:41,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:23:41,636 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:23:41,651 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:23:42,104 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-03 19:23:42,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:23:42,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 19:23:42,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:23:42,120 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:42,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-09-03 19:23:42,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:42,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-09-03 19:23:42,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-03 19:23:42,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:42,243 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:42,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-03 19:23:42,284 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:23:42,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,307 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-09-03 19:23:42,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:23:42,314 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:42,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,324 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-03 19:23:42,334 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:23:42,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,364 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-09-03 19:23:42,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:23:42,369 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:42,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,380 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-03 19:23:42,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-09-03 19:23:42,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,427 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-09-03 19:23:42,427 INFO L464 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2019-09-03 19:23:42,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-03 19:23:42,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-03 19:23:42,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:42,445 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:42,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-03 19:23:42,462 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 0 case distinctions, treesize of input 60 treesize of output 62 [2019-09-03 19:23:42,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,501 INFO L567 ElimStorePlain]: treesize reduction 70, result has 42.1 percent of original size [2019-09-03 19:23:42,501 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_21| vanished before elimination [2019-09-03 19:23:42,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:125, output treesize:51 [2019-09-03 19:23:42,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:42,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:42,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:42,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:42,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 112 [2019-09-03 19:23:42,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,631 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:23:42,631 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,666 INFO L567 ElimStorePlain]: treesize reduction 5, result has 94.8 percent of original size [2019-09-03 19:23:42,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,667 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:207, output treesize:92 [2019-09-03 19:23:42,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:42,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:42,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:42,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:42,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:42,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:42,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:42,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:42,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:42,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:42,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 162 [2019-09-03 19:23:42,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,880 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:23:42,880 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,935 INFO L567 ElimStorePlain]: treesize reduction 5, result has 96.4 percent of original size [2019-09-03 19:23:42,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:42,936 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:289, output treesize:133 [2019-09-03 19:23:43,169 INFO L341 Elim1Store]: treesize reduction 242, result has 9.7 percent of original size [2019-09-03 19:23:43,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 3 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 18 case distinctions, treesize of input 91 treesize of output 120 [2019-09-03 19:23:43,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:43,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:43,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:43,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:99 [2019-09-03 19:23:45,450 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#B~0.base_BEFORE_CALL_4| Int) (|v_main_~#C~0.offset_BEFORE_CALL_4| Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#B~0.offset_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (|v_main_~#C~0.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_4|)) (.cse0 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|)) (.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_4|))) (and (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_4| 12)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_4| 12))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_4| 12))) (not (= |v_main_~#C~0.base_BEFORE_CALL_4| |v_main_~#B~0.base_BEFORE_CALL_4|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_4| 4)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_4| 4)) (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_4| 4)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_4| |v_main_~#C~0.base_BEFORE_CALL_4|)) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_4| 8)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_4| 8))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_4| 8))) (= (+ (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_4|) (select .cse0 |v_main_~#A~0.offset_BEFORE_CALL_4|)) (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_4|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_4| |v_main_~#B~0.base_BEFORE_CALL_4|))))) is different from true [2019-09-03 19:23:47,771 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#C~0.offset_BEFORE_CALL_5| Int) (|v_main_~#B~0.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int) (|v_main_~#B~0.offset_BEFORE_CALL_5| Int) (|v_main_~#C~0.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_5|)) (.cse0 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|)) (.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_5|))) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_5| |v_main_~#C~0.base_BEFORE_CALL_5|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_5| |v_main_~#B~0.base_BEFORE_CALL_5|)) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_5| 4)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_5| 4))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_5| 4))) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_5| 8)) (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_5| 8))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_5| 8))) (not (= |v_main_~#C~0.base_BEFORE_CALL_5| |v_main_~#B~0.base_BEFORE_CALL_5|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_5| 12)) (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_5| 12)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_5| 12)))) (= (+ (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_5|) (select .cse0 |v_main_~#A~0.offset_BEFORE_CALL_5|)) (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_5|))))) is different from true [2019-09-03 19:23:50,177 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#C~0.offset_BEFORE_CALL_6| Int) (|v_main_~#B~0.base_BEFORE_CALL_6| Int) (|v_main_~#B~0.offset_BEFORE_CALL_6| Int) (|v_main_~#C~0.base_BEFORE_CALL_6| Int) (|v_main_~#A~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_6|)) (.cse2 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|)) (.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_6|))) (and (= (select .cse0 |v_main_~#C~0.offset_BEFORE_CALL_6|) (+ (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_6|) (select .cse2 |v_main_~#A~0.offset_BEFORE_CALL_6|))) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_6| 4)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_6| 4))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_6| 4))) (not (= |v_main_~#A~0.base_BEFORE_CALL_6| |v_main_~#C~0.base_BEFORE_CALL_6|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_6| 12)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_6| 12)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_6| 12)))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_6| 8)) (+ (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_6| 8)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_6| 8)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_6| |v_main_~#B~0.base_BEFORE_CALL_6|)) (not (= |v_main_~#C~0.base_BEFORE_CALL_6| |v_main_~#B~0.base_BEFORE_CALL_6|))))) is different from true [2019-09-03 19:23:50,691 INFO L341 Elim1Store]: treesize reduction 198, result has 0.5 percent of original size [2019-09-03 19:23:50,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 3 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 18 case distinctions, treesize of input 114 treesize of output 30 [2019-09-03 19:23:50,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:50,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:50,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:50,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:126, output treesize:5 [2019-09-03 19:23:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2019-09-03 19:23:50,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:23:50,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26] total 39 [2019-09-03 19:23:50,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:23:50,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:23:50,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1138, Unknown=3, NotChecked=210, Total=1482 [2019-09-03 19:23:50,890 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 39 states. [2019-09-03 19:23:56,596 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-09-03 19:23:58,869 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-03 19:24:00,156 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2019-09-03 19:24:00,345 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 60 [2019-09-03 19:24:05,029 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 58 [2019-09-03 19:24:05,221 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 63 [2019-09-03 19:24:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:07,848 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2019-09-03 19:24:07,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:24:07,850 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 73 [2019-09-03 19:24:07,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:07,852 INFO L225 Difference]: With dead ends: 93 [2019-09-03 19:24:07,852 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 19:24:07,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 54 SyntacticMatches, 12 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=328, Invalid=2437, Unknown=3, NotChecked=312, Total=3080 [2019-09-03 19:24:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 19:24:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2019-09-03 19:24:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-03 19:24:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2019-09-03 19:24:07,876 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 73 [2019-09-03 19:24:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:07,877 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2019-09-03 19:24:07,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:24:07,877 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2019-09-03 19:24:07,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-03 19:24:07,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:07,883 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:07,883 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:07,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:07,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1692438026, now seen corresponding path program 7 times [2019-09-03 19:24:07,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:07,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:07,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:07,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:07,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-03 19:24:08,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:08,159 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) [2019-09-03 19:24:08,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:08,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:24:08,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-03 19:24:08,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:08,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2019-09-03 19:24:08,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:24:08,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:24:08,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:24:08,411 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 18 states. [2019-09-03 19:24:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:09,031 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2019-09-03 19:24:09,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:24:09,033 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2019-09-03 19:24:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:09,034 INFO L225 Difference]: With dead ends: 199 [2019-09-03 19:24:09,034 INFO L226 Difference]: Without dead ends: 103 [2019-09-03 19:24:09,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:24:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-03 19:24:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2019-09-03 19:24:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-03 19:24:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2019-09-03 19:24:09,063 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 81 [2019-09-03 19:24:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:09,063 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2019-09-03 19:24:09,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:24:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2019-09-03 19:24:09,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-03 19:24:09,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:09,065 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:09,065 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:09,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:09,066 INFO L82 PathProgramCache]: Analyzing trace with hash -345217670, now seen corresponding path program 8 times [2019-09-03 19:24:09,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:09,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:09,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:09,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:09,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:10,249 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 45 [2019-09-03 19:24:10,771 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 39 [2019-09-03 19:24:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 8 proven. 127 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:24:10,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:10,859 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:24:10,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:24:10,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:24:10,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:10,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 19:24:10,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:10,947 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:10,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-09-03 19:24:10,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:10,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:10,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:10,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-09-03 19:24:11,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-03 19:24:11,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:11,196 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:11,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-03 19:24:11,258 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:24:11,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,287 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-03 19:24:11,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:24:11,291 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:11,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,307 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:24:11,322 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:24:11,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,352 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-03 19:24:11,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:24:11,359 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:11,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,372 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:24:11,381 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:24:11,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,415 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-03 19:24:11,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:24:11,419 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:11,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,438 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:24:11,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-09-03 19:24:11,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,502 INFO L567 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-09-03 19:24:11,503 INFO L464 ElimStorePlain]: Eliminatee v_prenex_16 vanished before elimination [2019-09-03 19:24:11,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:24:11,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-03 19:24:11,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:11,524 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:11,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-03 19:24:11,533 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 0 case distinctions, treesize of input 66 treesize of output 68 [2019-09-03 19:24:11,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,588 INFO L567 ElimStorePlain]: treesize reduction 76, result has 42.9 percent of original size [2019-09-03 19:24:11,589 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_31| vanished before elimination [2019-09-03 19:24:11,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:137, output treesize:57 [2019-09-03 19:24:11,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:11,703 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:24:11,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:11,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:11,726 INFO L341 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2019-09-03 19:24:11,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 118 [2019-09-03 19:24:11,728 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,775 INFO L567 ElimStorePlain]: treesize reduction 5, result has 95.1 percent of original size [2019-09-03 19:24:11,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,776 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:219, output treesize:98 [2019-09-03 19:24:11,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:11,929 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:24:11,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:11,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:11,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:11,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:11,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:11,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:11,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:12,771 WARN L188 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 24 [2019-09-03 19:24:12,772 INFO L341 Elim1Store]: treesize reduction 132, result has 19.0 percent of original size [2019-09-03 19:24:12,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 168 [2019-09-03 19:24:12,774 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:12,846 INFO L567 ElimStorePlain]: treesize reduction 5, result has 96.5 percent of original size [2019-09-03 19:24:12,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:12,847 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:301, output treesize:139 [2019-09-03 19:24:13,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:13,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,171 INFO L235 Elim1Store]: Index analysis took 118 ms [2019-09-03 19:24:13,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 21 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 218 [2019-09-03 19:24:13,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:13,184 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:24:13,185 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:13,695 WARN L188 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-09-03 19:24:13,696 INFO L567 ElimStorePlain]: treesize reduction 5, result has 97.3 percent of original size [2019-09-03 19:24:13,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:13,697 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:383, output treesize:180 [2019-09-03 19:24:13,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:13,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:14,033 INFO L341 Elim1Store]: treesize reduction 172, result has 16.9 percent of original size [2019-09-03 19:24:14,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 23 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 10 case distinctions, treesize of input 114 treesize of output 152 [2019-09-03 19:24:14,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:14,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:14,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:14,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:132, output treesize:128 [2019-09-03 19:24:17,766 INFO L341 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2019-09-03 19:24:17,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 13 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 10 case distinctions, treesize of input 117 treesize of output 35 [2019-09-03 19:24:17,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:17,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:17,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:17,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:129, output treesize:5 [2019-09-03 19:24:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 19:24:17,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:17,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 28] total 44 [2019-09-03 19:24:17,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:24:17,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:24:17,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1736, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:24:17,961 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 44 states. [2019-09-03 19:24:22,084 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-03 19:24:24,671 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-09-03 19:24:29,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:29,607 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-09-03 19:24:29,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:24:29,607 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 89 [2019-09-03 19:24:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:29,608 INFO L225 Difference]: With dead ends: 109 [2019-09-03 19:24:29,608 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 19:24:29,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 61 SyntacticMatches, 22 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=520, Invalid=4736, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 19:24:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 19:24:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2019-09-03 19:24:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 19:24:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2019-09-03 19:24:29,623 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 89 [2019-09-03 19:24:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:29,624 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2019-09-03 19:24:29,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:24:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2019-09-03 19:24:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-03 19:24:29,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:29,625 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:29,626 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:29,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:29,626 INFO L82 PathProgramCache]: Analyzing trace with hash 340584369, now seen corresponding path program 9 times [2019-09-03 19:24:29,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:29,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:29,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:29,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:29,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 80 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 19:24:29,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:29,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:24:29,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:45,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:24:45,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:45,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:24:45,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 70 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-03 19:24:45,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:45,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2019-09-03 19:24:45,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:24:45,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:24:45,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:24:45,363 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 21 states. [2019-09-03 19:24:46,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:46,062 INFO L93 Difference]: Finished difference Result 234 states and 250 transitions. [2019-09-03 19:24:46,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:24:46,065 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 97 [2019-09-03 19:24:46,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:46,066 INFO L225 Difference]: With dead ends: 234 [2019-09-03 19:24:46,066 INFO L226 Difference]: Without dead ends: 119 [2019-09-03 19:24:46,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:24:46,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-03 19:24:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2019-09-03 19:24:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-03 19:24:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2019-09-03 19:24:46,081 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 97 [2019-09-03 19:24:46,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:46,081 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2019-09-03 19:24:46,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:24:46,082 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2019-09-03 19:24:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-03 19:24:46,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:46,083 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:46,083 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:46,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:46,083 INFO L82 PathProgramCache]: Analyzing trace with hash 684911337, now seen corresponding path program 10 times [2019-09-03 19:24:46,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:46,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:46,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:46,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:46,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:47,025 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-03 19:24:47,458 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 46 [2019-09-03 19:24:48,088 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 39 [2019-09-03 19:24:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 10 proven. 137 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-03 19:24:48,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:48,199 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:24:48,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:24:48,276 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:24:48,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:48,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 19:24:48,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:48,290 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:48,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-09-03 19:24:48,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:48,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:48,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:48,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-09-03 19:24:48,569 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 0 case distinctions, treesize of input 27 treesize of output 30 [2019-09-03 19:24:48,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:48,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:48,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:48,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-09-03 19:25:22,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 15 [2019-09-03 19:25:22,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:22,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:22,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:25:22,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:63, output treesize:5 [2019-09-03 19:25:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 19:25:22,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:22,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2019-09-03 19:25:22,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:25:22,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:25:22,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1505, Unknown=4, NotChecked=0, Total=1640 [2019-09-03 19:25:22,573 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 41 states. [2019-09-03 19:25:34,468 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-03 19:25:38,753 WARN L188 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-09-03 19:25:43,048 WARN L188 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-03 19:25:47,336 WARN L188 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-03 19:25:51,642 WARN L188 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-03 19:26:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:03,221 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2019-09-03 19:26:03,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:26:03,221 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 105 [2019-09-03 19:26:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:03,223 INFO L225 Difference]: With dead ends: 146 [2019-09-03 19:26:03,223 INFO L226 Difference]: Without dead ends: 144 [2019-09-03 19:26:03,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 80 SyntacticMatches, 14 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1967 ImplicationChecksByTransitivity, 63.2s TimeCoverageRelationStatistics Valid=734, Invalid=6744, Unknown=4, NotChecked=0, Total=7482 [2019-09-03 19:26:03,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-03 19:26:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2019-09-03 19:26:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-03 19:26:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2019-09-03 19:26:03,239 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 105 [2019-09-03 19:26:03,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:03,240 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2019-09-03 19:26:03,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:26:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2019-09-03 19:26:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-03 19:26:03,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:03,241 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:03,242 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:03,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:03,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1661636128, now seen corresponding path program 11 times [2019-09-03 19:26:03,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:03,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:03,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 117 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-03 19:26:03,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:03,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:03,831 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:27:11,214 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 19:27:11,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:11,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:27:11,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:11,475 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 117 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-03 19:27:11,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:11,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2019-09-03 19:27:11,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:27:11,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:27:11,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:27:11,487 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 24 states. [2019-09-03 19:27:12,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:12,387 INFO L93 Difference]: Finished difference Result 269 states and 286 transitions. [2019-09-03 19:27:12,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:27:12,390 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 113 [2019-09-03 19:27:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:12,391 INFO L225 Difference]: With dead ends: 269 [2019-09-03 19:27:12,392 INFO L226 Difference]: Without dead ends: 135 [2019-09-03 19:27:12,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:27:12,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-03 19:27:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2019-09-03 19:27:12,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-03 19:27:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2019-09-03 19:27:12,405 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 113 [2019-09-03 19:27:12,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:12,406 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2019-09-03 19:27:12,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:27:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2019-09-03 19:27:12,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-03 19:27:12,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:12,407 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:12,407 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:12,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:12,408 INFO L82 PathProgramCache]: Analyzing trace with hash 870763300, now seen corresponding path program 12 times [2019-09-03 19:27:12,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:12,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:12,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:12,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:12,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:13,554 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 45 [2019-09-03 19:27:14,471 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 41 [2019-09-03 19:27:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 12 proven. 191 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-03 19:27:14,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:14,658 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:27:14,669 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:28:03,495 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-03 19:28:03,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:03,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 19:28:03,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:03,573 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:03,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-09-03 19:28:03,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:03,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:03,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:03,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-09-03 19:28:03,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-03 19:28:03,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:03,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:03,884 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:28:03,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-03 19:28:03,937 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:03,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:03,974 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-03 19:28:03,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:28:03,979 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:03,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:03,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:03,996 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:28:04,002 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:04,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,036 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-03 19:28:04,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:28:04,040 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:04,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,057 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:28:04,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-09-03 19:28:04,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,114 INFO L567 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-09-03 19:28:04,114 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_40| vanished before elimination [2019-09-03 19:28:04,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:28:04,120 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:04,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,152 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-03 19:28:04,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:28:04,155 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:04,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,170 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:28:04,175 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:04,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,207 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-03 19:28:04,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:28:04,212 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:04,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,227 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:28:04,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-09-03 19:28:04,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,277 INFO L567 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-09-03 19:28:04,277 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_43| vanished before elimination [2019-09-03 19:28:04,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:28:04,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-03 19:28:04,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:04,295 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:28:04,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-03 19:28:04,311 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:04,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,344 INFO L567 ElimStorePlain]: treesize reduction 5, result has 92.4 percent of original size [2019-09-03 19:28:04,347 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 0 case distinctions, treesize of input 39 treesize of output 42 [2019-09-03 19:28:04,348 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:04,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,365 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:137, output treesize:57 [2019-09-03 19:28:04,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:04,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:04,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:04,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:04,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 94 [2019-09-03 19:28:04,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,532 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:04,532 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,572 INFO L567 ElimStorePlain]: treesize reduction 5, result has 93.7 percent of original size [2019-09-03 19:28:04,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,573 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:171, output treesize:74 [2019-09-03 19:28:04,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:04,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:04,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:04,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:04,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:04,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:04,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:04,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:04,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:04,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:04,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 126 [2019-09-03 19:28:04,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,809 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:04,810 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,869 INFO L567 ElimStorePlain]: treesize reduction 5, result has 95.1 percent of original size [2019-09-03 19:28:04,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:04,870 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:217, output treesize:97 [2019-09-03 19:28:05,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:05,055 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:05,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:05,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,171 INFO L341 Elim1Store]: treesize reduction 32, result has 80.0 percent of original size [2019-09-03 19:28:05,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 15 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 260 [2019-09-03 19:28:05,173 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:05,262 INFO L567 ElimStorePlain]: treesize reduction 167, result has 41.8 percent of original size [2019-09-03 19:28:05,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:05,262 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:263, output treesize:120 [2019-09-03 19:28:05,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:05,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:05,716 INFO L235 Elim1Store]: Index analysis took 198 ms [2019-09-03 19:28:05,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 33 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 190 [2019-09-03 19:28:05,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:05,726 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:05,726 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:05,830 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-03 19:28:05,831 INFO L567 ElimStorePlain]: treesize reduction 5, result has 96.6 percent of original size [2019-09-03 19:28:05,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:05,832 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:309, output treesize:143 [2019-09-03 19:28:06,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,247 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:06,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:06,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:06,712 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 59 [2019-09-03 19:28:06,713 INFO L341 Elim1Store]: treesize reduction 190, result has 49.7 percent of original size [2019-09-03 19:28:06,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 33 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 15 case distinctions, treesize of input 193 treesize of output 378 [2019-09-03 19:28:06,715 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:06,856 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-09-03 19:28:06,856 INFO L567 ElimStorePlain]: treesize reduction 175, result has 51.3 percent of original size [2019-09-03 19:28:06,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:06,857 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:391, output treesize:184 [2019-09-03 19:28:07,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:07,334 INFO L341 Elim1Store]: treesize reduction 332, result has 13.8 percent of original size [2019-09-03 19:28:07,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 45 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 21 case distinctions, treesize of input 160 treesize of output 216 [2019-09-03 19:28:07,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:07,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:07,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:07,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:178, output treesize:174 [2019-09-03 19:28:09,427 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-09-03 19:28:20,330 INFO L341 Elim1Store]: treesize reduction 240, result has 0.4 percent of original size [2019-09-03 19:28:20,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 24 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 21 case distinctions, treesize of input 155 treesize of output 45 [2019-09-03 19:28:20,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:20,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:20,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:20,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:167, output treesize:5 [2019-09-03 19:28:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 15 proven. 273 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 19:28:20,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:20,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 36] total 57 [2019-09-03 19:28:20,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:28:20,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:28:20,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2981, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:28:20,669 INFO L87 Difference]: Start difference. First operand 124 states and 127 transitions. Second operand 57 states. [2019-09-03 19:28:34,597 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 74 [2019-09-03 19:28:37,393 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 89 [2019-09-03 19:28:40,170 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-09-03 19:28:40,451 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2019-09-03 19:28:40,949 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 80 [2019-09-03 19:28:41,177 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2019-09-03 19:28:41,692 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2019-09-03 19:28:41,961 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 95 [2019-09-03 19:28:42,297 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 90 [2019-09-03 19:28:42,526 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-09-03 19:28:42,788 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 94 [2019-09-03 19:28:43,079 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 89 [2019-09-03 19:28:43,314 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-03 19:28:43,579 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 99 [2019-09-03 19:28:43,868 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 94 [2019-09-03 19:28:44,085 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2019-09-03 19:28:44,347 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 93 [2019-09-03 19:28:44,627 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 88 [2019-09-03 19:28:44,861 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 82 [2019-09-03 19:28:45,135 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 95 [2019-09-03 19:28:45,465 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 90 [2019-09-03 19:28:45,712 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-09-03 19:28:45,977 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 108 [2019-09-03 19:28:46,724 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2019-09-03 19:28:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:47,037 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2019-09-03 19:28:47,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 19:28:47,037 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 121 [2019-09-03 19:28:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:47,039 INFO L225 Difference]: With dead ends: 156 [2019-09-03 19:28:47,039 INFO L226 Difference]: Without dead ends: 154 [2019-09-03 19:28:47,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 81 SyntacticMatches, 17 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3665 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=1002, Invalid=11208, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 19:28:47,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-03 19:28:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 132. [2019-09-03 19:28:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-03 19:28:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2019-09-03 19:28:47,060 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 121 [2019-09-03 19:28:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:47,060 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2019-09-03 19:28:47,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:28:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2019-09-03 19:28:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-03 19:28:47,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:47,061 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:47,061 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:47,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1207696549, now seen corresponding path program 13 times [2019-09-03 19:28:47,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:47,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:47,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:47,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:47,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 21 proven. 161 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-09-03 19:28:47,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:47,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:47,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:28:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:47,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:28:47,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 21 proven. 161 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-09-03 19:28:47,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:47,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2019-09-03 19:28:47,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:28:47,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:28:47,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:28:47,876 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 27 states. [2019-09-03 19:28:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:49,067 INFO L93 Difference]: Finished difference Result 304 states and 322 transitions. [2019-09-03 19:28:49,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:28:49,068 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 129 [2019-09-03 19:28:49,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:49,069 INFO L225 Difference]: With dead ends: 304 [2019-09-03 19:28:49,069 INFO L226 Difference]: Without dead ends: 151 [2019-09-03 19:28:49,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:28:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-03 19:28:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2019-09-03 19:28:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 19:28:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2019-09-03 19:28:49,087 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 129 [2019-09-03 19:28:49,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:49,087 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2019-09-03 19:28:49,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:28:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2019-09-03 19:28:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-03 19:28:49,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:49,088 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:49,088 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:49,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:49,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1892796653, now seen corresponding path program 14 times [2019-09-03 19:28:49,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:49,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:49,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:49,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:28:49,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:50,791 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2019-09-03 19:28:51,816 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 58 [2019-09-03 19:28:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 14 proven. 346 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:28:51,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:51,981 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:28:51,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:28:52,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:28:52,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:52,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-03 19:28:52,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:52,087 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:52,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-09-03 19:28:52,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:52,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-09-03 19:28:52,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-03 19:28:52,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:52,392 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:28:52,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-03 19:28:52,445 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:52,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,480 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-03 19:28:52,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:28:52,485 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:52,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,500 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:28:52,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-09-03 19:28:52,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,554 INFO L567 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-09-03 19:28:52,555 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_54| vanished before elimination [2019-09-03 19:28:52,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:28:52,575 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:52,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,606 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-03 19:28:52,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:28:52,610 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:52,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,627 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:28:52,640 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:52,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,675 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-03 19:28:52,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:28:52,679 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:52,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,696 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:28:52,718 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:52,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,747 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-03 19:28:52,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:28:52,751 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:52,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,768 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:28:52,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-09-03 19:28:52,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,821 INFO L567 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-09-03 19:28:52,822 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_58| vanished before elimination [2019-09-03 19:28:52,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:28:52,839 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:52,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,874 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-03 19:28:52,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:28:52,877 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:52,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,895 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-03 19:28:52,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-03 19:28:52,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:52,912 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:28:52,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-03 19:28:52,921 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 0 case distinctions, treesize of input 66 treesize of output 68 [2019-09-03 19:28:52,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,974 INFO L567 ElimStorePlain]: treesize reduction 76, result has 42.9 percent of original size [2019-09-03 19:28:52,974 INFO L464 ElimStorePlain]: Eliminatee v_prenex_45 vanished before elimination [2019-09-03 19:28:52,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:52,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:137, output treesize:57 [2019-09-03 19:28:53,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:53,094 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:53,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,121 INFO L341 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2019-09-03 19:28:53,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 118 [2019-09-03 19:28:53,123 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,168 INFO L567 ElimStorePlain]: treesize reduction 5, result has 95.1 percent of original size [2019-09-03 19:28:53,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:219, output treesize:98 [2019-09-03 19:28:53,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:53,330 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:53,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,411 INFO L341 Elim1Store]: treesize reduction 132, result has 19.0 percent of original size [2019-09-03 19:28:53,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 168 [2019-09-03 19:28:53,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,514 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-03 19:28:53,514 INFO L567 ElimStorePlain]: treesize reduction 5, result has 96.5 percent of original size [2019-09-03 19:28:53,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,515 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:301, output treesize:139 [2019-09-03 19:28:53,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:53,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,836 INFO L235 Elim1Store]: Index analysis took 124 ms [2019-09-03 19:28:53,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 21 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 218 [2019-09-03 19:28:53,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,843 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:53,843 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,950 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-09-03 19:28:53,951 INFO L567 ElimStorePlain]: treesize reduction 5, result has 97.3 percent of original size [2019-09-03 19:28:53,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,951 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:383, output treesize:180 [2019-09-03 19:28:54,185 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-03 19:28:54,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:54,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,508 INFO L235 Elim1Store]: Index analysis took 199 ms [2019-09-03 19:28:54,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 33 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 268 [2019-09-03 19:28:54,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:54,516 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:54,517 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:54,648 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-09-03 19:28:54,649 INFO L567 ElimStorePlain]: treesize reduction 5, result has 97.8 percent of original size [2019-09-03 19:28:54,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:54,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:465, output treesize:221 [2019-09-03 19:28:54,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:54,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:54,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,214 INFO L235 Elim1Store]: Index analysis took 274 ms [2019-09-03 19:28:55,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 48 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 222 [2019-09-03 19:28:55,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:55,221 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:55,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:55,296 INFO L567 ElimStorePlain]: treesize reduction 5, result has 97.1 percent of original size [2019-09-03 19:28:55,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:55,297 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:355, output treesize:166 [2019-09-03 19:28:55,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:55,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:55,941 INFO L235 Elim1Store]: Index analysis took 380 ms [2019-09-03 19:28:55,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 66 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 272 [2019-09-03 19:28:55,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:55,951 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:28:55,951 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:56,046 INFO L567 ElimStorePlain]: treesize reduction 5, result has 97.6 percent of original size [2019-09-03 19:28:56,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:56,047 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:437, output treesize:207 [2019-09-03 19:28:56,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:56,530 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 38 [2019-09-03 19:28:56,531 INFO L341 Elim1Store]: treesize reduction 430, result has 12.6 percent of original size [2019-09-03 19:28:56,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 59 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 28 case distinctions, treesize of input 183 treesize of output 248 [2019-09-03 19:28:56,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:56,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:56,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:56,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:201, output treesize:197 [2019-09-03 19:28:59,537 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-03 19:29:18,704 INFO L341 Elim1Store]: treesize reduction 322, result has 0.3 percent of original size [2019-09-03 19:29:18,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 31 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 50 [2019-09-03 19:29:18,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:18,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:18,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:18,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:186, output treesize:5 [2019-09-03 19:29:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-03 19:29:19,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:19,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 40] total 62 [2019-09-03 19:29:19,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 19:29:19,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 19:29:19,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=3492, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:29:19,148 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand 62 states. [2019-09-03 19:29:28,458 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-03 19:29:34,208 WARN L188 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 83 [2019-09-03 19:29:37,269 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-09-03 19:29:39,915 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 89 [2019-09-03 19:29:42,719 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-09-03 19:29:43,223 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 91 [2019-09-03 19:29:43,439 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 96 [2019-09-03 19:29:43,948 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 93 [2019-09-03 19:29:44,183 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 98 [2019-09-03 19:29:44,491 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 92 [2019-09-03 19:29:44,713 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 97 [2019-09-03 19:29:45,020 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 92 [2019-09-03 19:29:45,251 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 97 [2019-09-03 19:29:45,558 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 91 [2019-09-03 19:29:45,779 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 96 [2019-09-03 19:29:46,068 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 93 [2019-09-03 19:29:46,295 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 98 [2019-09-03 19:29:46,646 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 93 [2019-09-03 19:29:46,879 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 98 [2019-09-03 19:29:47,223 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 104 [2019-09-03 19:29:47,699 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2019-09-03 19:29:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:47,700 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-09-03 19:29:47,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 19:29:47,701 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 137 [2019-09-03 19:29:47,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:47,702 INFO L225 Difference]: With dead ends: 157 [2019-09-03 19:29:47,702 INFO L226 Difference]: Without dead ends: 155 [2019-09-03 19:29:47,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 91 SyntacticMatches, 44 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3648 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=738, Invalid=8574, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 19:29:47,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-03 19:29:47,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 148. [2019-09-03 19:29:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-03 19:29:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2019-09-03 19:29:47,720 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 137 [2019-09-03 19:29:47,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:47,720 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2019-09-03 19:29:47,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 19:29:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2019-09-03 19:29:47,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-03 19:29:47,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:47,722 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:47,722 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:47,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:47,722 INFO L82 PathProgramCache]: Analyzing trace with hash -493612982, now seen corresponding path program 15 times [2019-09-03 19:29:47,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:47,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:47,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:47,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:47,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 24 proven. 212 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-03 19:29:48,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:48,213 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:29:48,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:30:38,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 19:30:38,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:30:38,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:30:38,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:30:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 24 proven. 212 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-03 19:30:38,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:30:38,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2019-09-03 19:30:38,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:30:38,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:30:38,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:30:38,722 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand 30 states. [2019-09-03 19:30:40,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:30:40,351 INFO L93 Difference]: Finished difference Result 339 states and 358 transitions. [2019-09-03 19:30:40,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:30:40,352 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 145 [2019-09-03 19:30:40,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:30:40,353 INFO L225 Difference]: With dead ends: 339 [2019-09-03 19:30:40,354 INFO L226 Difference]: Without dead ends: 167 [2019-09-03 19:30:40,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:30:40,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-03 19:30:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 156. [2019-09-03 19:30:40,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-03 19:30:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2019-09-03 19:30:40,375 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 145 [2019-09-03 19:30:40,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:30:40,375 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 159 transitions. [2019-09-03 19:30:40,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:30:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2019-09-03 19:30:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-03 19:30:40,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:30:40,377 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:30:40,377 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:30:40,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:30:40,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2070574798, now seen corresponding path program 16 times [2019-09-03 19:30:40,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:30:40,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:30:40,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:40,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:30:40,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:30:42,665 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-09-03 19:30:43,860 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 44 [2019-09-03 19:30:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 36 proven. 444 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-03 19:30:44,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:30:44,031 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:30:44,042 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:30:44,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:30:44,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:30:44,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-03 19:30:44,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:30:44,141 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:44,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-09-03 19:30:44,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:44,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-09-03 19:30:44,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-03 19:30:44,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:44,461 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:30:44,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-03 19:30:44,501 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:30:44,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,523 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-09-03 19:30:44,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:30:44,526 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:44,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,538 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-03 19:30:44,542 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:30:44,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,566 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-09-03 19:30:44,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:30:44,569 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:44,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,581 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-03 19:30:44,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-09-03 19:30:44,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,620 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-09-03 19:30:44,620 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_72| vanished before elimination [2019-09-03 19:30:44,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-03 19:30:44,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-09-03 19:30:44,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,661 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-09-03 19:30:44,661 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_73| vanished before elimination [2019-09-03 19:30:44,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-03 19:30:44,666 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:30:44,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,692 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-09-03 19:30:44,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:30:44,695 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:44,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,718 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-03 19:30:44,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-09-03 19:30:44,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,758 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-09-03 19:30:44,758 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_75| vanished before elimination [2019-09-03 19:30:44,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-03 19:30:44,763 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:30:44,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,789 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-09-03 19:30:44,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:30:44,792 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:44,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,805 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-03 19:30:44,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-09-03 19:30:44,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,849 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-09-03 19:30:44,850 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_77| vanished before elimination [2019-09-03 19:30:44,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-03 19:30:44,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-03 19:30:44,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:44,863 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:30:44,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-03 19:30:44,869 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 0 case distinctions, treesize of input 60 treesize of output 62 [2019-09-03 19:30:44,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,904 INFO L567 ElimStorePlain]: treesize reduction 70, result has 42.1 percent of original size [2019-09-03 19:30:44,904 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_79| vanished before elimination [2019-09-03 19:30:44,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:44,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:125, output treesize:51 [2019-09-03 19:30:45,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:45,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:45,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:45,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:45,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 88 [2019-09-03 19:30:45,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:45,042 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:30:45,042 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:45,076 INFO L567 ElimStorePlain]: treesize reduction 5, result has 93.2 percent of original size [2019-09-03 19:30:45,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:45,077 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:159, output treesize:68 [2019-09-03 19:30:45,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:45,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:45,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:45,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:45,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:45,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:45,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:45,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:45,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:45,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:45,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 120 [2019-09-03 19:30:45,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:45,278 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:30:45,279 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:45,318 INFO L567 ElimStorePlain]: treesize reduction 5, result has 94.8 percent of original size [2019-09-03 19:30:45,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:45,319 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:205, output treesize:91 [2019-09-03 19:30:45,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:45,480 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:30:45,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:45,696 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 79 [2019-09-03 19:30:45,696 INFO L341 Elim1Store]: treesize reduction 96, result has 69.6 percent of original size [2019-09-03 19:30:45,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 3 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 18 case distinctions, treesize of input 123 treesize of output 346 [2019-09-03 19:30:45,699 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:45,803 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2019-09-03 19:30:45,803 INFO L567 ElimStorePlain]: treesize reduction 357, result has 24.2 percent of original size [2019-09-03 19:30:45,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:45,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:251, output treesize:114 [2019-09-03 19:30:45,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:46,002 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:30:46,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:46,470 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 115 [2019-09-03 19:30:46,470 INFO L341 Elim1Store]: treesize reduction 246, result has 57.9 percent of original size [2019-09-03 19:30:46,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 3 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 30 case distinctions, treesize of input 164 treesize of output 500 [2019-09-03 19:30:46,474 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:46,586 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 65 [2019-09-03 19:30:46,586 INFO L567 ElimStorePlain]: treesize reduction 565, result has 21.5 percent of original size [2019-09-03 19:30:46,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:46,587 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:333, output treesize:155 [2019-09-03 19:30:46,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:46,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:46,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:47,106 INFO L235 Elim1Store]: Index analysis took 281 ms [2019-09-03 19:30:47,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 48 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 216 [2019-09-03 19:30:47,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:47,139 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:30:47,139 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:47,206 INFO L567 ElimStorePlain]: treesize reduction 5, result has 97.0 percent of original size [2019-09-03 19:30:47,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:47,207 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:343, output treesize:160 [2019-09-03 19:30:47,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:47,464 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:30:47,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:48,494 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 328 DAG size of output: 175 [2019-09-03 19:30:48,494 INFO L341 Elim1Store]: treesize reduction 522, result has 52.0 percent of original size [2019-09-03 19:30:48,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 3 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 63 case distinctions, treesize of input 210 treesize of output 772 [2019-09-03 19:30:48,502 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:48,688 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 84 [2019-09-03 19:30:48,688 INFO L567 ElimStorePlain]: treesize reduction 953, result has 17.4 percent of original size [2019-09-03 19:30:48,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:48,689 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:425, output treesize:201 [2019-09-03 19:30:48,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:48,991 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:30:48,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:49,920 WARN L188 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 419 DAG size of output: 167 [2019-09-03 19:30:49,921 INFO L341 Elim1Store]: treesize reduction 720, result has 42.3 percent of original size [2019-09-03 19:30:49,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 3 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 84 case distinctions, treesize of input 215 treesize of output 746 [2019-09-03 19:30:49,930 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:50,124 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 90 [2019-09-03 19:30:50,125 INFO L567 ElimStorePlain]: treesize reduction 831, result has 19.9 percent of original size [2019-09-03 19:30:50,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:50,126 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:435, output treesize:206 [2019-09-03 19:30:51,058 WARN L188 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 522 DAG size of output: 43 [2019-09-03 19:30:51,059 INFO L341 Elim1Store]: treesize reduction 1372, result has 4.9 percent of original size [2019-09-03 19:30:51,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 26 select indices, 26 select index equivalence classes, 3 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 108 case distinctions, treesize of input 206 treesize of output 280 [2019-09-03 19:30:51,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:51,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:51,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:51,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:218, output treesize:214 [2019-09-03 19:30:53,663 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#B~0.offset_BEFORE_CALL_29| Int) (|v_main_~#C~0.base_BEFORE_CALL_29| Int) (|v_main_~#C~0.offset_BEFORE_CALL_29| Int) (|v_main_~#A~0.base_BEFORE_CALL_29| Int) (|v_main_~#B~0.base_BEFORE_CALL_29| Int) (|v_main_~#A~0.offset_BEFORE_CALL_29| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_29|)) (.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_29|)) (.cse0 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_29|))) (and (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 20)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 20)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 20)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_29| |v_main_~#B~0.base_BEFORE_CALL_29|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_29| |v_main_~#C~0.base_BEFORE_CALL_29|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 16)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 16)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 16)))) (= (+ (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_29|) (select .cse2 |v_main_~#A~0.offset_BEFORE_CALL_29|)) (select .cse0 |v_main_~#C~0.offset_BEFORE_CALL_29|)) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 8)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 8))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 8))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 28)) (+ (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 28)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 28)))) (= (+ (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 4)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 4))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 4))) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 32)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 32))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 32))) (not (= |v_main_~#B~0.base_BEFORE_CALL_29| |v_main_~#C~0.base_BEFORE_CALL_29|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 24)) (+ (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 24)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 24)))) (= (+ (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 12)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 12))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 12)))))) is different from true [2019-09-03 19:30:56,749 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#B~0.base_BEFORE_CALL_30| Int) (|v_main_~#A~0.offset_BEFORE_CALL_30| Int) (|v_main_~#B~0.offset_BEFORE_CALL_30| Int) (|v_main_~#C~0.offset_BEFORE_CALL_30| Int) (|v_main_~#C~0.base_BEFORE_CALL_30| Int) (|v_main_~#A~0.base_BEFORE_CALL_30| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_30|)) (.cse1 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_30|)) (.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_30|))) (and (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 4)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 4))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 4))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 16)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 16)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 16)))) (= (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 20)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 20))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 20))) (not (= |v_main_~#B~0.base_BEFORE_CALL_30| |v_main_~#C~0.base_BEFORE_CALL_30|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 28)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 28)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 28)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 24)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 24)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 24)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 12)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 12)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 12)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_30| |v_main_~#B~0.base_BEFORE_CALL_30|)) (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 8)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 8))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 8))) (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 32)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 32))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 32))) (not (= |v_main_~#A~0.base_BEFORE_CALL_30| |v_main_~#C~0.base_BEFORE_CALL_30|)) (= (+ (select .cse0 |v_main_~#B~0.offset_BEFORE_CALL_30|) (select .cse1 |v_main_~#A~0.offset_BEFORE_CALL_30|)) (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_30|))))) is different from true [2019-09-03 19:30:59,922 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#B~0.base_BEFORE_CALL_31| Int) (|v_main_~#A~0.base_BEFORE_CALL_31| Int) (|v_main_~#A~0.offset_BEFORE_CALL_31| Int) (|v_main_~#B~0.offset_BEFORE_CALL_31| Int) (|v_main_~#C~0.base_BEFORE_CALL_31| Int) (|v_main_~#C~0.offset_BEFORE_CALL_31| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_31|)) (.cse0 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_31|)) (.cse1 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_31|))) (and (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 12)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 12))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 12))) (not (= |v_main_~#B~0.base_BEFORE_CALL_31| |v_main_~#C~0.base_BEFORE_CALL_31|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 16)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 16)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 16)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 8)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 8)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 8)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_31| |v_main_~#C~0.base_BEFORE_CALL_31|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 28)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 28)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 28)))) (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 20)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 20))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 20))) (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 32)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 32))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 32))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 24)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 24)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 24)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_31| |v_main_~#B~0.base_BEFORE_CALL_31|)) (= (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_31|) (+ (select .cse0 |v_main_~#B~0.offset_BEFORE_CALL_31|) (select .cse1 |v_main_~#A~0.offset_BEFORE_CALL_31|))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 4)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 4)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 4))))))) is different from true [2019-09-03 19:31:03,123 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#A~0.base_BEFORE_CALL_32| Int) (|v_main_~#A~0.offset_BEFORE_CALL_32| Int) (|v_main_~#B~0.base_BEFORE_CALL_32| Int) (|v_main_~#B~0.offset_BEFORE_CALL_32| Int) (|v_main_~#C~0.base_BEFORE_CALL_32| Int) (|v_main_~#C~0.offset_BEFORE_CALL_32| Int)) (let ((.cse1 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_32|)) (.cse2 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_32|)) (.cse0 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_32|))) (and (not (= |v_main_~#B~0.base_BEFORE_CALL_32| |v_main_~#C~0.base_BEFORE_CALL_32|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 28)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 28)) (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 28)))) (= (+ (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 4)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 4))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 4))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 12)) (+ (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 12)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 12)))) (= (+ (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 20)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 20))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 20))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 16)) (+ (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 16)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 16)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_32| |v_main_~#B~0.base_BEFORE_CALL_32|)) (= (+ (select .cse2 |v_main_~#B~0.offset_BEFORE_CALL_32|) (select .cse1 |v_main_~#A~0.offset_BEFORE_CALL_32|)) (select .cse0 |v_main_~#C~0.offset_BEFORE_CALL_32|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 24)) (+ (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 24)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 24)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_32| |v_main_~#C~0.base_BEFORE_CALL_32|)) (= (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 32)) (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 32))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 32))) (= (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 8)) (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 8))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 8)))))) is different from true [2019-09-03 19:31:06,346 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#A~0.base_BEFORE_CALL_33| Int) (|v_main_~#B~0.base_BEFORE_CALL_33| Int) (|v_main_~#C~0.base_BEFORE_CALL_33| Int) (|v_main_~#A~0.offset_BEFORE_CALL_33| Int) (|v_main_~#B~0.offset_BEFORE_CALL_33| Int) (|v_main_~#C~0.offset_BEFORE_CALL_33| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_33|)) (.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_33|)) (.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_33|))) (and (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 16)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 16))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 16))) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 12)) (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 12))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 12))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 4)) (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 4)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 4)))) (not (= |v_main_~#B~0.base_BEFORE_CALL_33| |v_main_~#C~0.base_BEFORE_CALL_33|)) (= (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_33|) (+ (select .cse0 |v_main_~#A~0.offset_BEFORE_CALL_33|) (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_33|))) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 24)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 24))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 24))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 8)) (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 8)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 8)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 20)) (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 20)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 20)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 28)) (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 28)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 28)))) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 32)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 32))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 32))) (not (= |v_main_~#A~0.base_BEFORE_CALL_33| |v_main_~#C~0.base_BEFORE_CALL_33|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_33| |v_main_~#B~0.base_BEFORE_CALL_33|))))) is different from true [2019-09-03 19:31:09,615 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#A~0.base_BEFORE_CALL_34| Int) (|v_main_~#B~0.base_BEFORE_CALL_34| Int) (|v_main_~#C~0.base_BEFORE_CALL_34| Int) (|v_main_~#A~0.offset_BEFORE_CALL_34| Int) (|v_main_~#B~0.offset_BEFORE_CALL_34| Int) (|v_main_~#C~0.offset_BEFORE_CALL_34| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_34|)) (.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_34|)) (.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_34|))) (and (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 12)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 12))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 12))) (= (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_34|) (+ (select .cse0 |v_main_~#A~0.offset_BEFORE_CALL_34|) (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_34|))) (not (= |v_main_~#A~0.base_BEFORE_CALL_34| |v_main_~#C~0.base_BEFORE_CALL_34|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_34| |v_main_~#B~0.base_BEFORE_CALL_34|)) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 20)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 20))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 20))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 24)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 24)) (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 24)))) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 32)) (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 32))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 32))) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 16)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 16))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 16))) (not (= |v_main_~#B~0.base_BEFORE_CALL_34| |v_main_~#C~0.base_BEFORE_CALL_34|)) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 4)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 4))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 4))) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 8)) (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 8))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 8))) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 28)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 28))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 28)))))) is different from true [2019-09-03 19:31:12,874 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#B~0.base_BEFORE_CALL_35| Int) (|v_main_~#A~0.base_BEFORE_CALL_35| Int) (|v_main_~#C~0.base_BEFORE_CALL_35| Int) (|v_main_~#C~0.offset_BEFORE_CALL_35| Int) (|v_main_~#A~0.offset_BEFORE_CALL_35| Int) (|v_main_~#B~0.offset_BEFORE_CALL_35| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_35|)) (.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_35|)) (.cse2 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_35|))) (and (not (= |v_main_~#B~0.base_BEFORE_CALL_35| |v_main_~#C~0.base_BEFORE_CALL_35|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 28)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 28)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 28)))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 12)) (+ (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 12)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 12)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_35| |v_main_~#B~0.base_BEFORE_CALL_35|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 16)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 16)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 16)))) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 4)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 4))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 4))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 8)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 8)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 8)))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 20)) (+ (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 20)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 20)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_35| |v_main_~#C~0.base_BEFORE_CALL_35|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 32)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 32)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 32)))) (= (+ (select .cse2 |v_main_~#A~0.offset_BEFORE_CALL_35|) (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_35|)) (select .cse0 |v_main_~#C~0.offset_BEFORE_CALL_35|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 24)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 24)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 24))))))) is different from true [2019-09-03 19:31:17,888 WARN L188 SmtUtils]: Spent 2.35 s on a formula simplification that was a NOOP. DAG size: 99 [2019-09-03 19:31:21,211 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#A~0.base_BEFORE_CALL_36| Int) (|v_main_~#B~0.base_BEFORE_CALL_36| Int) (|v_main_~#B~0.offset_BEFORE_CALL_36| Int) (|v_main_~#C~0.base_BEFORE_CALL_36| Int) (|v_main_~#C~0.offset_BEFORE_CALL_36| Int) (|v_main_~#A~0.offset_BEFORE_CALL_36| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_36|)) (.cse1 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_36|)) (.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_36|))) (and (= (+ (select .cse0 |v_main_~#B~0.offset_BEFORE_CALL_36|) (select .cse1 |v_main_~#A~0.offset_BEFORE_CALL_36|)) (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_36|)) (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 16)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 16))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 16))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 28)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 28)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 28)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 32)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 32)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 32)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_36| |v_main_~#B~0.base_BEFORE_CALL_36|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 4)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 4)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 4)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 12)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 12)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 12)))) (not (= |v_main_~#B~0.base_BEFORE_CALL_36| |v_main_~#C~0.base_BEFORE_CALL_36|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 8)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 8)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 8)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_36| |v_main_~#C~0.base_BEFORE_CALL_36|)) (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 24)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 24))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 24))) (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 20)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 20))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 20)))))) is different from true [2019-09-03 19:31:22,357 INFO L341 Elim1Store]: treesize reduction 1248, result has 0.1 percent of original size [2019-09-03 19:31:22,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 27 select indices, 27 select index equivalence classes, 3 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 108 case distinctions, treesize of input 229 treesize of output 55 [2019-09-03 19:31:22,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:22,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:22,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:22,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:241, output treesize:5 [2019-09-03 19:31:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 0 trivial. 127 not checked. [2019-09-03 19:31:22,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:22,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 51] total 78 [2019-09-03 19:31:22,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 19:31:22,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 19:31:22,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=4518, Unknown=9, NotChecked=1144, Total=6006 [2019-09-03 19:31:22,915 INFO L87 Difference]: Start difference. First operand 156 states and 159 transitions. Second operand 78 states. [2019-09-03 19:31:42,750 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-03 19:31:45,357 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-09-03 19:31:48,141 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-03 19:31:50,852 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-09-03 19:31:53,512 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-03 19:31:56,086 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 92 [2019-09-03 19:31:58,758 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 112 [2019-09-03 19:32:01,325 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-09-03 19:32:03,109 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 98 [2019-09-03 19:32:03,356 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 103 [2019-09-03 19:32:04,766 WARN L188 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 99 [2019-09-03 19:32:05,899 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 101 [2019-09-03 19:32:07,068 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 100 [2019-09-03 19:32:07,344 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 105 [2019-09-03 19:32:13,928 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 99 [2019-09-03 19:32:14,183 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 104 [2019-09-03 19:32:26,700 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2019-09-03 19:32:26,981 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 107 [2019-09-03 19:32:39,050 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 98 [2019-09-03 19:32:39,311 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 103 [2019-09-03 19:32:51,513 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 106 [2019-09-03 19:32:51,849 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 111 [2019-09-03 19:32:58,493 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 103 [2019-09-03 19:32:58,803 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 108 [2019-09-03 19:33:05,094 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 99 [2019-09-03 19:33:05,372 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 104 [2019-09-03 19:33:18,329 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 117 [2019-09-03 19:33:28,958 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 101 [2019-09-03 19:33:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:28,959 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2019-09-03 19:33:28,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 19:33:28,959 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 153 [2019-09-03 19:33:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:28,960 INFO L225 Difference]: With dead ends: 173 [2019-09-03 19:33:28,960 INFO L226 Difference]: Without dead ends: 171 [2019-09-03 19:33:28,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 102 SyntacticMatches, 48 SemanticMatches, 116 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 4787 ImplicationChecksByTransitivity, 89.0s TimeCoverageRelationStatistics Valid=828, Invalid=11185, Unknown=9, NotChecked=1784, Total=13806 [2019-09-03 19:33:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-03 19:33:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2019-09-03 19:33:28,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-03 19:33:28,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 167 transitions. [2019-09-03 19:33:28,984 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 167 transitions. Word has length 153 [2019-09-03 19:33:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:28,985 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 167 transitions. [2019-09-03 19:33:28,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 19:33:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 167 transitions. [2019-09-03 19:33:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-03 19:33:28,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:28,986 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:28,986 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:28,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:28,986 INFO L82 PathProgramCache]: Analyzing trace with hash -132225787, now seen corresponding path program 17 times [2019-09-03 19:33:28,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:28,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:28,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:28,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:28,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 27 proven. 270 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-03 19:33:29,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:29,679 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:33:29,689 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:35:11,231 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-03 19:35:11,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:35:11,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:35:11,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:35:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 27 proven. 234 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-03 19:35:12,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:35:12,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 33 [2019-09-03 19:35:12,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:35:12,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:35:12,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:35:12,019 INFO L87 Difference]: Start difference. First operand 164 states and 167 transitions. Second operand 33 states. [2019-09-03 19:35:14,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:35:14,079 INFO L93 Difference]: Finished difference Result 374 states and 394 transitions. [2019-09-03 19:35:14,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:35:14,079 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 161 [2019-09-03 19:35:14,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:35:14,082 INFO L225 Difference]: With dead ends: 374 [2019-09-03 19:35:14,082 INFO L226 Difference]: Without dead ends: 183 [2019-09-03 19:35:14,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:35:14,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-03 19:35:14,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2019-09-03 19:35:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-03 19:35:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 175 transitions. [2019-09-03 19:35:14,111 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 175 transitions. Word has length 161 [2019-09-03 19:35:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:35:14,111 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 175 transitions. [2019-09-03 19:35:14,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:35:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 175 transitions. [2019-09-03 19:35:14,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-03 19:35:14,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:35:14,112 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:35:14,113 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:35:14,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:35:14,113 INFO L82 PathProgramCache]: Analyzing trace with hash -557520579, now seen corresponding path program 18 times [2019-09-03 19:35:14,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:35:14,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:35:14,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:14,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:35:14,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:35:15,927 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2019-09-03 19:35:16,849 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49