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-673a906-m [2019-10-02 11:29:20,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:29:20,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:29:20,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:29:20,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:29:20,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:29:20,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:29:20,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:29:20,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:29:20,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:29:20,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:29:20,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:29:20,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:29:20,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:29:20,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:29:20,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:29:20,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:29:20,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:29:20,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:29:20,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:29:20,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:29:20,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:29:20,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:29:20,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:29:20,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:29:20,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:29:20,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:29:20,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:29:20,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:29:20,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:29:20,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:29:20,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:29:20,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:29:20,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:29:20,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:29:20,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:29:20,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:29:20,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:29:20,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:29:20,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:29:20,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:29:20,970 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-10-02 11:29:20,984 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:29:20,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:29:20,986 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:29:20,986 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:29:20,986 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:29:20,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:29:20,987 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:29:20,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:29:20,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:29:20,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:29:20,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:29:20,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:29:20,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:29:20,988 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:29:20,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:29:20,988 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:29:20,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:29:20,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:29:20,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:29:20,989 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:29:20,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:29:20,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:29:20,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:29:20,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:29:20,990 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:29:20,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:29:20,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:29:20,991 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:29:20,991 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:29:21,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:29:21,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:29:21,034 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:29:21,035 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:29:21,035 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:29:21,036 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-10-02 11:29:21,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f75eaa8a3/2c082e88ddd541e9adde56626237281c/FLAG712c2fb34 [2019-10-02 11:29:21,472 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:29:21,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-2.i [2019-10-02 11:29:21,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f75eaa8a3/2c082e88ddd541e9adde56626237281c/FLAG712c2fb34 [2019-10-02 11:29:21,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f75eaa8a3/2c082e88ddd541e9adde56626237281c [2019-10-02 11:29:21,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:29:21,854 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:29:21,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:29:21,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:29:21,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:29:21,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:29:21" (1/1) ... [2019-10-02 11:29:21,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de48500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:21, skipping insertion in model container [2019-10-02 11:29:21,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:29:21" (1/1) ... [2019-10-02 11:29:21,871 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:29:21,897 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:29:22,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:29:22,162 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:29:22,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:29:22,211 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:29:22,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:22 WrapperNode [2019-10-02 11:29:22,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:29:22,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:29:22,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:29:22,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:29:22,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:22" (1/1) ... [2019-10-02 11:29:22,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:22" (1/1) ... [2019-10-02 11:29:22,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:22" (1/1) ... [2019-10-02 11:29:22,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:22" (1/1) ... [2019-10-02 11:29:22,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:22" (1/1) ... [2019-10-02 11:29:22,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:22" (1/1) ... [2019-10-02 11:29:22,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:22" (1/1) ... [2019-10-02 11:29:22,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:29:22,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:29:22,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:29:22,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:29:22,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:22" (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-10-02 11:29:22,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:29:22,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:29:22,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:29:22,421 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:29:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:29:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:29:22,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:29:22,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:29:22,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-02 11:29:22,422 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:29:22,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:29:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:29:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:29:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:29:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:29:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:29:22,715 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:29:22,716 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 11:29:22,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:29:22 BoogieIcfgContainer [2019-10-02 11:29:22,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:29:22,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:29:22,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:29:22,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:29:22,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:29:21" (1/3) ... [2019-10-02 11:29:22,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674a8ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:29:22, skipping insertion in model container [2019-10-02 11:29:22,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:22" (2/3) ... [2019-10-02 11:29:22,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674a8ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:29:22, skipping insertion in model container [2019-10-02 11:29:22,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:29:22" (3/3) ... [2019-10-02 11:29:22,729 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_array-2.i [2019-10-02 11:29:22,742 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:29:22,751 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:29:22,768 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:29:22,800 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:29:22,800 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:29:22,801 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:29:22,801 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:29:22,801 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:29:22,801 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:29:22,801 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:29:22,801 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:29:22,802 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:29:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-02 11:29:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:29:22,834 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:22,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:22,837 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:22,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:22,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1823924036, now seen corresponding path program 1 times [2019-10-02 11:29:22,845 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:22,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:22,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:22,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:29:22,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:23,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:29:23,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:29:23,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:29:23,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:29:23,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:29:23,017 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-10-02 11:29:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:23,041 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-10-02 11:29:23,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:29:23,042 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-10-02 11:29:23,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:23,051 INFO L225 Difference]: With dead ends: 55 [2019-10-02 11:29:23,051 INFO L226 Difference]: Without dead ends: 27 [2019-10-02 11:29:23,054 INFO L640 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-10-02 11:29:23,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-02 11:29:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-02 11:29:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 11:29:23,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-02 11:29:23,092 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2019-10-02 11:29:23,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:23,093 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-02 11:29:23,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:29:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-02 11:29:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:29:23,094 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:23,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:23,095 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:23,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:23,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1169658974, now seen corresponding path program 1 times [2019-10-02 11:29:23,095 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:23,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:23,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:23,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:29:23,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:23,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:29:23,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:29:23,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:29:23,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:29:23,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:29:23,308 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2019-10-02 11:29:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:23,461 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-10-02 11:29:23,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:29:23,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-02 11:29:23,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:23,465 INFO L225 Difference]: With dead ends: 62 [2019-10-02 11:29:23,466 INFO L226 Difference]: Without dead ends: 39 [2019-10-02 11:29:23,467 INFO L640 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-10-02 11:29:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-02 11:29:23,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2019-10-02 11:29:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-02 11:29:23,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-10-02 11:29:23,481 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2019-10-02 11:29:23,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:23,481 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-10-02 11:29:23,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:29:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-10-02 11:29:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:29:23,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:23,483 INFO L411 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-10-02 11:29:23,484 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:23,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:23,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1835570138, now seen corresponding path program 1 times [2019-10-02 11:29:23,485 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:23,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:23,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:23,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:29:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:24,509 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 34 [2019-10-02 11:29:24,768 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 37 [2019-10-02 11:29:25,028 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 36 [2019-10-02 11:29:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:25,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:29:25,085 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 11:29:25,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:29:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:25,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 11:29:25,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:29:25,288 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:29:25,289 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-10-02 11:29:25,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:29:25,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:29:25,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:29:25,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2019-10-02 11:29:25,380 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-10-02 11:29:25,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:29:25,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:29:25,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:29:25,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-10-02 11:29:25,501 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-10-02 11:29:25,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:29:25,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:29:25,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:29:25,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:51, output treesize:5 [2019-10-02 11:29:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 11:29:25,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:25,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2019-10-02 11:29:25,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 11:29:25,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 11:29:25,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:29:25,571 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 19 states. [2019-10-02 11:29:26,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:26,199 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-10-02 11:29:26,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:29:26,200 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-10-02 11:29:26,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:26,201 INFO L225 Difference]: With dead ends: 63 [2019-10-02 11:29:26,202 INFO L226 Difference]: Without dead ends: 46 [2019-10-02 11:29:26,203 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2019-10-02 11:29:26,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-02 11:29:26,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-10-02 11:29:26,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 11:29:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-10-02 11:29:26,212 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 25 [2019-10-02 11:29:26,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:26,212 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-10-02 11:29:26,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 11:29:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-10-02 11:29:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 11:29:26,214 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:26,214 INFO L411 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-10-02 11:29:26,214 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:26,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:26,215 INFO L82 PathProgramCache]: Analyzing trace with hash 997765806, now seen corresponding path program 1 times [2019-10-02 11:29:26,215 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:26,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:26,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:26,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:29:26,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:26,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:29:26,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:29:26,458 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 11:29:26,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:29:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:26,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 11:29:26,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:29:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 11:29:26,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:26,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2019-10-02 11:29:26,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:29:26,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:29:26,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:29:26,594 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 11 states. [2019-10-02 11:29:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:26,776 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-10-02 11:29:26,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:29:26,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-10-02 11:29:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:26,778 INFO L225 Difference]: With dead ends: 76 [2019-10-02 11:29:26,778 INFO L226 Difference]: Without dead ends: 55 [2019-10-02 11:29:26,779 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:29:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-02 11:29:26,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2019-10-02 11:29:26,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-02 11:29:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-10-02 11:29:26,787 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 36 [2019-10-02 11:29:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:26,788 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-10-02 11:29:26,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:29:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-10-02 11:29:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 11:29:26,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:26,790 INFO L411 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-10-02 11:29:26,790 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:26,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:26,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1913486187, now seen corresponding path program 2 times [2019-10-02 11:29:26,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:26,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:26,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:26,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:29:26,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:27,568 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 46 [2019-10-02 11:29:27,992 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 47 [2019-10-02 11:29:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 11:29:28,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:29:28,070 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:29:28,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:29:28,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:29:28,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:29:28,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-02 11:29:28,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:29:28,164 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:29:28,164 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-10-02 11:29:28,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:29:28,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:29:28,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:29:28,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-10-02 11:29:28,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10-02 11:29:28,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:29:28,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:29:28,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:29:28,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-10-02 11:29:32,778 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-10-02 11:29:32,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:29:32,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:29:32,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:29:32,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:55, output treesize:5 [2019-10-02 11:29:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 11:29:32,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:32,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2019-10-02 11:29:32,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 11:29:32,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 11:29:32,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=625, Unknown=2, NotChecked=0, Total=702 [2019-10-02 11:29:32,884 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 27 states. [2019-10-02 11:29:34,051 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 51 [2019-10-02 11:29:34,951 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 56 [2019-10-02 11:29:35,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:35,379 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2019-10-02 11:29:35,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 11:29:35,380 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 41 [2019-10-02 11:29:35,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:35,382 INFO L225 Difference]: With dead ends: 88 [2019-10-02 11:29:35,382 INFO L226 Difference]: Without dead ends: 62 [2019-10-02 11:29:35,384 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=311, Invalid=1943, Unknown=2, NotChecked=0, Total=2256 [2019-10-02 11:29:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-02 11:29:35,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2019-10-02 11:29:35,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-02 11:29:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-10-02 11:29:35,393 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 41 [2019-10-02 11:29:35,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:35,393 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-10-02 11:29:35,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 11:29:35,394 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-10-02 11:29:35,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:29:35,395 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:35,395 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:35,395 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:35,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:35,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1732717085, now seen corresponding path program 3 times [2019-10-02 11:29:35,396 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:35,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:35,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:35,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:29:35,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 11:29:35,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:29:35,628 INFO L224 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) [2019-10-02 11:29:35,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:29:35,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 11:29:35,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:29:35,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 11:29:35,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:29:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 11:29:35,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:35,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-10-02 11:29:35,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 11:29:35,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 11:29:35,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:29:35,879 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 16 states. [2019-10-02 11:29:36,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:36,374 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2019-10-02 11:29:36,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:29:36,375 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2019-10-02 11:29:36,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:36,376 INFO L225 Difference]: With dead ends: 102 [2019-10-02 11:29:36,376 INFO L226 Difference]: Without dead ends: 71 [2019-10-02 11:29:36,377 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:29:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-02 11:29:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2019-10-02 11:29:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-02 11:29:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-10-02 11:29:36,400 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 52 [2019-10-02 11:29:36,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:36,400 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-10-02 11:29:36,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 11:29:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-10-02 11:29:36,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 11:29:36,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:36,404 INFO L411 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-10-02 11:29:36,404 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:36,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:36,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1071400400, now seen corresponding path program 4 times [2019-10-02 11:29:36,407 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:36,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:36,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:36,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:29:36,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:38,032 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 36 [2019-10-02 11:29:40,484 WARN L191 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 156 DAG size of output: 56 [2019-10-02 11:29:40,658 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 29 [2019-10-02 11:29:41,050 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 43 [2019-10-02 11:29:42,486 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 202 DAG size of output: 53 [2019-10-02 11:29:46,338 WARN L191 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 176 DAG size of output: 57 [2019-10-02 11:29:54,499 WARN L191 SmtUtils]: Spent 7.99 s on a formula simplification. DAG size of input: 237 DAG size of output: 78 [2019-10-02 11:29:55,142 WARN L191 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2019-10-02 11:29:57,177 WARN L191 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 120 DAG size of output: 46 [2019-10-02 11:29:57,961 WARN L191 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 56 [2019-10-02 11:29:58,743 WARN L191 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 76 [2019-10-02 11:30:07,947 WARN L191 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 93 [2019-10-02 11:30:08,500 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 62 [2019-10-02 11:30:08,756 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 36 [2019-10-02 11:30:09,278 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 54 [2019-10-02 11:30:09,811 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 50 [2019-10-02 11:30:10,426 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 41 [2019-10-02 11:30:10,709 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 34 [2019-10-02 11:30:11,035 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 57 [2019-10-02 11:30:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:30:11,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:30:11,161 INFO L224 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-10-02 11:30:11,181 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:30:11,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:30:11,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:30:11,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-02 11:30:11,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:30:11,242 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:30:11,243 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-10-02 11:30:11,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:30:11,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:30:11,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:30:11,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-10-02 11:30:13,649 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-10-02 11:30:13,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:30:13,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:30:13,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:30:13,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-10-02 11:30:13,670 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:30:13,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:30:13,692 INFO L567 ElimStorePlain]: treesize reduction 5, result has 91.7 percent of original size [2019-10-02 11:30:13,697 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-10-02 11:30:13,698 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:30:13,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:30:13,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:30:13,711 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:51 [2019-10-02 11:30:13,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:30:13,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:30:13,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:30:13,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:30:13,917 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-10-02 11:30:13,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:30:13,925 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:30:13,925 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:30:13,958 INFO L567 ElimStorePlain]: treesize reduction 5, result has 94.8 percent of original size [2019-10-02 11:30:13,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:30:13,959 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:207, output treesize:92 [2019-10-02 11:30:14,165 INFO L341 Elim1Store]: treesize reduction 124, result has 12.1 percent of original size [2019-10-02 11:30:14,166 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-10-02 11:30:14,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:30:14,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:30:14,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:30:14,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:76 [2019-10-02 11:30:16,418 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-10-02 11:30:23,097 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#C~0.base_BEFORE_CALL_3| Int) (|v_main_~#B~0.base_BEFORE_CALL_3| Int) (|v_main_~#C~0.offset_BEFORE_CALL_3| Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#B~0.offset_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_3|)) (.cse1 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|)) (.cse0 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_3|))) (and (not (= |v_main_~#C~0.base_BEFORE_CALL_3| |v_main_~#B~0.base_BEFORE_CALL_3|)) (= (+ (select .cse0 |v_main_~#B~0.offset_BEFORE_CALL_3|) (select .cse1 |v_main_~#A~0.offset_BEFORE_CALL_3|)) (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_3|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_3| |v_main_~#B~0.base_BEFORE_CALL_3|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_3| |v_main_~#C~0.base_BEFORE_CALL_3|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_3| 8)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_3| 8)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_3| 8)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_3| 4)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_3| 4)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_3| 4))))))) is different from true [2019-10-02 11:30:23,397 INFO L341 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2019-10-02 11:30:23,398 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-10-02 11:30:23,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:30:23,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:30:23,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:30:23,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:103, output treesize:5 [2019-10-02 11:30:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2019-10-02 11:30:23,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:30:23,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21] total 47 [2019-10-02 11:30:23,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-02 11:30:23,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-02 11:30:23,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1832, Unknown=6, NotChecked=174, Total=2162 [2019-10-02 11:30:23,557 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 47 states. [2019-10-02 11:30:29,771 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 56 [2019-10-02 11:30:32,569 WARN L191 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 174 DAG size of output: 36 [2019-10-02 11:30:32,927 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 54 [2019-10-02 11:30:38,957 WARN L191 SmtUtils]: Spent 5.44 s on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2019-10-02 11:30:41,336 WARN L191 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-10-02 11:30:41,699 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 54 [2019-10-02 11:30:42,057 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 66 [2019-10-02 11:30:42,751 WARN L191 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 80 [2019-10-02 11:30:43,092 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 72 [2019-10-02 11:30:43,356 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 77 [2019-10-02 11:30:46,250 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 64 [2019-10-02 11:30:46,568 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 76 [2019-10-02 11:30:49,124 WARN L191 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 131 DAG size of output: 71 [2019-10-02 11:30:49,547 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 70 [2019-10-02 11:30:49,913 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 71 [2019-10-02 11:31:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:31:01,583 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2019-10-02 11:31:01,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 11:31:01,583 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 57 [2019-10-02 11:31:01,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:31:01,585 INFO L225 Difference]: With dead ends: 113 [2019-10-02 11:31:01,585 INFO L226 Difference]: Without dead ends: 78 [2019-10-02 11:31:01,588 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 66.3s TimeCoverageRelationStatistics Valid=608, Invalid=5399, Unknown=7, NotChecked=306, Total=6320 [2019-10-02 11:31:01,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-02 11:31:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2019-10-02 11:31:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-02 11:31:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-10-02 11:31:01,599 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 57 [2019-10-02 11:31:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:31:01,599 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-10-02 11:31:01,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-02 11:31:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-10-02 11:31:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 11:31:01,600 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:31:01,601 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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-10-02 11:31:01,601 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:31:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:31:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1892204120, now seen corresponding path program 5 times [2019-10-02 11:31:01,601 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:31:01,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:31:01,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:01,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:31:01,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:31:01,853 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 11:31:01,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:31:01,854 INFO L224 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-10-02 11:31:01,911 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:31:27,077 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-02 11:31:27,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:31:27,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 11:31:27,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:31:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 11:31:27,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:31:27,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2019-10-02 11:31:27,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:31:27,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:31:27,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:31:27,182 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 15 states. [2019-10-02 11:31:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:31:27,622 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2019-10-02 11:31:27,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:31:27,623 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-10-02 11:31:27,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:31:27,624 INFO L225 Difference]: With dead ends: 128 [2019-10-02 11:31:27,625 INFO L226 Difference]: Without dead ends: 87 [2019-10-02 11:31:27,626 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:31:27,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-02 11:31:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2019-10-02 11:31:27,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-02 11:31:27,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-10-02 11:31:27,637 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 68 [2019-10-02 11:31:27,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:31:27,637 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-10-02 11:31:27,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:31:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-10-02 11:31:27,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 11:31:27,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:31:27,639 INFO L411 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-10-02 11:31:27,639 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:31:27,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:31:27,640 INFO L82 PathProgramCache]: Analyzing trace with hash -639892289, now seen corresponding path program 6 times [2019-10-02 11:31:27,640 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:31:27,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:31:27,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:27,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:31:27,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:31:28,781 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-10-02 11:31:29,079 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 57 [2019-10-02 11:31:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 11:31:29,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:31:29,145 INFO L224 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-10-02 11:31:29,166 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:31:29,617 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 11:31:29,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:31:29,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-02 11:31:29,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:31:29,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:31:29,643 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-10-02 11:31:29,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:31:29,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-10-02 11:31:29,743 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-10-02 11:31:29,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:31:29,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-10-02 11:31:29,776 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:31:29,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,796 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-10-02 11:31:29,800 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-10-02 11:31:29,800 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:31:29,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-10-02 11:31:29,823 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:31:29,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,847 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-10-02 11:31:29,850 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-10-02 11:31:29,851 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:31:29,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,863 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-10-02 11:31:29,869 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-10-02 11:31:29,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,903 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-10-02 11:31:29,904 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-10-02 11:31:29,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-10-02 11:31:29,913 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-10-02 11:31:29,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:31:29,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-10-02 11:31:29,944 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-10-02 11:31:29,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,974 INFO L567 ElimStorePlain]: treesize reduction 70, result has 42.1 percent of original size [2019-10-02 11:31:29,975 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_21| vanished before elimination [2019-10-02 11:31:29,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:31:29,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:125, output treesize:51 [2019-10-02 11:31:30,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:31:30,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:31:30,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:31:30,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:31:30,078 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-10-02 11:31:30,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:30,098 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:31:30,099 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:30,146 INFO L567 ElimStorePlain]: treesize reduction 5, result has 94.8 percent of original size [2019-10-02 11:31:30,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:31:30,147 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:207, output treesize:92 [2019-10-02 11:31:30,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:31:30,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:31:30,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:31:30,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:31:30,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:31:30,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:31:30,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:31:30,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:31:30,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:31:30,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:31:30,331 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-10-02 11:31:30,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:30,336 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:31:30,336 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:30,382 INFO L567 ElimStorePlain]: treesize reduction 5, result has 96.4 percent of original size [2019-10-02 11:31:30,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:31:30,383 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:289, output treesize:133 [2019-10-02 11:31:30,610 INFO L341 Elim1Store]: treesize reduction 242, result has 9.7 percent of original size [2019-10-02 11:31:30,611 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-10-02 11:31:30,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:30,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:31:30,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:31:30,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:99 [2019-10-02 11:31:32,877 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-10-02 11:31:35,192 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-10-02 11:31:37,556 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-10-02 11:31:39,727 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 54 [2019-10-02 11:31:40,011 INFO L341 Elim1Store]: treesize reduction 198, result has 0.5 percent of original size [2019-10-02 11:31:40,011 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-10-02 11:31:40,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:40,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:31:40,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:31:40,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:126, output treesize:5 [2019-10-02 11:31:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2019-10-02 11:31:40,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:31:40,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 40 [2019-10-02 11:31:40,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 11:31:40,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 11:31:40,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1184, Unknown=3, NotChecked=216, Total=1560 [2019-10-02 11:31:40,157 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 40 states. [2019-10-02 11:32:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:32:01,100 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2019-10-02 11:32:01,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 11:32:01,101 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 73 [2019-10-02 11:32:01,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:32:01,103 INFO L225 Difference]: With dead ends: 93 [2019-10-02 11:32:01,103 INFO L226 Difference]: Without dead ends: 91 [2019-10-02 11:32:01,104 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 51 SyntacticMatches, 19 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=357, Invalid=2514, Unknown=3, NotChecked=318, Total=3192 [2019-10-02 11:32:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-02 11:32:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2019-10-02 11:32:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-02 11:32:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2019-10-02 11:32:01,117 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 73 [2019-10-02 11:32:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:32:01,117 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2019-10-02 11:32:01,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 11:32:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2019-10-02 11:32:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-02 11:32:01,119 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:32:01,119 INFO L411 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-10-02 11:32:01,119 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:32:01,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:32:01,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1692438026, now seen corresponding path program 7 times [2019-10-02 11:32:01,120 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:32:01,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:32:01,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:32:01,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:32:01,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:32:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:32:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-02 11:32:01,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:32:01,420 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:32:01,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:32:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:32:01,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 11:32:01,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:32:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-02 11:32:01,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:32:01,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2019-10-02 11:32:01,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 11:32:01,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 11:32:01,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:32:01,703 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 18 states. [2019-10-02 11:32:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:32:02,225 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2019-10-02 11:32:02,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:32:02,227 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2019-10-02 11:32:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:32:02,229 INFO L225 Difference]: With dead ends: 199 [2019-10-02 11:32:02,229 INFO L226 Difference]: Without dead ends: 103 [2019-10-02 11:32:02,230 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:32:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-02 11:32:02,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2019-10-02 11:32:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-02 11:32:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2019-10-02 11:32:02,251 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 81 [2019-10-02 11:32:02,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:32:02,251 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2019-10-02 11:32:02,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 11:32:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2019-10-02 11:32:02,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 11:32:02,253 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:32:02,253 INFO L411 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-10-02 11:32:02,253 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:32:02,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:32:02,253 INFO L82 PathProgramCache]: Analyzing trace with hash -345217670, now seen corresponding path program 8 times [2019-10-02 11:32:02,254 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:32:02,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:32:02,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:32:02,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:32:02,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:32:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:32:03,899 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 46 [2019-10-02 11:32:04,134 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 58 [2019-10-02 11:32:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 8 proven. 92 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 11:32:05,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:32:05,101 INFO L224 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-10-02 11:32:05,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:32:05,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:32:05,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:32:05,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 76 conjunts are in the unsatisfiable core [2019-10-02 11:32:05,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:32:05,199 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:32:05,200 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-10-02 11:32:05,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:32:05,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-10-02 11:32:05,443 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-10-02 11:32:05,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:32:05,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-10-02 11:32:05,509 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-10-02 11:32:05,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,552 INFO L567 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-10-02 11:32:05,553 INFO L464 ElimStorePlain]: Eliminatee v_prenex_10 vanished before elimination [2019-10-02 11:32:05,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-10-02 11:32:05,568 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:32:05,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,602 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-10-02 11:32:05,606 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-10-02 11:32:05,606 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:32:05,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-10-02 11:32:05,621 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-10-02 11:32:05,636 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:32:05,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,665 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-10-02 11:32:05,668 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-10-02 11:32:05,669 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:32:05,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,688 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-10-02 11:32:05,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 44 treesize of output 40 [2019-10-02 11:32:05,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,738 INFO L567 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-10-02 11:32:05,739 INFO L464 ElimStorePlain]: Eliminatee v_prenex_17 vanished before elimination [2019-10-02 11:32:05,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-10-02 11:32:05,750 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-10-02 11:32:05,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:32:05,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-10-02 11:32:05,773 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-10-02 11:32:05,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,821 INFO L567 ElimStorePlain]: treesize reduction 76, result has 42.9 percent of original size [2019-10-02 11:32:05,821 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_31| vanished before elimination [2019-10-02 11:32:05,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:137, output treesize:57 [2019-10-02 11:32:05,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:32:05,961 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:32:05,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:05,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:05,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:05,987 INFO L341 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2019-10-02 11:32:05,987 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-10-02 11:32:05,989 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:06,038 INFO L567 ElimStorePlain]: treesize reduction 5, result has 95.1 percent of original size [2019-10-02 11:32:06,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:32:06,039 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:219, output treesize:98 [2019-10-02 11:32:06,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:32:06,218 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:32:06,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:06,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,308 INFO L341 Elim1Store]: treesize reduction 132, result has 19.0 percent of original size [2019-10-02 11:32:06,308 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-10-02 11:32:06,309 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:06,370 INFO L567 ElimStorePlain]: treesize reduction 5, result has 96.5 percent of original size [2019-10-02 11:32:06,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:32:06,371 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:301, output treesize:139 [2019-10-02 11:32:06,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:32:06,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:06,702 INFO L235 Elim1Store]: Index analysis took 114 ms [2019-10-02 11:32:06,705 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-10-02 11:32:06,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:06,715 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:32:06,716 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:07,021 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-10-02 11:32:07,022 INFO L567 ElimStorePlain]: treesize reduction 5, result has 97.3 percent of original size [2019-10-02 11:32:07,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:32:07,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:383, output treesize:180 [2019-10-02 11:32:08,735 WARN L191 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 72 [2019-10-02 11:32:08,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:32:08,821 INFO L341 Elim1Store]: treesize reduction 172, result has 16.9 percent of original size [2019-10-02 11:32:08,822 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-10-02 11:32:08,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:08,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:32:08,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:32:08,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:132, output treesize:128 [2019-10-02 11:32:12,766 INFO L341 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2019-10-02 11:32:12,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-10-02 11:32:12,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:12,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:32:12,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:32:12,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:129, output treesize:5 [2019-10-02 11:32:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:32:13,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:32:13,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 49 [2019-10-02 11:32:13,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-02 11:32:13,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-02 11:32:13,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2175, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 11:32:13,144 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 49 states. [2019-10-02 11:32:17,377 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-10-02 11:32:17,710 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-10-02 11:32:20,105 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2019-10-02 11:32:20,350 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-10-02 11:32:21,034 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-10-02 11:32:21,265 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-10-02 11:32:22,804 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 108 [2019-10-02 11:32:23,238 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 85 [2019-10-02 11:32:23,509 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2019-10-02 11:32:23,779 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 90 [2019-10-02 11:32:24,494 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 82 [2019-10-02 11:32:24,763 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 87 [2019-10-02 11:32:25,082 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 79 [2019-10-02 11:32:25,322 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 87 [2019-10-02 11:32:25,617 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 82 [2019-10-02 11:32:25,848 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 87 [2019-10-02 11:32:26,548 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 113 [2019-10-02 11:32:27,047 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2019-10-02 11:32:27,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:32:27,960 INFO L93 Difference]: Finished difference Result 180 states and 195 transitions. [2019-10-02 11:32:27,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-02 11:32:27,960 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 89 [2019-10-02 11:32:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:32:27,961 INFO L225 Difference]: With dead ends: 180 [2019-10-02 11:32:27,961 INFO L226 Difference]: Without dead ends: 110 [2019-10-02 11:32:27,965 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2529 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=873, Invalid=8057, Unknown=0, NotChecked=0, Total=8930 [2019-10-02 11:32:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-02 11:32:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2019-10-02 11:32:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-02 11:32:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2019-10-02 11:32:27,980 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 89 [2019-10-02 11:32:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:32:27,980 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2019-10-02 11:32:27,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-02 11:32:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2019-10-02 11:32:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 11:32:27,987 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:32:27,987 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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-10-02 11:32:27,987 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:32:27,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:32:27,988 INFO L82 PathProgramCache]: Analyzing trace with hash -691138558, now seen corresponding path program 9 times [2019-10-02 11:32:27,988 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:32:27,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:32:27,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:32:27,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:32:27,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:32:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:32:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 86 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-02 11:32:28,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:32:28,397 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:32:28,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:32:53,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-02 11:32:53,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:32:53,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 11:32:53,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:32:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 15 proven. 80 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:32:53,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:32:53,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 23 [2019-10-02 11:32:53,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 11:32:53,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 11:32:53,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-10-02 11:32:53,724 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand 23 states. [2019-10-02 11:32:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:32:55,015 INFO L93 Difference]: Finished difference Result 180 states and 187 transitions. [2019-10-02 11:32:55,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 11:32:55,015 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 100 [2019-10-02 11:32:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:32:55,016 INFO L225 Difference]: With dead ends: 180 [2019-10-02 11:32:55,017 INFO L226 Difference]: Without dead ends: 119 [2019-10-02 11:32:55,017 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 11:32:55,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-02 11:32:55,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2019-10-02 11:32:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-02 11:32:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2019-10-02 11:32:55,029 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 100 [2019-10-02 11:32:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:32:55,030 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2019-10-02 11:32:55,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 11:32:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2019-10-02 11:32:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 11:32:55,032 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:32:55,032 INFO L411 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-10-02 11:32:55,032 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:32:55,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:32:55,032 INFO L82 PathProgramCache]: Analyzing trace with hash 684911337, now seen corresponding path program 10 times [2019-10-02 11:32:55,032 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:32:55,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:32:55,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:32:55,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:32:55,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:32:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:32:56,194 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2019-10-02 11:32:56,795 WARN L191 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 56 [2019-10-02 11:32:57,913 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 44 [2019-10-02 11:32:58,223 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 49 [2019-10-02 11:32:59,120 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 39 [2019-10-02 11:32:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 10 proven. 137 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-02 11:32:59,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:32:59,286 INFO L224 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-10-02 11:32:59,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:32:59,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:32:59,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:32:59,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 70 conjunts are in the unsatisfiable core [2019-10-02 11:32:59,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:32:59,410 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:32:59,411 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-10-02 11:32:59,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:59,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:32:59,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:32:59,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-10-02 11:32:59,710 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-10-02 11:32:59,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:32:59,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:32:59,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:32:59,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-10-02 11:33:24,791 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-10-02 11:33:24,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:33:24,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:33:24,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:33:24,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:63, output treesize:5 [2019-10-02 11:33:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:33:24,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:33:24,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 47 [2019-10-02 11:33:24,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-02 11:33:24,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-02 11:33:24,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2010, Unknown=3, NotChecked=0, Total=2162 [2019-10-02 11:33:24,941 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 47 states. [2019-10-02 11:33:34,233 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-02 11:33:52,614 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-10-02 11:33:57,045 WARN L191 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-10-02 11:34:03,444 WARN L191 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 110 DAG size of output: 79 [2019-10-02 11:34:09,857 WARN L191 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 110 DAG size of output: 79 [2019-10-02 11:34:16,234 WARN L191 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-10-02 11:34:18,676 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-10-02 11:34:21,256 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2019-10-02 11:34:22,747 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2019-10-02 11:34:23,013 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2019-10-02 11:34:23,660 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2019-10-02 11:34:24,385 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 60 [2019-10-02 11:34:26,752 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 50 [2019-10-02 11:34:27,712 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2019-10-02 11:34:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:34:31,305 INFO L93 Difference]: Finished difference Result 205 states and 221 transitions. [2019-10-02 11:34:31,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-10-02 11:34:31,306 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 105 [2019-10-02 11:34:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:34:31,308 INFO L225 Difference]: With dead ends: 205 [2019-10-02 11:34:31,308 INFO L226 Difference]: Without dead ends: 203 [2019-10-02 11:34:31,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 78 SyntacticMatches, 9 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4956 ImplicationChecksByTransitivity, 60.3s TimeCoverageRelationStatistics Valid=1220, Invalid=14526, Unknown=4, NotChecked=0, Total=15750 [2019-10-02 11:34:31,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-02 11:34:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 116. [2019-10-02 11:34:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-02 11:34:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2019-10-02 11:34:31,330 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 105 [2019-10-02 11:34:31,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:34:31,331 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2019-10-02 11:34:31,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-02 11:34:31,331 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2019-10-02 11:34:31,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 11:34:31,332 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:34:31,332 INFO L411 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-10-02 11:34:31,333 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:34:31,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:34:31,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1661636128, now seen corresponding path program 11 times [2019-10-02 11:34:31,333 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:34:31,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:34:31,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:34:31,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:34:31,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:34:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:34:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 117 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-02 11:34:31,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:34:31,908 INFO L224 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-10-02 11:34:31,955 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:35:36,857 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-02 11:35:36,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:35:36,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 11:35:36,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:35:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 102 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-02 11:35:37,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:35:37,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2019-10-02 11:35:37,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 11:35:37,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 11:35:37,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-10-02 11:35:37,116 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 24 states. [2019-10-02 11:35:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:35:38,181 INFO L93 Difference]: Finished difference Result 269 states and 286 transitions. [2019-10-02 11:35:38,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:35:38,182 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 113 [2019-10-02 11:35:38,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:35:38,183 INFO L225 Difference]: With dead ends: 269 [2019-10-02 11:35:38,183 INFO L226 Difference]: Without dead ends: 135 [2019-10-02 11:35:38,184 INFO L640 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-10-02 11:35:38,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-02 11:35:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2019-10-02 11:35:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-02 11:35:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2019-10-02 11:35:38,198 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 113 [2019-10-02 11:35:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:35:38,198 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2019-10-02 11:35:38,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 11:35:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2019-10-02 11:35:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-02 11:35:38,199 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:35:38,199 INFO L411 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-10-02 11:35:38,200 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:35:38,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:35:38,200 INFO L82 PathProgramCache]: Analyzing trace with hash 870763300, now seen corresponding path program 12 times [2019-10-02 11:35:38,200 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:35:38,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:35:38,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:38,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:35:38,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:35:39,276 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-10-02 11:35:40,090 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2019-10-02 11:35:40,488 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 44 [2019-10-02 11:35:41,571 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 39 [2019-10-02 11:35:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 12 proven. 261 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 11:35:41,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:35:41,743 INFO L224 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-10-02 11:35:41,783 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:36:30,347 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-10-02 11:36:30,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:36:30,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 70 conjunts are in the unsatisfiable core [2019-10-02 11:36:30,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:36:30,383 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:36:30,384 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-10-02 11:36:30,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:36:30,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:36:30,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:36:30,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2019-10-02 11:36:30,769 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-10-02 11:36:30,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:36:30,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:36:30,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:36:30,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-10-02 11:36:50,090 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-10-02 11:36:50,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:36:50,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:36:50,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:36:50,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:5 [2019-10-02 11:36:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 15 proven. 202 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-10-02 11:36:50,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:36:50,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 24] total 53 [2019-10-02 11:36:50,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-02 11:36:50,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-02 11:36:50,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2520, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 11:36:50,267 INFO L87 Difference]: Start difference. First operand 124 states and 127 transitions. Second operand 53 states. [2019-10-02 11:36:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:36:59,263 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2019-10-02 11:36:59,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-10-02 11:36:59,263 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 121 [2019-10-02 11:36:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:36:59,266 INFO L225 Difference]: With dead ends: 239 [2019-10-02 11:36:59,266 INFO L226 Difference]: Without dead ends: 237 [2019-10-02 11:36:59,270 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 90 SyntacticMatches, 25 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6050 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=1461, Invalid=15569, Unknown=0, NotChecked=0, Total=17030 [2019-10-02 11:36:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-02 11:36:59,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 132. [2019-10-02 11:36:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-02 11:36:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2019-10-02 11:36:59,293 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 121 [2019-10-02 11:36:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:36:59,294 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2019-10-02 11:36:59,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-02 11:36:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2019-10-02 11:36:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 11:36:59,295 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:36:59,295 INFO L411 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-10-02 11:36:59,295 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:36:59,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:36:59,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1207696549, now seen corresponding path program 13 times [2019-10-02 11:36:59,296 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:36:59,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:36:59,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:59,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:36:59,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:36:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 21 proven. 161 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-10-02 11:36:59,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:36:59,856 INFO L224 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-10-02 11:36:59,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:36:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:36:59,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 11:36:59,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:37:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 21 proven. 161 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-10-02 11:37:00,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:37:00,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2019-10-02 11:37:00,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 11:37:00,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 11:37:00,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2019-10-02 11:37:00,285 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 27 states. [2019-10-02 11:37:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:37:01,704 INFO L93 Difference]: Finished difference Result 304 states and 322 transitions. [2019-10-02 11:37:01,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 11:37:01,704 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 129 [2019-10-02 11:37:01,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:37:01,706 INFO L225 Difference]: With dead ends: 304 [2019-10-02 11:37:01,706 INFO L226 Difference]: Without dead ends: 151 [2019-10-02 11:37:01,707 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2019-10-02 11:37:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-02 11:37:01,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2019-10-02 11:37:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-02 11:37:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2019-10-02 11:37:01,725 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 129 [2019-10-02 11:37:01,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:37:01,725 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2019-10-02 11:37:01,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 11:37:01,725 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2019-10-02 11:37:01,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 11:37:01,726 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:37:01,726 INFO L411 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-10-02 11:37:01,726 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:37:01,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:37:01,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1892796653, now seen corresponding path program 14 times [2019-10-02 11:37:01,726 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:37:01,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:37:01,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:37:01,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:37:01,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:37:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:37:03,016 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 32 [2019-10-02 11:37:03,255 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 36 [2019-10-02 11:37:03,636 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 32 [2019-10-02 11:37:03,889 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 32 [2019-10-02 11:37:04,167 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 32 [2019-10-02 11:37:04,500 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 46 [2019-10-02 11:37:04,707 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 54 [2019-10-02 11:37:06,007 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 68 [2019-10-02 11:37:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 14 proven. 254 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-02 11:37:06,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:37:06,219 INFO L224 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-10-02 11:37:06,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:37:06,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:37:06,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:37:06,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 106 conjunts are in the unsatisfiable core [2019-10-02 11:37:06,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:37:06,364 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:37:06,364 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-10-02 11:37:06,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:06,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:37:06,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:06,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-10-02 11:37:06,753 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-10-02 11:37:06,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:06,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:37:06,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:06,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-10-02 11:37:06,824 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:37:06,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:06,855 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-10-02 11:37:06,858 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-10-02 11:37:06,858 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:06,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:37:06,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:06,874 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-10-02 11:37:06,891 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-10-02 11:37:06,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:06,939 INFO L567 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-10-02 11:37:06,940 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_40| vanished before elimination [2019-10-02 11:37:06,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:06,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-10-02 11:37:06,946 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:37:06,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:06,979 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-10-02 11:37:06,984 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-10-02 11:37:06,985 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:37:07,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,004 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-10-02 11:37:07,009 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:37:07,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,040 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-10-02 11:37:07,044 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-10-02 11:37:07,044 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:37:07,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-10-02 11:37:07,065 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:37:07,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,097 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-10-02 11:37:07,099 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-10-02 11:37:07,100 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:37:07,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,114 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-10-02 11:37:07,120 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:37:07,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,152 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-10-02 11:37:07,156 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-10-02 11:37:07,156 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:37:07,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-10-02 11:37:07,170 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-10-02 11:37:07,177 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-10-02 11:37:07,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,234 INFO L567 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-10-02 11:37:07,234 INFO L464 ElimStorePlain]: Eliminatee v_prenex_33 vanished before elimination [2019-10-02 11:37:07,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-10-02 11:37:07,263 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-10-02 11:37:07,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:37:07,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-10-02 11:37:07,285 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:37:07,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,318 INFO L567 ElimStorePlain]: treesize reduction 5, result has 92.4 percent of original size [2019-10-02 11:37:07,325 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-10-02 11:37:07,325 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:37:07,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,341 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:137, output treesize:57 [2019-10-02 11:37:07,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:07,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:07,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:07,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:07,618 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 107 treesize of output 118 [2019-10-02 11:37:07,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,625 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:37:07,625 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,690 INFO L567 ElimStorePlain]: treesize reduction 5, result has 95.1 percent of original size [2019-10-02 11:37:07,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:07,691 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:219, output treesize:98 [2019-10-02 11:37:07,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:07,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:07,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:07,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:07,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:07,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:07,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:07,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:07,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:07,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,062 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-10-02 11:37:08,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:08,070 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:37:08,071 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:08,143 INFO L567 ElimStorePlain]: treesize reduction 5, result has 95.1 percent of original size [2019-10-02 11:37:08,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:08,144 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:217, output treesize:97 [2019-10-02 11:37:08,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:08,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:08,609 INFO L235 Elim1Store]: Index analysis took 130 ms [2019-10-02 11:37:08,611 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 129 treesize of output 158 [2019-10-02 11:37:08,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:08,616 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:37:08,617 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:08,696 INFO L567 ElimStorePlain]: treesize reduction 5, result has 96.0 percent of original size [2019-10-02 11:37:08,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:08,697 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:263, output treesize:120 [2019-10-02 11:37:09,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:09,085 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:37:09,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:09,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,428 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2019-10-02 11:37:09,428 INFO L341 Elim1Store]: treesize reduction 138, result has 50.9 percent of original size [2019-10-02 11:37:09,429 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 170 treesize of output 310 [2019-10-02 11:37:09,431 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:09,540 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2019-10-02 11:37:09,540 INFO L567 ElimStorePlain]: treesize reduction 167, result has 49.1 percent of original size [2019-10-02 11:37:09,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:09,540 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:345, output treesize:161 [2019-10-02 11:37:09,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:09,813 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:37:09,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:09,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:09,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,107 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 61 [2019-10-02 11:37:10,107 INFO L341 Elim1Store]: treesize reduction 112, result has 66.1 percent of original size [2019-10-02 11:37:10,108 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 175 treesize of output 396 [2019-10-02 11:37:10,110 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:10,248 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 75 [2019-10-02 11:37:10,248 INFO L567 ElimStorePlain]: treesize reduction 219, result has 43.1 percent of original size [2019-10-02 11:37:10,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:10,249 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:355, output treesize:166 [2019-10-02 11:37:10,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:10,531 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:37:10,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:10,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:10,934 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 71 [2019-10-02 11:37:10,935 INFO L341 Elim1Store]: treesize reduction 170, result has 60.7 percent of original size [2019-10-02 11:37:10,936 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 198 treesize of output 464 [2019-10-02 11:37:10,939 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:11,145 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 84 [2019-10-02 11:37:11,145 INFO L567 ElimStorePlain]: treesize reduction 263, result has 41.8 percent of original size [2019-10-02 11:37:11,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:11,146 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:401, output treesize:189 [2019-10-02 11:37:11,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:37:11,785 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 38 [2019-10-02 11:37:11,786 INFO L341 Elim1Store]: treesize reduction 430, result has 12.6 percent of original size [2019-10-02 11:37:11,786 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-10-02 11:37:11,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:11,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:37:11,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:11,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:201, output treesize:197 [2019-10-02 11:37:14,750 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-10-02 11:37:32,016 INFO L341 Elim1Store]: treesize reduction 322, result has 0.3 percent of original size [2019-10-02 11:37:32,017 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-10-02 11:37:32,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:32,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:37:32,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:32,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:186, output treesize:5 [2019-10-02 11:37:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 11:37:32,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:37:32,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 40] total 70 [2019-10-02 11:37:32,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-02 11:37:32,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-02 11:37:32,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=4549, Unknown=0, NotChecked=0, Total=4830 [2019-10-02 11:37:32,450 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand 70 states. [2019-10-02 11:37:48,586 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 74 [2019-10-02 11:37:51,009 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 82 [2019-10-02 11:37:51,489 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-10-02 11:37:53,999 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 91 [2019-10-02 11:37:54,625 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-10-02 11:37:54,983 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 98 [2019-10-02 11:37:55,335 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 101 [2019-10-02 11:37:57,891 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 118 [2019-10-02 11:37:58,159 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 97 [2019-10-02 11:37:58,503 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2019-10-02 11:37:58,729 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 95 [2019-10-02 11:37:59,493 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 99 [2019-10-02 11:37:59,803 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 104 [2019-10-02 11:38:00,182 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 98 [2019-10-02 11:38:00,476 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 103 [2019-10-02 11:38:00,860 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 98 [2019-10-02 11:38:01,178 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 103 [2019-10-02 11:38:01,569 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 100 [2019-10-02 11:38:01,871 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 105 [2019-10-02 11:38:02,266 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 99 [2019-10-02 11:38:02,594 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 104 [2019-10-02 11:38:03,003 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 102 [2019-10-02 11:38:03,322 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 107 [2019-10-02 11:38:03,776 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 103 [2019-10-02 11:38:04,237 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 106 [2019-10-02 11:38:04,850 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 123 [2019-10-02 11:38:05,341 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 100 [2019-10-02 11:38:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:38:06,678 INFO L93 Difference]: Finished difference Result 262 states and 282 transitions. [2019-10-02 11:38:06,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-10-02 11:38:06,678 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 137 [2019-10-02 11:38:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:38:06,680 INFO L225 Difference]: With dead ends: 262 [2019-10-02 11:38:06,680 INFO L226 Difference]: Without dead ends: 158 [2019-10-02 11:38:06,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 99 SyntacticMatches, 19 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5537 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=1267, Invalid=15503, Unknown=0, NotChecked=0, Total=16770 [2019-10-02 11:38:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-02 11:38:06,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2019-10-02 11:38:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-02 11:38:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 154 transitions. [2019-10-02 11:38:06,704 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 154 transitions. Word has length 137 [2019-10-02 11:38:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:38:06,704 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 154 transitions. [2019-10-02 11:38:06,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-02 11:38:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 154 transitions. [2019-10-02 11:38:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 11:38:06,705 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:38:06,705 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 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-10-02 11:38:06,706 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:38:06,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:38:06,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1716587877, now seen corresponding path program 15 times [2019-10-02 11:38:06,706 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:38:06,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:38:06,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:38:06,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:38:06,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:38:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:38:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 16 proven. 209 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-10-02 11:38:07,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:38:07,299 INFO L224 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-10-02 11:38:07,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:39:09,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-02 11:39:09,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:39:09,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-02 11:39:09,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:39:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 24 proven. 184 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-10-02 11:39:10,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:39:10,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 32 [2019-10-02 11:39:10,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 11:39:10,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 11:39:10,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2019-10-02 11:39:10,278 INFO L87 Difference]: Start difference. First operand 151 states and 154 transitions. Second operand 32 states. [2019-10-02 11:39:11,226 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 17 [2019-10-02 11:39:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:39:12,852 INFO L93 Difference]: Finished difference Result 258 states and 265 transitions. [2019-10-02 11:39:12,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 11:39:12,853 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 148 [2019-10-02 11:39:12,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:39:12,854 INFO L225 Difference]: With dead ends: 258 [2019-10-02 11:39:12,854 INFO L226 Difference]: Without dead ends: 167 [2019-10-02 11:39:12,855 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=221, Invalid=2131, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 11:39:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-02 11:39:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 156. [2019-10-02 11:39:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-02 11:39:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2019-10-02 11:39:12,876 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 148 [2019-10-02 11:39:12,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:39:12,877 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 159 transitions. [2019-10-02 11:39:12,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 11:39:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2019-10-02 11:39:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 11:39:12,878 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:39:12,878 INFO L411 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-10-02 11:39:12,878 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:39:12,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:39:12,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2070574798, now seen corresponding path program 16 times [2019-10-02 11:39:12,879 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:39:12,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:39:12,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:39:12,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:39:12,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:39:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:39:14,864 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 42 [2019-10-02 11:39:16,064 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38 [2019-10-02 11:39:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 16 proven. 326 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-10-02 11:39:16,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:39:16,280 INFO L224 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-10-02 11:39:16,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:39:16,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:39:16,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:39:16,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 112 conjunts are in the unsatisfiable core [2019-10-02 11:39:16,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:39:16,436 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:39:16,436 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-10-02 11:39:16,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:16,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:39:16,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:16,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-10-02 11:39:16,788 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-10-02 11:39:16,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:16,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:39:16,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:16,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-10-02 11:39:16,839 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-10-02 11:39:16,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:16,870 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-10-02 11:39:16,870 INFO L464 ElimStorePlain]: Eliminatee v_prenex_37 vanished before elimination [2019-10-02 11:39:16,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:16,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-10-02 11:39:16,876 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-10-02 11:39:16,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:16,909 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-10-02 11:39:16,909 INFO L464 ElimStorePlain]: Eliminatee v_prenex_39 vanished before elimination [2019-10-02 11:39:16,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:16,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-10-02 11:39:16,915 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:39:16,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:16,938 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-10-02 11:39:16,941 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-10-02 11:39:16,941 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:16,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:39:16,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:16,951 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-10-02 11:39:16,956 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:39:16,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:16,979 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-10-02 11:39:16,982 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-10-02 11:39:16,982 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:16,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:39:16,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:16,994 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-10-02 11:39:17,000 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-10-02 11:39:17,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,032 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-10-02 11:39:17,032 INFO L464 ElimStorePlain]: Eliminatee v_prenex_44 vanished before elimination [2019-10-02 11:39:17,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-10-02 11:39:17,038 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:39:17,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,064 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-10-02 11:39:17,067 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-10-02 11:39:17,067 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:39:17,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,078 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-10-02 11:39:17,083 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-10-02 11:39:17,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,116 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-10-02 11:39:17,116 INFO L464 ElimStorePlain]: Eliminatee v_prenex_49 vanished before elimination [2019-10-02 11:39:17,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-10-02 11:39:17,123 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-10-02 11:39:17,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,170 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-10-02 11:39:17,170 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_63| vanished before elimination [2019-10-02 11:39:17,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-10-02 11:39:17,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-10-02 11:39:17,174 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-10-02 11:39:17,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:39:17,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-10-02 11:39:17,188 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:39:17,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,213 INFO L567 ElimStorePlain]: treesize reduction 5, result has 91.7 percent of original size [2019-10-02 11:39:17,215 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-10-02 11:39:17,216 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:39:17,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,229 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:51 [2019-10-02 11:39:17,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:39:17,341 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:39:17,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,369 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:39:17,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 146 [2019-10-02 11:39:17,372 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,413 INFO L567 ElimStorePlain]: treesize reduction 112, result has 37.8 percent of original size [2019-10-02 11:39:17,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,414 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:159, output treesize:68 [2019-10-02 11:39:17,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:39:17,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,623 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-10-02 11:39:17,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,627 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:39:17,627 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,666 INFO L567 ElimStorePlain]: treesize reduction 5, result has 94.8 percent of original size [2019-10-02 11:39:17,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,666 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:205, output treesize:91 [2019-10-02 11:39:17,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:39:17,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:39:17,962 INFO L235 Elim1Store]: Index analysis took 112 ms [2019-10-02 11:39:17,963 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 141 treesize of output 170 [2019-10-02 11:39:17,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:17,967 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:39:17,967 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:18,024 INFO L567 ElimStorePlain]: treesize reduction 5, result has 96.4 percent of original size [2019-10-02 11:39:18,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:18,024 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:287, output treesize:132 [2019-10-02 11:39:18,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:39:18,253 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:39:18,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:19,448 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 179 DAG size of output: 113 [2019-10-02 11:39:19,448 INFO L341 Elim1Store]: treesize reduction 366, result has 45.8 percent of original size [2019-10-02 11:39:19,449 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 182 treesize of output 482 [2019-10-02 11:39:19,452 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:19,569 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 68 [2019-10-02 11:39:19,569 INFO L567 ElimStorePlain]: treesize reduction 505, result has 25.5 percent of original size [2019-10-02 11:39:19,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:19,569 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:369, output treesize:173 [2019-10-02 11:39:19,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:39:19,820 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:39:19,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:20,251 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 123 [2019-10-02 11:39:20,252 INFO L341 Elim1Store]: treesize reduction 336, result has 52.7 percent of original size [2019-10-02 11:39:20,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 3 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 45 case distinctions, treesize of input 169 treesize of output 546 [2019-10-02 11:39:20,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:20,378 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 72 [2019-10-02 11:39:20,378 INFO L567 ElimStorePlain]: treesize reduction 601, result has 21.0 percent of original size [2019-10-02 11:39:20,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:20,379 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:343, output treesize:160 [2019-10-02 11:39:20,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:39:20,669 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:39:20,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:21,282 WARN L191 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 325 DAG size of output: 145 [2019-10-02 11:39:21,283 INFO L341 Elim1Store]: treesize reduction 510, result has 46.9 percent of original size [2019-10-02 11:39:21,283 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 192 treesize of output 646 [2019-10-02 11:39:21,288 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:21,447 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 81 [2019-10-02 11:39:21,447 INFO L567 ElimStorePlain]: treesize reduction 723, result has 20.2 percent of original size [2019-10-02 11:39:21,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:21,448 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:389, output treesize:183 [2019-10-02 11:39:21,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:39:21,766 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:39:21,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:23,106 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 422 DAG size of output: 205 [2019-10-02 11:39:23,107 INFO L341 Elim1Store]: treesize reduction 714, result has 48.7 percent of original size [2019-10-02 11:39:23,108 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 233 treesize of output 908 [2019-10-02 11:39:23,115 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:23,344 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 93 [2019-10-02 11:39:23,345 INFO L567 ElimStorePlain]: treesize reduction 1141, result has 16.4 percent of original size [2019-10-02 11:39:23,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:23,346 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:471, output treesize:224 [2019-10-02 11:39:24,245 WARN L191 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 522 DAG size of output: 43 [2019-10-02 11:39:24,245 INFO L341 Elim1Store]: treesize reduction 1372, result has 4.9 percent of original size [2019-10-02 11:39:24,246 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-10-02 11:39:24,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:24,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:39:24,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:39:24,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:218, output treesize:214 [2019-10-02 11:39:26,833 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-10-02 11:39:29,903 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-10-02 11:39:33,021 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-10-02 11:39:36,130 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-10-02 11:39:39,255 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-10-02 11:39:42,525 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-10-02 11:39:45,736 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-10-02 11:39:48,356 WARN L191 SmtUtils]: Spent 2.31 s on a formula simplification that was a NOOP. DAG size: 99 [2019-10-02 11:40:53,020 WARN L191 SmtUtils]: Spent 2.34 s on a formula simplification that was a NOOP. DAG size: 95 [2019-10-02 11:40:53,973 INFO L341 Elim1Store]: treesize reduction 1248, result has 0.1 percent of original size [2019-10-02 11:40:53,974 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-10-02 11:40:53,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:40:53,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:40:53,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:40:53,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:241, output treesize:5 [2019-10-02 11:40:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 0 proven. 449 refuted. 0 times theorem prover too weak. 0 trivial. 122 not checked. [2019-10-02 11:40:54,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:40:54,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 51] total 75 [2019-10-02 11:40:54,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-02 11:40:54,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-02 11:40:54,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=4276, Unknown=34, NotChecked=966, Total=5550 [2019-10-02 11:40:54,549 INFO L87 Difference]: Start difference. First operand 156 states and 159 transitions. Second operand 75 states. [2019-10-02 11:41:01,243 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2019-10-02 11:41:06,000 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-10-02 11:41:10,809 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-10-02 11:41:15,654 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-10-02 11:41:20,518 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-10-02 11:41:25,000 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-10-02 11:41:30,063 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-10-02 11:41:34,736 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-02 11:41:39,551 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-10-02 11:41:44,211 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-10-02 11:41:49,262 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-10-02 11:41:54,148 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2019-10-02 11:41:59,162 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 86 [2019-10-02 11:42:04,291 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-10-02 11:42:09,262 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2019-10-02 11:42:14,125 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 92 [2019-10-02 11:42:14,497 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 108 [2019-10-02 11:42:15,175 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 98 [2019-10-02 11:42:15,584 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 100 [2019-10-02 11:42:15,828 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 105 [2019-10-02 11:42:17,104 WARN L191 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 99 [2019-10-02 11:42:18,149 WARN L191 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 101 [2019-10-02 11:42:18,512 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 102 [2019-10-02 11:42:18,799 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 107 [2019-10-02 11:42:29,765 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-10-02 11:42:30,020 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 106 [2019-10-02 11:42:39,840 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 105 [2019-10-02 11:42:40,115 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 110 [2019-10-02 11:42:50,174 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 100 [2019-10-02 11:42:50,459 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 105 [2019-10-02 11:43:00,924 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 106 [2019-10-02 11:43:01,248 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 111 [2019-10-02 11:43:07,636 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 106 [2019-10-02 11:43:07,944 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 111 [2019-10-02 11:43:13,948 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-10-02 11:43:14,215 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 106 [2019-10-02 11:43:16,437 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 113 [2019-10-02 11:43:20,171 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2019-10-02 11:43:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:43:20,172 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2019-10-02 11:43:20,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 11:43:20,173 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 153 [2019-10-02 11:43:20,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:43:20,174 INFO L225 Difference]: With dead ends: 173 [2019-10-02 11:43:20,174 INFO L226 Difference]: Without dead ends: 171 [2019-10-02 11:43:20,176 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 98 SyntacticMatches, 25 SemanticMatches, 122 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 186.6s TimeCoverageRelationStatistics Valid=914, Invalid=12636, Unknown=50, NotChecked=1652, Total=15252 [2019-10-02 11:43:20,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-02 11:43:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2019-10-02 11:43:20,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-02 11:43:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 167 transitions. [2019-10-02 11:43:20,204 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 167 transitions. Word has length 153 [2019-10-02 11:43:20,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:43:20,205 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 167 transitions. [2019-10-02 11:43:20,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-02 11:43:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 167 transitions. [2019-10-02 11:43:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 11:43:20,206 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:43:20,206 INFO L411 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-10-02 11:43:20,206 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:43:20,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:43:20,207 INFO L82 PathProgramCache]: Analyzing trace with hash -132225787, now seen corresponding path program 17 times [2019-10-02 11:43:20,207 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:43:20,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:43:20,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:43:20,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:43:20,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:43:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:43:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 27 proven. 270 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-02 11:43:20,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:43:20,807 INFO L224 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-10-02 11:43:20,866 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1