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/eureka_01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:29:06,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:29:06,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:29:06,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:29:06,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:29:06,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:29:06,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:29:06,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:29:06,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:29:06,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:29:06,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:29:06,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:29:06,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:29:06,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:29:06,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:29:06,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:29:06,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:29:06,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:29:06,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:29:06,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:29:06,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:29:06,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:29:06,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:29:06,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:29:06,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:29:06,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:29:06,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:29:06,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:29:06,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:29:06,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:29:06,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:29:06,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:29:06,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:29:06,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:29:06,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:29:06,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:29:06,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:29:06,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:29:06,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:29:06,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:29:06,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:29:06,978 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 11:29:06,995 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:29:06,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:29:06,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:29:06,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:29:06,998 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:29:06,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:29:06,999 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:29:06,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:29:06,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:29:06,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:29:06,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:29:07,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:29:07,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:29:07,000 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:29:07,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:29:07,000 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:29:07,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:29:07,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:29:07,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:29:07,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:29:07,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:29:07,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:29:07,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:29:07,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:29:07,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:29:07,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:29:07,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:29:07,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:29:07,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:29:07,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:29:07,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:29:07,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:29:07,073 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:29:07,074 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:29:07,074 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01-2.c [2019-09-05 11:29:07,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7882b4b83/0361a912dfb74b9c82d2a9d124842e82/FLAG556241ba9 [2019-09-05 11:29:07,623 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:29:07,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-2.c [2019-09-05 11:29:07,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7882b4b83/0361a912dfb74b9c82d2a9d124842e82/FLAG556241ba9 [2019-09-05 11:29:07,953 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7882b4b83/0361a912dfb74b9c82d2a9d124842e82 [2019-09-05 11:29:07,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:29:07,964 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:29:07,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:07,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:29:07,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:29:07,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:07" (1/1) ... [2019-09-05 11:29:07,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f586b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:07, skipping insertion in model container [2019-09-05 11:29:07,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:07" (1/1) ... [2019-09-05 11:29:07,978 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:29:07,993 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:29:08,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:08,184 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:29:08,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:08,345 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:29:08,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08 WrapperNode [2019-09-05 11:29:08,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:08,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:29:08,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:29:08,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:29:08,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:29:08,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:29:08,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:29:08,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:29:08,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:29:08,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:29:08,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:29:08,449 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:29:08,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:29:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:29:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:29:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:29:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-05 11:29:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-05 11:29:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-05 11:29:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-05 11:29:08,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-05 11:29:08,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:29:08,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:29:08,794 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:29:08,795 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-05 11:29:08,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:08 BoogieIcfgContainer [2019-09-05 11:29:08,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:29:08,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:29:08,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:29:08,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:29:08,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:29:07" (1/3) ... [2019-09-05 11:29:08,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244ccb94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:08, skipping insertion in model container [2019-09-05 11:29:08,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (2/3) ... [2019-09-05 11:29:08,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244ccb94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:08, skipping insertion in model container [2019-09-05 11:29:08,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:08" (3/3) ... [2019-09-05 11:29:08,813 INFO L109 eAbstractionObserver]: Analyzing ICFG eureka_01-2.c [2019-09-05 11:29:08,844 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:29:08,862 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:29:08,897 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:29:08,929 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:29:08,930 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:29:08,930 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:29:08,930 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:29:08,930 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:29:08,930 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:29:08,931 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:29:08,931 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:29:08,931 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:29:08,950 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-09-05 11:29:08,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:29:08,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:08,957 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:08,959 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:08,965 INFO L82 PathProgramCache]: Analyzing trace with hash 288590464, now seen corresponding path program 1 times [2019-09-05 11:29:08,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:08,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:09,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:09,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:09,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:09,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 11:29:09,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 11:29:09,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 11:29:09,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:29:09,213 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-09-05 11:29:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:09,241 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2019-09-05 11:29:09,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 11:29:09,244 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-09-05 11:29:09,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:09,256 INFO L225 Difference]: With dead ends: 61 [2019-09-05 11:29:09,257 INFO L226 Difference]: Without dead ends: 30 [2019-09-05 11:29:09,263 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-05 11:29:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-05 11:29:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-05 11:29:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 11:29:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-09-05 11:29:09,318 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2019-09-05 11:29:09,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:09,319 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-09-05 11:29:09,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 11:29:09,320 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-09-05 11:29:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:29:09,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:09,322 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:09,323 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:09,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1211863700, now seen corresponding path program 1 times [2019-09-05 11:29:09,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:09,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:09,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:09,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:09,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:09,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:09,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:29:09,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:29:09,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:29:09,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:29:09,446 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 4 states. [2019-09-05 11:29:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:09,565 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2019-09-05 11:29:09,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:29:09,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-05 11:29:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:09,569 INFO L225 Difference]: With dead ends: 58 [2019-09-05 11:29:09,570 INFO L226 Difference]: Without dead ends: 47 [2019-09-05 11:29:09,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:29:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-05 11:29:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-09-05 11:29:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 11:29:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-09-05 11:29:09,583 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 17 [2019-09-05 11:29:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:09,583 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-09-05 11:29:09,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:29:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-09-05 11:29:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:29:09,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:09,584 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] [2019-09-05 11:29:09,585 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:09,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:09,585 INFO L82 PathProgramCache]: Analyzing trace with hash -250627941, now seen corresponding path program 1 times [2019-09-05 11:29:09,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:09,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:09,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:09,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:09,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:09,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:29:09,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:29:09,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:29:09,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:29:09,674 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 3 states. [2019-09-05 11:29:09,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:09,736 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2019-09-05 11:29:09,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:29:09,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-05 11:29:09,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:09,739 INFO L225 Difference]: With dead ends: 56 [2019-09-05 11:29:09,739 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 11:29:09,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:29:09,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 11:29:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-05 11:29:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-05 11:29:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-09-05 11:29:09,747 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 20 [2019-09-05 11:29:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:09,748 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-09-05 11:29:09,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:29:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-09-05 11:29:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-05 11:29:09,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:09,749 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] [2019-09-05 11:29:09,750 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:09,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:09,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1643402608, now seen corresponding path program 1 times [2019-09-05 11:29:09,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:09,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:09,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:09,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:09,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 11:29:09,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:09,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:29:09,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:29:09,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:29:09,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:29:09,874 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 4 states. [2019-09-05 11:29:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:09,951 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2019-09-05 11:29:09,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:29:09,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-09-05 11:29:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:09,953 INFO L225 Difference]: With dead ends: 61 [2019-09-05 11:29:09,953 INFO L226 Difference]: Without dead ends: 45 [2019-09-05 11:29:09,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:29:09,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-05 11:29:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2019-09-05 11:29:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 11:29:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-09-05 11:29:09,962 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 23 [2019-09-05 11:29:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:09,963 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-09-05 11:29:09,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:29:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-09-05 11:29:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 11:29:09,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:09,964 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, 1] [2019-09-05 11:29:09,965 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:09,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2039819741, now seen corresponding path program 1 times [2019-09-05 11:29:09,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:09,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:09,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:09,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 11:29:10,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:10,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:29:10,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:29:10,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:29:10,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:29:10,062 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 4 states. [2019-09-05 11:29:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:10,130 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2019-09-05 11:29:10,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:29:10,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-09-05 11:29:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:10,131 INFO L225 Difference]: With dead ends: 57 [2019-09-05 11:29:10,131 INFO L226 Difference]: Without dead ends: 36 [2019-09-05 11:29:10,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:29:10,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-05 11:29:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-09-05 11:29:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-05 11:29:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-09-05 11:29:10,139 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2019-09-05 11:29:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:10,140 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-09-05 11:29:10,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:29:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-09-05 11:29:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 11:29:10,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:10,141 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, 1, 1, 1, 1] [2019-09-05 11:29:10,141 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:10,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:10,141 INFO L82 PathProgramCache]: Analyzing trace with hash -118036183, now seen corresponding path program 1 times [2019-09-05 11:29:10,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:10,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:10,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:10,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-05 11:29:10,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:10,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:10,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:10,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-05 11:29:10,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-05 11:29:10,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:10,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-05 11:29:10,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:29:10,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:29:10,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:29:10,357 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 6 states. [2019-09-05 11:29:10,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:10,454 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2019-09-05 11:29:10,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:29:10,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-09-05 11:29:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:10,455 INFO L225 Difference]: With dead ends: 63 [2019-09-05 11:29:10,456 INFO L226 Difference]: Without dead ends: 39 [2019-09-05 11:29:10,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:29:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-05 11:29:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-09-05 11:29:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 11:29:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-09-05 11:29:10,463 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 29 [2019-09-05 11:29:10,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:10,463 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-09-05 11:29:10,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:29:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-09-05 11:29:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 11:29:10,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:10,465 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:10,465 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:10,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:10,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1251798004, now seen corresponding path program 2 times [2019-09-05 11:29:10,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:10,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:10,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:10,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-05 11:29:10,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:10,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:10,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:10,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:10,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:10,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-05 11:29:10,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:10,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-05 11:29:10,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:29:10,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-05 11:29:10,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:29:10,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:29:10,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:29:10,739 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 8 states. [2019-09-05 11:29:10,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:10,973 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2019-09-05 11:29:10,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:29:10,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-09-05 11:29:10,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:10,976 INFO L225 Difference]: With dead ends: 93 [2019-09-05 11:29:10,977 INFO L226 Difference]: Without dead ends: 64 [2019-09-05 11:29:10,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:29:10,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-05 11:29:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 43. [2019-09-05 11:29:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 11:29:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-09-05 11:29:10,999 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 32 [2019-09-05 11:29:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:11,000 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-09-05 11:29:11,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:29:11,000 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-09-05 11:29:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 11:29:11,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:11,003 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-09-05 11:29:11,003 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:11,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:11,004 INFO L82 PathProgramCache]: Analyzing trace with hash -760243349, now seen corresponding path program 1 times [2019-09-05 11:29:11,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:11,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:11,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:11,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-05 11:29:11,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:11,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:11,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:11,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:29:11,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-05 11:29:11,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:11,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-05 11:29:11,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:29:11,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:29:11,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:29:11,291 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 8 states. [2019-09-05 11:29:11,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:11,405 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2019-09-05 11:29:11,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:29:11,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-09-05 11:29:11,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:11,407 INFO L225 Difference]: With dead ends: 78 [2019-09-05 11:29:11,407 INFO L226 Difference]: Without dead ends: 48 [2019-09-05 11:29:11,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:29:11,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-05 11:29:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-09-05 11:29:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-05 11:29:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-09-05 11:29:11,415 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 38 [2019-09-05 11:29:11,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:11,415 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-09-05 11:29:11,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:29:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-09-05 11:29:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 11:29:11,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:11,417 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:11,417 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:11,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:11,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1857691010, now seen corresponding path program 2 times [2019-09-05 11:29:11,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:11,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:11,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:11,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 11:29:11,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:11,490 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) [2019-09-05 11:29:11,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:11,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:11,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:11,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-05 11:29:11,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 11:29:11,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:11,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-05 11:29:11,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:29:11,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:29:11,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:29:11,604 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 9 states. [2019-09-05 11:29:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:11,817 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2019-09-05 11:29:11,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:29:11,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-09-05 11:29:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:11,819 INFO L225 Difference]: With dead ends: 96 [2019-09-05 11:29:11,819 INFO L226 Difference]: Without dead ends: 80 [2019-09-05 11:29:11,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:29:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-05 11:29:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2019-09-05 11:29:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-05 11:29:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-09-05 11:29:11,829 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 41 [2019-09-05 11:29:11,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:11,830 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-09-05 11:29:11,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:29:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2019-09-05 11:29:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 11:29:11,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:11,831 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:11,832 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:11,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:11,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2016774676, now seen corresponding path program 3 times [2019-09-05 11:29:11,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:11,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:11,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:11,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:11,904 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-05 11:29:11,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:11,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:11,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:11,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 11:29:11,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:11,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:29:11,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-05 11:29:12,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:12,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-05 11:29:12,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:29:12,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:29:12,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:29:12,045 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 10 states. [2019-09-05 11:29:12,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:12,317 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2019-09-05 11:29:12,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:29:12,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-09-05 11:29:12,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:12,319 INFO L225 Difference]: With dead ends: 121 [2019-09-05 11:29:12,319 INFO L226 Difference]: Without dead ends: 82 [2019-09-05 11:29:12,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:29:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-05 11:29:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 61. [2019-09-05 11:29:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-05 11:29:12,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-09-05 11:29:12,330 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 50 [2019-09-05 11:29:12,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:12,330 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-09-05 11:29:12,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:29:12,330 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-09-05 11:29:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 11:29:12,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:12,334 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:12,334 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:12,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:12,335 INFO L82 PathProgramCache]: Analyzing trace with hash -395002332, now seen corresponding path program 4 times [2019-09-05 11:29:12,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:12,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:12,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:12,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:12,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-05 11:29:12,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:12,459 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-05 11:29:12,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:12,524 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:29:12,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:12,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:29:12,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:29:12,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:12,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-05 11:29:12,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 11:29:12,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 11:29:12,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:29:12,603 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 12 states. [2019-09-05 11:29:12,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:12,854 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2019-09-05 11:29:12,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:29:12,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-09-05 11:29:12,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:12,856 INFO L225 Difference]: With dead ends: 140 [2019-09-05 11:29:12,856 INFO L226 Difference]: Without dead ends: 79 [2019-09-05 11:29:12,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:29:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-05 11:29:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2019-09-05 11:29:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-05 11:29:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2019-09-05 11:29:12,870 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 56 [2019-09-05 11:29:12,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:12,871 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2019-09-05 11:29:12,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 11:29:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2019-09-05 11:29:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-05 11:29:12,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:12,875 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:12,875 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:12,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:12,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1207541539, now seen corresponding path program 5 times [2019-09-05 11:29:12,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:12,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:12,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:12,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:12,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-05 11:29:12,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:12,979 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) [2019-09-05 11:29:13,001 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:15,756 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-05 11:29:15,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:15,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 11:29:15,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 61 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-05 11:29:15,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:15,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2019-09-05 11:29:15,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:29:15,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:29:15,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:29:15,849 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 11 states. [2019-09-05 11:29:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:15,917 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions. [2019-09-05 11:29:15,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:29:15,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-09-05 11:29:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:15,918 INFO L225 Difference]: With dead ends: 133 [2019-09-05 11:29:15,918 INFO L226 Difference]: Without dead ends: 91 [2019-09-05 11:29:15,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:29:15,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-05 11:29:15,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-05 11:29:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-05 11:29:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2019-09-05 11:29:15,928 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 68 [2019-09-05 11:29:15,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:15,928 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2019-09-05 11:29:15,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:29:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2019-09-05 11:29:15,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-05 11:29:15,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:15,930 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:15,930 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:15,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:15,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1964052579, now seen corresponding path program 6 times [2019-09-05 11:29:15,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:15,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:15,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:15,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:15,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 133 proven. 66 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-05 11:29:16,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:16,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:16,100 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:16,192 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-05 11:29:16,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:16,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:29:16,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-09-05 11:29:16,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:16,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-09-05 11:29:16,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 11:29:16,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 11:29:16,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:29:16,281 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand 12 states. [2019-09-05 11:29:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:16,883 INFO L93 Difference]: Finished difference Result 221 states and 282 transitions. [2019-09-05 11:29:16,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 11:29:16,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-09-05 11:29:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:16,886 INFO L225 Difference]: With dead ends: 221 [2019-09-05 11:29:16,886 INFO L226 Difference]: Without dead ends: 167 [2019-09-05 11:29:16,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=430, Invalid=830, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:29:16,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-05 11:29:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 103. [2019-09-05 11:29:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-05 11:29:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2019-09-05 11:29:16,908 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 86 [2019-09-05 11:29:16,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:16,909 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2019-09-05 11:29:16,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 11:29:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2019-09-05 11:29:16,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-05 11:29:16,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:16,910 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:16,911 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:16,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:16,911 INFO L82 PathProgramCache]: Analyzing trace with hash -55858988, now seen corresponding path program 7 times [2019-09-05 11:29:16,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:16,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:16,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:16,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:16,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 194 proven. 105 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-05 11:29:17,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:17,174 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) [2019-09-05 11:29:17,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:17,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 11:29:17,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 175 proven. 35 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-09-05 11:29:17,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:17,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-09-05 11:29:17,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:29:17,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:29:17,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:29:17,390 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand 15 states. [2019-09-05 11:29:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:17,478 INFO L93 Difference]: Finished difference Result 181 states and 225 transitions. [2019-09-05 11:29:17,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:29:17,479 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-09-05 11:29:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:17,480 INFO L225 Difference]: With dead ends: 181 [2019-09-05 11:29:17,480 INFO L226 Difference]: Without dead ends: 118 [2019-09-05 11:29:17,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:29:17,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-05 11:29:17,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2019-09-05 11:29:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-05 11:29:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2019-09-05 11:29:17,491 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 98 [2019-09-05 11:29:17,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:17,491 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2019-09-05 11:29:17,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:29:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2019-09-05 11:29:17,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-05 11:29:17,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:17,492 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 5, 5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:17,493 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:17,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:17,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1611432910, now seen corresponding path program 8 times [2019-09-05 11:29:17,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:17,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:17,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:17,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:17,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2019-09-05 11:29:17,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:17,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:17,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:17,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:17,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:17,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 11:29:17,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 245 proven. 51 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-09-05 11:29:18,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:18,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2019-09-05 11:29:18,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:29:18,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:29:18,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:29:18,084 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand 15 states. [2019-09-05 11:29:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:18,995 INFO L93 Difference]: Finished difference Result 302 states and 389 transitions. [2019-09-05 11:29:18,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-05 11:29:18,996 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 107 [2019-09-05 11:29:18,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:18,998 INFO L225 Difference]: With dead ends: 302 [2019-09-05 11:29:18,998 INFO L226 Difference]: Without dead ends: 233 [2019-09-05 11:29:19,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=931, Invalid=1931, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 11:29:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-09-05 11:29:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 124. [2019-09-05 11:29:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-05 11:29:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2019-09-05 11:29:19,011 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 107 [2019-09-05 11:29:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:19,011 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2019-09-05 11:29:19,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:29:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2019-09-05 11:29:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-05 11:29:19,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:19,013 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:19,013 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:19,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:19,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1536612197, now seen corresponding path program 9 times [2019-09-05 11:29:19,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:19,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:19,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:19,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:19,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-09-05 11:29:19,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:19,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:19,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:19,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 11:29:19,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:19,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 11:29:19,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2019-09-05 11:29:19,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:19,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-09-05 11:29:19,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:29:19,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:29:19,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:29:19,635 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand 14 states. [2019-09-05 11:29:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:20,048 INFO L93 Difference]: Finished difference Result 283 states and 354 transitions. [2019-09-05 11:29:20,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:29:20,048 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 119 [2019-09-05 11:29:20,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:20,051 INFO L225 Difference]: With dead ends: 283 [2019-09-05 11:29:20,051 INFO L226 Difference]: Without dead ends: 255 [2019-09-05 11:29:20,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:29:20,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-05 11:29:20,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 175. [2019-09-05 11:29:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-05 11:29:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 218 transitions. [2019-09-05 11:29:20,070 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 218 transitions. Word has length 119 [2019-09-05 11:29:20,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:20,071 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 218 transitions. [2019-09-05 11:29:20,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:29:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 218 transitions. [2019-09-05 11:29:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-05 11:29:20,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:20,076 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 6, 6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:20,076 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:20,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2094235774, now seen corresponding path program 10 times [2019-09-05 11:29:20,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:20,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:20,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:20,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:20,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 97 proven. 630 refuted. 0 times theorem prover too weak. 1354 trivial. 0 not checked. [2019-09-05 11:29:20,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:20,447 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-05 11:29:20,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:20,616 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:29:20,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:20,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 11:29:20,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 56 proven. 630 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2019-09-05 11:29:20,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:20,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 26 [2019-09-05 11:29:20,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 11:29:20,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 11:29:20,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:29:20,897 INFO L87 Difference]: Start difference. First operand 175 states and 218 transitions. Second operand 26 states. [2019-09-05 11:29:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:23,511 INFO L93 Difference]: Finished difference Result 460 states and 597 transitions. [2019-09-05 11:29:23,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-05 11:29:23,512 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 170 [2019-09-05 11:29:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:23,515 INFO L225 Difference]: With dead ends: 460 [2019-09-05 11:29:23,516 INFO L226 Difference]: Without dead ends: 331 [2019-09-05 11:29:23,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3317 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1963, Invalid=8749, Unknown=0, NotChecked=0, Total=10712 [2019-09-05 11:29:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-05 11:29:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 193. [2019-09-05 11:29:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-05 11:29:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 241 transitions. [2019-09-05 11:29:23,537 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 241 transitions. Word has length 170 [2019-09-05 11:29:23,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:23,538 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 241 transitions. [2019-09-05 11:29:23,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 11:29:23,538 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 241 transitions. [2019-09-05 11:29:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-05 11:29:23,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:23,540 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 7, 7, 7, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:23,540 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:23,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:23,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1532723971, now seen corresponding path program 11 times [2019-09-05 11:29:23,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:23,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:23,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:23,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:23,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2680 backedges. 925 proven. 644 refuted. 0 times theorem prover too weak. 1111 trivial. 0 not checked. [2019-09-05 11:29:24,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:24,019 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) [2019-09-05 11:29:24,047 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:35:40,037 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-09-05 11:35:40,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:35:40,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 11:35:40,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:35:40,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2680 backedges. 1475 proven. 92 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2019-09-05 11:35:40,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:35:40,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-09-05 11:35:40,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 11:35:40,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 11:35:40,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:35:40,455 INFO L87 Difference]: Start difference. First operand 193 states and 241 transitions. Second operand 21 states. [2019-09-05 11:35:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:35:40,593 INFO L93 Difference]: Finished difference Result 362 states and 463 transitions. [2019-09-05 11:35:40,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 11:35:40,596 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 188 [2019-09-05 11:35:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:35:40,597 INFO L225 Difference]: With dead ends: 362 [2019-09-05 11:35:40,597 INFO L226 Difference]: Without dead ends: 218 [2019-09-05 11:35:40,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:35:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-05 11:35:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 208. [2019-09-05 11:35:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-05 11:35:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 261 transitions. [2019-09-05 11:35:40,613 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 261 transitions. Word has length 188 [2019-09-05 11:35:40,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:35:40,613 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 261 transitions. [2019-09-05 11:35:40,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 11:35:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 261 transitions. [2019-09-05 11:35:40,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-05 11:35:40,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:35:40,616 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 7, 7, 7, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:35:40,616 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:35:40,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:35:40,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1256991469, now seen corresponding path program 12 times [2019-09-05 11:35:40,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:35:40,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:35:40,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:40,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:35:40,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:35:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 1146 proven. 819 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2019-09-05 11:35:41,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:35:41,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:35:41,393 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:35:48,477 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-05 11:35:48,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:35:48,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-05 11:35:48,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:35:48,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-09-05 11:35:48,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:48,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:48,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:48,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:65 [2019-09-05 11:35:48,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:48,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:48,659 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:48,672 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:48,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 82 [2019-09-05 11:35:48,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:48,734 INFO L567 ElimStorePlain]: treesize reduction 60, result has 55.9 percent of original size [2019-09-05 11:35:48,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:48,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:76 [2019-09-05 11:35:48,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:48,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:48,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:48,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:48,846 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:48,847 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:48,860 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:48,861 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 5 case distinctions, treesize of input 55 treesize of output 90 [2019-09-05 11:35:48,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:48,955 INFO L567 ElimStorePlain]: treesize reduction 60, result has 56.5 percent of original size [2019-09-05 11:35:48,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:48,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:78 [2019-09-05 11:35:49,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:49,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:49,064 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:49,066 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:49,120 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:49,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 66 treesize of output 158 [2019-09-05 11:35:49,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:49,257 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-05 11:35:49,258 INFO L567 ElimStorePlain]: treesize reduction 78, result has 55.4 percent of original size [2019-09-05 11:35:49,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:49,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:35:49,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:93, output treesize:97 [2019-09-05 11:35:49,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:50,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:51,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:52,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:52,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:52,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:52,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:52,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:52,126 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:52,127 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:52,164 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:52,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 93 treesize of output 185 [2019-09-05 11:35:52,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:52,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:52,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:52,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:52,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:52,208 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:52,209 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:52,280 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:52,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 261 [2019-09-05 11:35:52,285 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:52,573 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2019-09-05 11:35:52,574 INFO L567 ElimStorePlain]: treesize reduction 256, result has 42.1 percent of original size [2019-09-05 11:35:52,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-09-05 11:35:52,576 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:198, output treesize:186 [2019-09-05 11:35:54,324 WARN L188 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 62 [2019-09-05 11:35:55,815 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 63 [2019-09-05 11:35:57,544 WARN L188 SmtUtils]: Spent 1.68 s on a formula simplification that was a NOOP. DAG size: 64 [2019-09-05 11:35:57,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:57,561 INFO L392 ElimStorePlain]: Different costs {56=[|v_#memory_int_17|], 72=[v_prenex_2]} [2019-09-05 11:35:57,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:57,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:57,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:57,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:57,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:57,598 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:57,600 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:57,601 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:57,967 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-05 11:35:57,968 INFO L341 Elim1Store]: treesize reduction 68, result has 73.9 percent of original size [2019-09-05 11:35:57,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 113 treesize of output 278 [2019-09-05 11:35:57,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:57,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:57,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:57,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,295 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 84 [2019-09-05 11:35:58,296 INFO L567 ElimStorePlain]: treesize reduction 274, result has 46.9 percent of original size [2019-09-05 11:35:58,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:58,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:58,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:58,316 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:58,317 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:35:58,450 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-05 11:35:58,451 INFO L341 Elim1Store]: treesize reduction 30, result has 85.9 percent of original size [2019-09-05 11:35:58,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, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 128 treesize of output 291 [2019-09-05 11:35:58,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,716 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-05 11:35:58,717 INFO L567 ElimStorePlain]: treesize reduction 141, result has 62.8 percent of original size [2019-09-05 11:35:58,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-09-05 11:35:58,718 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:242, output treesize:238 [2019-09-05 11:35:59,388 WARN L188 SmtUtils]: Spent 612.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-09-05 11:35:59,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:59,708 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-05 11:35:59,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,296 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-09-05 11:36:00,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,360 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:36:00,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,448 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:36:00,507 INFO L235 Elim1Store]: Index analysis took 171 ms [2019-09-05 11:36:00,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,522 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:36:00,522 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:36:00,524 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:36:00,525 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:36:00,818 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-05 11:36:00,818 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:36:00,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 8 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 38 case distinctions, treesize of input 160 treesize of output 572 [2019-09-05 11:36:00,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:00,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,919 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:36:00,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,938 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:36:00,938 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:36:00,939 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:36:01,120 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-05 11:36:01,120 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:36:01,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 10 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 154 treesize of output 436 [2019-09-05 11:36:01,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:01,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:01,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:01,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:01,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:01,130 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:02,846 WARN L188 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 348 DAG size of output: 120 [2019-09-05 11:36:02,847 INFO L567 ElimStorePlain]: treesize reduction 4894, result has 12.6 percent of original size [2019-09-05 11:36:02,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-09-05 11:36:02,898 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:315, output treesize:699 [2019-09-05 11:36:02,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:36:02,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,251 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-09-05 11:36:03,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:36:03,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:03,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:05,406 WARN L188 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 226 DAG size of output: 116 [2019-09-05 11:36:05,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-05 11:36:05,455 INFO L392 ElimStorePlain]: Different costs {67=[v_prenex_20, v_prenex_13], 77=[v_prenex_33, v_prenex_39], 99=[v_prenex_10, |#memory_int|, v_prenex_26]} [2019-09-05 11:36:05,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:05,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:05,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:05,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:05,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:05,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:36:05,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 14 case distinctions, treesize of input 117 treesize of output 167 [2019-09-05 11:36:05,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:05,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:05,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:05,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:05,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:05,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:05,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:05,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:05,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:05,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:05,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:06,344 WARN L188 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 322 [2019-09-05 11:36:06,344 INFO L567 ElimStorePlain]: treesize reduction 63, result has 93.0 percent of original size [2019-09-05 11:36:06,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:06,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:06,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:06,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:06,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:06,572 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-05 11:36:06,572 INFO L341 Elim1Store]: treesize reduction 48, result has 72.3 percent of original size [2019-09-05 11:36:06,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 8 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 27 case distinctions, treesize of input 115 treesize of output 179 [2019-09-05 11:36:06,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:06,595 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:08,103 WARN L188 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 351 DAG size of output: 307 [2019-09-05 11:36:08,104 INFO L567 ElimStorePlain]: treesize reduction 248, result has 75.8 percent of original size [2019-09-05 11:36:08,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:08,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:08,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:08,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:08,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:08,218 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:36:08,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 9 disjoint index pairs (out of 55 index pairs), introduced 13 new quantified variables, introduced 17 case distinctions, treesize of input 128 treesize of output 178 [2019-09-05 11:36:08,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:08,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:08,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:08,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:08,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:08,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:08,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:08,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:08,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:08,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:08,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:08,227 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:08,972 WARN L188 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 286 [2019-09-05 11:36:08,973 INFO L567 ElimStorePlain]: treesize reduction 69, result has 91.0 percent of original size [2019-09-05 11:36:08,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:08,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:08,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:08,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:08,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:09,234 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 86 [2019-09-05 11:36:09,235 INFO L341 Elim1Store]: treesize reduction 96, result has 60.8 percent of original size [2019-09-05 11:36:09,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 7 disjoint index pairs (out of 55 index pairs), introduced 13 new quantified variables, introduced 43 case distinctions, treesize of input 114 treesize of output 202 [2019-09-05 11:36:09,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:09,259 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:10,052 WARN L188 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 272 [2019-09-05 11:36:10,052 INFO L567 ElimStorePlain]: treesize reduction 182, result has 78.1 percent of original size [2019-09-05 11:36:10,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:10,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:10,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:10,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:10,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:10,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:10,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:10,360 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2019-09-05 11:36:10,360 INFO L341 Elim1Store]: treesize reduction 48, result has 78.9 percent of original size [2019-09-05 11:36:10,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 10 disjoint index pairs (out of 66 index pairs), introduced 14 new quantified variables, introduced 36 case distinctions, treesize of input 138 treesize of output 250 [2019-09-05 11:36:10,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:10,539 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:11,834 WARN L188 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 375 DAG size of output: 252 [2019-09-05 11:36:11,835 INFO L567 ElimStorePlain]: treesize reduction 1809, result has 24.0 percent of original size [2019-09-05 11:36:11,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:11,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:11,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:11,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:11,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:11,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:11,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:11,982 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-05 11:36:11,983 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:36:11,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 11 disjoint index pairs (out of 66 index pairs), introduced 14 new quantified variables, introduced 21 case distinctions, treesize of input 146 treesize of output 238 [2019-09-05 11:36:11,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:11,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,054 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:12,756 WARN L188 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 230 [2019-09-05 11:36:12,757 INFO L567 ElimStorePlain]: treesize reduction 964, result has 33.7 percent of original size [2019-09-05 11:36:12,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:12,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:12,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:12,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:12,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:12,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:12,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:12,908 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-05 11:36:12,909 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:36:12,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 11 disjoint index pairs (out of 66 index pairs), introduced 14 new quantified variables, introduced 21 case distinctions, treesize of input 148 treesize of output 238 [2019-09-05 11:36:12,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:12,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,021 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:13,721 WARN L188 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 207 [2019-09-05 11:36:13,722 INFO L567 ElimStorePlain]: treesize reduction 1017, result has 28.5 percent of original size [2019-09-05 11:36:13,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:13,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 38 dim-0 vars, 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:36:13,729 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 45 variables, input treesize:907, output treesize:14 [2019-09-05 11:36:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 234 proven. 34 refuted. 0 times theorem prover too weak. 3067 trivial. 0 not checked. [2019-09-05 11:36:13,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:13,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 29 [2019-09-05 11:36:13,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:36:13,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:36:13,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=699, Unknown=1, NotChecked=0, Total=812 [2019-09-05 11:36:13,973 INFO L87 Difference]: Start difference. First operand 208 states and 261 transitions. Second operand 29 states. [2019-09-05 11:36:15,400 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-05 11:36:30,388 WARN L188 SmtUtils]: Spent 14.90 s on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-05 11:36:31,556 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-09-05 11:36:32,884 WARN L188 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-05 11:36:33,271 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-09-05 11:36:35,881 WARN L188 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2019-09-05 11:36:36,356 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2019-09-05 11:36:36,849 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 78 [2019-09-05 11:36:37,340 WARN L188 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 84 [2019-09-05 11:36:37,817 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 148 [2019-09-05 11:36:38,655 WARN L188 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 126 [2019-09-05 11:36:39,300 WARN L188 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 79 [2019-09-05 11:36:40,161 WARN L188 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 131 [2019-09-05 11:36:40,802 WARN L188 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 84 [2019-09-05 11:36:41,462 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-05 11:36:42,076 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-05 11:36:42,689 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-05 11:36:43,296 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-05 11:36:43,904 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-05 11:36:44,514 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-05 11:36:45,127 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-05 11:36:45,801 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-05 11:36:47,502 WARN L188 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2019-09-05 11:36:48,746 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 109 DAG size of output: 84 [2019-09-05 11:36:50,657 WARN L188 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 114 DAG size of output: 90 [2019-09-05 11:36:51,139 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 144 [2019-09-05 11:36:52,102 WARN L188 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 121 [2019-09-05 11:36:52,746 WARN L188 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 88 [2019-09-05 11:36:53,708 WARN L188 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2019-09-05 11:36:54,351 WARN L188 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 93 [2019-09-05 11:36:56,000 WARN L188 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-05 11:36:58,386 WARN L188 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-05 11:36:59,732 WARN L188 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-05 11:37:01,174 WARN L188 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-05 11:37:02,920 WARN L188 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-05 11:37:04,176 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-05 11:37:05,590 WARN L188 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-05 11:37:07,005 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-05 11:37:09,821 WARN L188 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-09-05 11:37:10,390 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 83 [2019-09-05 11:37:10,954 WARN L188 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2019-09-05 11:37:11,633 WARN L188 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 87 [2019-09-05 11:37:12,292 WARN L188 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 92 [2019-09-05 11:37:12,858 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-05 11:37:13,417 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-05 11:37:13,976 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-05 11:37:14,530 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-05 11:37:15,130 WARN L188 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-05 11:37:15,708 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-05 11:37:16,284 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-05 11:37:16,878 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-05 11:37:17,604 WARN L188 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 81 [2019-09-05 11:37:18,165 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-09-05 11:37:18,713 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2019-09-05 11:37:19,258 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2019-09-05 11:37:19,878 WARN L188 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 80 [2019-09-05 11:37:20,549 WARN L188 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 85 [2019-09-05 11:37:21,099 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-05 11:37:21,658 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-05 11:37:22,244 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-05 11:37:22,832 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-05 11:37:23,423 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-05 11:37:24,062 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-05 11:37:24,737 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-05 11:37:25,417 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-05 11:37:25,735 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-09-05 11:37:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:37:26,781 INFO L93 Difference]: Finished difference Result 642 states and 834 transitions. [2019-09-05 11:37:26,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-05 11:37:26,782 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 203 [2019-09-05 11:37:26,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:37:26,786 INFO L225 Difference]: With dead ends: 642 [2019-09-05 11:37:26,787 INFO L226 Difference]: Without dead ends: 463 [2019-09-05 11:37:26,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4432 ImplicationChecksByTransitivity, 81.3s TimeCoverageRelationStatistics Valid=2365, Invalid=10744, Unknown=1, NotChecked=0, Total=13110 [2019-09-05 11:37:26,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-05 11:37:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 398. [2019-09-05 11:37:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-05 11:37:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 505 transitions. [2019-09-05 11:37:26,866 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 505 transitions. Word has length 203 [2019-09-05 11:37:26,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:37:26,867 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 505 transitions. [2019-09-05 11:37:26,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:37:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 505 transitions. [2019-09-05 11:37:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-05 11:37:26,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:37:26,873 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 49, 7, 7, 7, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:37:26,874 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:37:26,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:37:26,874 INFO L82 PathProgramCache]: Analyzing trace with hash -13411013, now seen corresponding path program 1 times [2019-09-05 11:37:26,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:37:26,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:37:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:26,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:37:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4065 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 3995 trivial. 0 not checked. [2019-09-05 11:37:28,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:37:28,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:37:28,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:37:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:28,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 11:37:28,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:37:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4065 backedges. 1289 proven. 145 refuted. 0 times theorem prover too weak. 2631 trivial. 0 not checked. [2019-09-05 11:37:28,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:37:28,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 22 [2019-09-05 11:37:28,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 11:37:28,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 11:37:28,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:37:28,712 INFO L87 Difference]: Start difference. First operand 398 states and 505 transitions. Second operand 22 states. [2019-09-05 11:37:31,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:37:31,606 INFO L93 Difference]: Finished difference Result 1130 states and 1480 transitions. [2019-09-05 11:37:31,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-09-05 11:37:31,607 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 218 [2019-09-05 11:37:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:37:31,612 INFO L225 Difference]: With dead ends: 1130 [2019-09-05 11:37:31,613 INFO L226 Difference]: Without dead ends: 816 [2019-09-05 11:37:31,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4401 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4074, Invalid=9498, Unknown=0, NotChecked=0, Total=13572 [2019-09-05 11:37:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2019-09-05 11:37:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 431. [2019-09-05 11:37:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-05 11:37:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 548 transitions. [2019-09-05 11:37:31,672 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 548 transitions. Word has length 218 [2019-09-05 11:37:31,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:37:31,673 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 548 transitions. [2019-09-05 11:37:31,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 11:37:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 548 transitions. [2019-09-05 11:37:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-05 11:37:31,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:37:31,676 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 54, 8, 8, 8, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:37:31,677 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:37:31,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:37:31,677 INFO L82 PathProgramCache]: Analyzing trace with hash -346827936, now seen corresponding path program 2 times [2019-09-05 11:37:31,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:37:31,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:37:31,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:31,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:37:31,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4892 backedges. 1660 proven. 1232 refuted. 0 times theorem prover too weak. 2000 trivial. 0 not checked. [2019-09-05 11:37:32,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:37:32,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:37:32,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:37:32,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:37:32,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:37:32,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 11:37:32,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:37:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4892 backedges. 1549 proven. 176 refuted. 0 times theorem prover too weak. 3167 trivial. 0 not checked. [2019-09-05 11:37:32,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:37:32,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2019-09-05 11:37:32,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:37:32,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:37:32,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=417, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:37:32,751 INFO L87 Difference]: Start difference. First operand 431 states and 548 transitions. Second operand 27 states. [2019-09-05 11:37:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:37:32,964 INFO L93 Difference]: Finished difference Result 822 states and 1064 transitions. [2019-09-05 11:37:32,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:37:32,965 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 236 [2019-09-05 11:37:32,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:37:32,968 INFO L225 Difference]: With dead ends: 822 [2019-09-05 11:37:32,968 INFO L226 Difference]: Without dead ends: 481 [2019-09-05 11:37:32,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=285, Invalid=417, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:37:32,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-09-05 11:37:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 461. [2019-09-05 11:37:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-09-05 11:37:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 588 transitions. [2019-09-05 11:37:33,016 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 588 transitions. Word has length 236 [2019-09-05 11:37:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:37:33,017 INFO L475 AbstractCegarLoop]: Abstraction has 461 states and 588 transitions. [2019-09-05 11:37:33,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:37:33,017 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 588 transitions. [2019-09-05 11:37:33,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-05 11:37:33,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:37:33,021 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 59, 8, 8, 8, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:37:33,021 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:37:33,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:37:33,021 INFO L82 PathProgramCache]: Analyzing trace with hash -984782828, now seen corresponding path program 3 times [2019-09-05 11:37:33,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:37:33,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:37:33,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:33,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:37:33,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5772 backedges. 1833 proven. 210 refuted. 0 times theorem prover too weak. 3729 trivial. 0 not checked. [2019-09-05 11:37:34,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:37:34,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:37:34,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:37:34,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-05 11:37:34,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:37:34,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 11:37:34,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:37:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5772 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 5680 trivial. 0 not checked. [2019-09-05 11:37:34,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:37:34,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2019-09-05 11:37:34,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:37:34,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:37:34,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:37:34,839 INFO L87 Difference]: Start difference. First operand 461 states and 588 transitions. Second operand 25 states. [2019-09-05 11:37:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:37:39,730 INFO L93 Difference]: Finished difference Result 1392 states and 1829 transitions. [2019-09-05 11:37:39,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-05 11:37:39,733 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 251 [2019-09-05 11:37:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:37:39,737 INFO L225 Difference]: With dead ends: 1392 [2019-09-05 11:37:39,737 INFO L226 Difference]: Without dead ends: 1027 [2019-09-05 11:37:39,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8484 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6906, Invalid=16656, Unknown=0, NotChecked=0, Total=23562 [2019-09-05 11:37:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-09-05 11:37:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 494. [2019-09-05 11:37:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-09-05 11:37:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 631 transitions. [2019-09-05 11:37:39,807 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 631 transitions. Word has length 251 [2019-09-05 11:37:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:37:39,807 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 631 transitions. [2019-09-05 11:37:39,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:37:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 631 transitions. [2019-09-05 11:37:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-05 11:37:39,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:37:39,810 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 64, 9, 9, 9, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:37:39,810 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:37:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:37:39,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1805036849, now seen corresponding path program 4 times [2019-09-05 11:37:39,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:37:39,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:37:39,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:39,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:37:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6752 backedges. 2270 proven. 1729 refuted. 0 times theorem prover too weak. 2753 trivial. 0 not checked. [2019-09-05 11:37:40,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:37:40,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:37:40,539 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:37:40,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:37:40,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:37:40,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 11:37:40,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:37:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6752 backedges. 215 proven. 2130 refuted. 0 times theorem prover too weak. 4407 trivial. 0 not checked. [2019-09-05 11:37:41,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:37:41,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 41 [2019-09-05 11:37:41,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-05 11:37:41,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-05 11:37:41,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1333, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:37:41,312 INFO L87 Difference]: Start difference. First operand 494 states and 631 transitions. Second operand 41 states. [2019-09-05 11:37:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:37:47,268 INFO L93 Difference]: Finished difference Result 1588 states and 2090 transitions. [2019-09-05 11:37:47,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-09-05 11:37:47,269 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 269 [2019-09-05 11:37:47,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:37:47,274 INFO L225 Difference]: With dead ends: 1588 [2019-09-05 11:37:47,274 INFO L226 Difference]: Without dead ends: 1196 [2019-09-05 11:37:47,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16298 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6193, Invalid=39817, Unknown=0, NotChecked=0, Total=46010 [2019-09-05 11:37:47,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2019-09-05 11:37:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 527. [2019-09-05 11:37:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-05 11:37:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 674 transitions. [2019-09-05 11:37:47,356 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 674 transitions. Word has length 269 [2019-09-05 11:37:47,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:37:47,356 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 674 transitions. [2019-09-05 11:37:47,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-05 11:37:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 674 transitions. [2019-09-05 11:37:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-05 11:37:47,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:37:47,359 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 69, 10, 10, 10, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:37:47,359 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:37:47,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:37:47,359 INFO L82 PathProgramCache]: Analyzing trace with hash 315672116, now seen corresponding path program 5 times [2019-09-05 11:37:47,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:37:47,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:37:47,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:47,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:37:47,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 7810 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 7665 trivial. 0 not checked. [2019-09-05 11:37:48,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:37:48,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:37:48,113 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1