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