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/array-tiling/tcpy.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:40:31,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:40:31,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:40:31,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:40:31,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:40:31,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:40:31,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:40:31,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:40:31,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:40:31,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:40:31,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:40:31,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:40:31,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:40:31,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:40:31,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:40:31,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:40:31,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:40:31,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:40:31,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:40:31,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:40:31,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:40:31,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:40:31,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:40:31,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:40:31,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:40:31,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:40:31,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:40:31,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:40:31,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:40:31,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:40:31,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:40:31,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:40:31,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:40:31,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:40:31,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:40:31,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:40:31,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:40:31,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:40:31,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:40:31,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:40:31,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:40:31,909 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 00:40:31,931 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:40:31,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:40:31,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:40:31,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:40:31,935 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:40:31,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:40:31,935 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:40:31,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:40:31,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:40:31,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:40:31,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:40:31,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:40:31,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:40:31,937 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:40:31,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:40:31,938 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:40:31,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:40:31,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:40:31,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:40:31,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:40:31,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:40:31,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:40:31,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:40:31,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:40:31,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:40:31,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:40:31,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:40:31,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:40:31,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:40:31,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:40:31,998 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:40:32,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:40:32,003 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:40:32,004 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:40:32,005 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/tcpy.c [2019-10-02 00:40:32,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95e1ff630/c6696e1c81984f9ab2c1df8fe938bf50/FLAGe106fb701 [2019-10-02 00:40:32,495 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:40:32,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/tcpy.c [2019-10-02 00:40:32,503 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95e1ff630/c6696e1c81984f9ab2c1df8fe938bf50/FLAGe106fb701 [2019-10-02 00:40:32,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95e1ff630/c6696e1c81984f9ab2c1df8fe938bf50 [2019-10-02 00:40:32,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:40:32,918 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:40:32,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:40:32,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:40:32,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:40:32,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:40:32" (1/1) ... [2019-10-02 00:40:32,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614b2340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:32, skipping insertion in model container [2019-10-02 00:40:32,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:40:32" (1/1) ... [2019-10-02 00:40:32,936 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:40:32,954 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:40:33,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:40:33,214 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:40:33,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:40:33,340 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:40:33,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:33 WrapperNode [2019-10-02 00:40:33,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:40:33,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:40:33,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:40:33,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:40:33,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:33" (1/1) ... [2019-10-02 00:40:33,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:33" (1/1) ... [2019-10-02 00:40:33,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:33" (1/1) ... [2019-10-02 00:40:33,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:33" (1/1) ... [2019-10-02 00:40:33,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:33" (1/1) ... [2019-10-02 00:40:33,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:33" (1/1) ... [2019-10-02 00:40:33,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:33" (1/1) ... [2019-10-02 00:40:33,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:40:33,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:40:33,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:40:33,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:40:33,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:40:33,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:40:33,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:40:33,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 00:40:33,454 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:40:33,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:40:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 00:40:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 00:40:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:40:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 00:40:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:40:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 00:40:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 00:40:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 00:40:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:40:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:40:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 00:40:33,763 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:40:33,763 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-02 00:40:33,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:40:33 BoogieIcfgContainer [2019-10-02 00:40:33,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:40:33,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:40:33,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:40:33,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:40:33,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:40:32" (1/3) ... [2019-10-02 00:40:33,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a1084c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:40:33, skipping insertion in model container [2019-10-02 00:40:33,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:33" (2/3) ... [2019-10-02 00:40:33,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a1084c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:40:33, skipping insertion in model container [2019-10-02 00:40:33,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:40:33" (3/3) ... [2019-10-02 00:40:33,782 INFO L109 eAbstractionObserver]: Analyzing ICFG tcpy.c [2019-10-02 00:40:33,795 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:40:33,802 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:40:33,830 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:40:33,868 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:40:33,869 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:40:33,869 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:40:33,869 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:40:33,869 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:40:33,870 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:40:33,870 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:40:33,870 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:40:33,870 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:40:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-02 00:40:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 00:40:33,891 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:33,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:33,895 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:33,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:33,899 INFO L82 PathProgramCache]: Analyzing trace with hash 941892528, now seen corresponding path program 1 times [2019-10-02 00:40:33,901 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:33,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:33,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:33,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:40:33,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:40:34,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:40:34,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 00:40:34,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 00:40:34,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 00:40:34,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 00:40:34,059 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-10-02 00:40:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:34,080 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2019-10-02 00:40:34,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 00:40:34,081 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-02 00:40:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:34,090 INFO L225 Difference]: With dead ends: 47 [2019-10-02 00:40:34,090 INFO L226 Difference]: Without dead ends: 23 [2019-10-02 00:40:34,093 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 00:40:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-02 00:40:34,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-02 00:40:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-02 00:40:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-02 00:40:34,136 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2019-10-02 00:40:34,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:34,137 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-02 00:40:34,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 00:40:34,137 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-02 00:40:34,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 00:40:34,138 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:34,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:34,139 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:34,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:34,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2128337372, now seen corresponding path program 1 times [2019-10-02 00:40:34,139 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:34,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:34,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:34,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:40:34,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:40:34,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:40:34,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:40:34,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:40:34,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:40:34,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:40:34,248 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2019-10-02 00:40:34,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:34,302 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-10-02 00:40:34,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:40:34,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-02 00:40:34,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:34,304 INFO L225 Difference]: With dead ends: 39 [2019-10-02 00:40:34,304 INFO L226 Difference]: Without dead ends: 25 [2019-10-02 00:40:34,305 INFO L640 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-10-02 00:40:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-02 00:40:34,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-02 00:40:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-02 00:40:34,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-02 00:40:34,312 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2019-10-02 00:40:34,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:34,313 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-02 00:40:34,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:40:34,313 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-02 00:40:34,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 00:40:34,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:34,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:34,316 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:34,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:34,316 INFO L82 PathProgramCache]: Analyzing trace with hash 823833890, now seen corresponding path program 1 times [2019-10-02 00:40:34,317 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:34,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:34,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:34,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:40:34,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 00:40:34,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:40:34,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 00:40:34,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 00:40:34,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 00:40:34,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 00:40:34,409 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2019-10-02 00:40:34,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:34,500 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-10-02 00:40:34,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:40:34,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-02 00:40:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:34,504 INFO L225 Difference]: With dead ends: 42 [2019-10-02 00:40:34,504 INFO L226 Difference]: Without dead ends: 31 [2019-10-02 00:40:34,505 INFO L640 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-10-02 00:40:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-02 00:40:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-10-02 00:40:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-02 00:40:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-10-02 00:40:34,518 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2019-10-02 00:40:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:34,518 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-02 00:40:34,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 00:40:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-10-02 00:40:34,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 00:40:34,519 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:34,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:34,520 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:34,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:34,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1371679936, now seen corresponding path program 1 times [2019-10-02 00:40:34,521 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:34,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:34,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:34,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:40:34,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 00:40:34,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:34,599 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:34,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:40:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:34,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:40:34,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 00:40:34,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:34,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-10-02 00:40:34,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:40:34,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:40:34,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:40:34,775 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2019-10-02 00:40:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:34,888 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-10-02 00:40:34,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 00:40:34,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-02 00:40:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:34,890 INFO L225 Difference]: With dead ends: 43 [2019-10-02 00:40:34,891 INFO L226 Difference]: Without dead ends: 28 [2019-10-02 00:40:34,893 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-10-02 00:40:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-02 00:40:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-02 00:40:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 00:40:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-02 00:40:34,904 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2019-10-02 00:40:34,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:34,905 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-02 00:40:34,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:40:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-02 00:40:34,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 00:40:34,908 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:34,908 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:34,909 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:34,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:34,909 INFO L82 PathProgramCache]: Analyzing trace with hash -172159810, now seen corresponding path program 2 times [2019-10-02 00:40:34,909 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:34,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:34,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:34,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:40:34,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:40:35,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:35,778 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:40:35,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:35,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:40:35,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:40:35,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-02 00:40:35,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:35,908 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 10 treesize of output 8 [2019-10-02 00:40:35,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:35,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:35,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:35,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-02 00:40:36,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:36,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:36,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:36,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2019-10-02 00:40:36,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:36,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:36,059 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-10-02 00:40:36,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:48 [2019-10-02 00:40:36,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:36,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2019-10-02 00:40:36,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:36,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:36,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:36,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2019-10-02 00:40:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:40:36,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:36,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2019-10-02 00:40:36,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 00:40:36,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 00:40:36,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-10-02 00:40:36,277 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 20 states. [2019-10-02 00:40:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:37,540 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2019-10-02 00:40:37,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 00:40:37,541 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2019-10-02 00:40:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:37,543 INFO L225 Difference]: With dead ends: 76 [2019-10-02 00:40:37,543 INFO L226 Difference]: Without dead ends: 74 [2019-10-02 00:40:37,544 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=264, Invalid=926, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 00:40:37,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-02 00:40:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 33. [2019-10-02 00:40:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 00:40:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-02 00:40:37,555 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2019-10-02 00:40:37,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:37,556 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-02 00:40:37,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 00:40:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-02 00:40:37,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 00:40:37,557 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:37,557 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 00:40:37,558 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:37,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:37,558 INFO L82 PathProgramCache]: Analyzing trace with hash 606859858, now seen corresponding path program 1 times [2019-10-02 00:40:37,559 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:37,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:37,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:37,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:40:37,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:40:38,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:38,605 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:38,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:40:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:38,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 00:40:38,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:38,655 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 10 treesize of output 8 [2019-10-02 00:40:38,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:38,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:38,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:38,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-02 00:40:38,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-02 00:40:38,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:38,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:38,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:38,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-10-02 00:40:38,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:38,846 INFO L341 Elim1Store]: treesize reduction 31, result has 45.6 percent of original size [2019-10-02 00:40:38,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 52 [2019-10-02 00:40:38,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:38,869 INFO L567 ElimStorePlain]: treesize reduction 26, result has 62.3 percent of original size [2019-10-02 00:40:38,871 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-10-02 00:40:38,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:43 [2019-10-02 00:40:40,981 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_main_~acopy~0.offset_BEFORE_CALL_1 Int) (v_main_~acopy~0.base_BEFORE_CALL_1 Int) (~SIZE~0 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1)) (.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_1))) (and (= (select .cse0 v_main_~acopy~0.offset_BEFORE_CALL_1) (select .cse1 v_main_~a~0.offset_BEFORE_CALL_1)) (not (= v_main_~a~0.base_BEFORE_CALL_1 v_main_~acopy~0.base_BEFORE_CALL_1)) (< 1 ~SIZE~0) (let ((.cse2 (* 4 ~SIZE~0))) (= (select .cse1 (+ .cse2 v_main_~a~0.offset_BEFORE_CALL_1 (- 4))) (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_1 .cse2 (- 4))))) (<= ~SIZE~0 2)))) is different from true [2019-10-02 00:40:41,139 INFO L341 Elim1Store]: treesize reduction 20, result has 74.0 percent of original size [2019-10-02 00:40:41,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 69 [2019-10-02 00:40:41,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:40:41,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:40:41,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:40:41,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:40:41,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:40:41,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-02 00:40:41,187 INFO L567 ElimStorePlain]: treesize reduction 23, result has 37.8 percent of original size [2019-10-02 00:40:41,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:41,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:3 [2019-10-02 00:40:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:40:41,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:41,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-10-02 00:40:41,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 00:40:41,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 00:40:41,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=485, Unknown=1, NotChecked=44, Total=600 [2019-10-02 00:40:41,255 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 25 states. [2019-10-02 00:40:45,937 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2019-10-02 00:40:47,991 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 32 [2019-10-02 00:40:52,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:52,412 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-10-02 00:40:52,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 00:40:52,413 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2019-10-02 00:40:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:52,416 INFO L225 Difference]: With dead ends: 81 [2019-10-02 00:40:52,417 INFO L226 Difference]: Without dead ends: 62 [2019-10-02 00:40:52,418 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=4, NotChecked=72, Total=1482 [2019-10-02 00:40:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-02 00:40:52,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2019-10-02 00:40:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-02 00:40:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-10-02 00:40:52,430 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 30 [2019-10-02 00:40:52,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:52,430 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-10-02 00:40:52,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 00:40:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-10-02 00:40:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 00:40:52,432 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:52,432 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:52,432 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:52,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1975161648, now seen corresponding path program 2 times [2019-10-02 00:40:52,433 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:52,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:52,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:52,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:40:52,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 00:40:52,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:52,665 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:52,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:40:52,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:40:52,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:40:52,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 00:40:52,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:40:52,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:52,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-10-02 00:40:52,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 00:40:52,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 00:40:52,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-02 00:40:52,846 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 13 states. [2019-10-02 00:40:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:40:53,172 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2019-10-02 00:40:53,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 00:40:53,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-10-02 00:40:53,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:40:53,175 INFO L225 Difference]: With dead ends: 83 [2019-10-02 00:40:53,175 INFO L226 Difference]: Without dead ends: 66 [2019-10-02 00:40:53,176 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-10-02 00:40:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-02 00:40:53,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2019-10-02 00:40:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-02 00:40:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-10-02 00:40:53,187 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 32 [2019-10-02 00:40:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:40:53,187 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-10-02 00:40:53,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 00:40:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-10-02 00:40:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 00:40:53,188 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:40:53,189 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:40:53,189 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:40:53,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:40:53,189 INFO L82 PathProgramCache]: Analyzing trace with hash -42121234, now seen corresponding path program 3 times [2019-10-02 00:40:53,189 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:40:53,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:40:53,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:53,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:40:53,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:40:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:40:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 00:40:53,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:40:53,355 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:40:53,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:40:53,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 00:40:53,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:40:53,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 00:40:53,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:40:53,432 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 10 treesize of output 8 [2019-10-02 00:40:53,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:53,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:53,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:53,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-02 00:40:53,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:53,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:53,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:53,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2019-10-02 00:40:53,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:53,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:53,538 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-10-02 00:40:53,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:52 [2019-10-02 00:40:55,644 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_2 Int) (~SIZE~0 Int) (v_main_~acopy~0.base_BEFORE_CALL_2 Int)) (let ((.cse2 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_2)) (.cse0 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_2))) (and (let ((.cse1 (+ (* 4 ~SIZE~0) (- 8)))) (= (select .cse0 .cse1) (select .cse2 .cse1))) (= (mod ~SIZE~0 2) 0) (= (select .cse2 4) (select .cse0 4)) (not (= v_main_~a~0.base_BEFORE_CALL_2 v_main_~acopy~0.base_BEFORE_CALL_2))))) is different from true [2019-10-02 00:40:55,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:40:55,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2019-10-02 00:40:55,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:40:55,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:40:55,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:40:55,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2019-10-02 00:40:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2019-10-02 00:40:55,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:40:55,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-10-02 00:40:55,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 00:40:55,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 00:40:55,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=294, Unknown=1, NotChecked=34, Total=380 [2019-10-02 00:40:55,823 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 20 states. [2019-10-02 00:41:06,406 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-10-02 00:41:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:41:11,522 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2019-10-02 00:41:11,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 00:41:11,522 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-10-02 00:41:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:41:11,523 INFO L225 Difference]: With dead ends: 122 [2019-10-02 00:41:11,523 INFO L226 Difference]: Without dead ends: 99 [2019-10-02 00:41:11,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=365, Invalid=1702, Unknown=7, NotChecked=88, Total=2162 [2019-10-02 00:41:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-02 00:41:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 51. [2019-10-02 00:41:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-02 00:41:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2019-10-02 00:41:11,538 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 34 [2019-10-02 00:41:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:41:11,538 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2019-10-02 00:41:11,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 00:41:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2019-10-02 00:41:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 00:41:11,540 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:41:11,540 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:41:11,540 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:41:11,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:41:11,541 INFO L82 PathProgramCache]: Analyzing trace with hash -210369562, now seen corresponding path program 4 times [2019-10-02 00:41:11,541 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:41:11,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:41:11,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:11,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:41:11,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:41:11,611 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 00:41:11,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:41:11,611 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:41:11,637 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-10-02 00:41:11,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:41:11,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:41:11,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 00:41:11,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:41:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 00:41:11,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:41:11,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-10-02 00:41:11,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 00:41:11,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 00:41:11,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-10-02 00:41:11,713 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 13 states. [2019-10-02 00:41:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:41:11,915 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2019-10-02 00:41:11,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 00:41:11,915 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-10-02 00:41:11,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:41:11,916 INFO L225 Difference]: With dead ends: 89 [2019-10-02 00:41:11,916 INFO L226 Difference]: Without dead ends: 57 [2019-10-02 00:41:11,917 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-10-02 00:41:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-02 00:41:11,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2019-10-02 00:41:11,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-02 00:41:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-10-02 00:41:11,927 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 38 [2019-10-02 00:41:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:41:11,927 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-10-02 00:41:11,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 00:41:11,927 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-10-02 00:41:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 00:41:11,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:41:11,929 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:41:11,929 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:41:11,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:41:11,929 INFO L82 PathProgramCache]: Analyzing trace with hash -595219712, now seen corresponding path program 5 times [2019-10-02 00:41:11,930 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:41:11,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:41:11,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:11,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:41:11,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:41:12,721 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 39 [2019-10-02 00:41:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:41:13,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:41:13,273 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:41:13,294 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:41:13,356 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-02 00:41:13,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:41:13,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-02 00:41:13,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:41:13,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:13,684 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 00:41:13,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:13,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:13,686 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 00:41:13,706 INFO L341 Elim1Store]: treesize reduction 39, result has 36.1 percent of original size [2019-10-02 00:41:13,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 43 [2019-10-02 00:41:13,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:13,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:13,721 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-10-02 00:41:13,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:49 [2019-10-02 00:41:14,011 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 00:41:14,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:14,050 INFO L341 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2019-10-02 00:41:14,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 35 [2019-10-02 00:41:14,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:14,063 INFO L567 ElimStorePlain]: treesize reduction 8, result has 55.6 percent of original size [2019-10-02 00:41:14,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:14,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:3 [2019-10-02 00:41:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:41:14,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:41:14,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2019-10-02 00:41:14,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 00:41:14,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 00:41:14,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1088, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 00:41:14,151 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 35 states. [2019-10-02 00:41:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:41:16,276 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-10-02 00:41:16,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 00:41:16,276 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 44 [2019-10-02 00:41:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:41:16,278 INFO L225 Difference]: With dead ends: 112 [2019-10-02 00:41:16,278 INFO L226 Difference]: Without dead ends: 85 [2019-10-02 00:41:16,279 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=350, Invalid=2200, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 00:41:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-02 00:41:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-10-02 00:41:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-02 00:41:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-02 00:41:16,294 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 44 [2019-10-02 00:41:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:41:16,295 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-02 00:41:16,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 00:41:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-02 00:41:16,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 00:41:16,297 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:41:16,297 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:41:16,297 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:41:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:41:16,298 INFO L82 PathProgramCache]: Analyzing trace with hash -310382338, now seen corresponding path program 6 times [2019-10-02 00:41:16,298 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:41:16,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:41:16,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:16,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:41:16,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:41:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:41:16,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:41:16,702 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:41:16,735 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:41:16,773 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 00:41:16,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:41:16,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-02 00:41:16,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:41:16,785 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 10 treesize of output 8 [2019-10-02 00:41:16,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:16,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:16,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:16,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-10-02 00:41:16,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-02 00:41:16,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:16,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:16,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:16,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2019-10-02 00:41:16,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-02 00:41:16,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:16,920 INFO L567 ElimStorePlain]: treesize reduction 3, result has 89.3 percent of original size [2019-10-02 00:41:16,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:16,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:11 [2019-10-02 00:41:16,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-02 00:41:16,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:16,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:16,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:16,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-10-02 00:41:16,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:17,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:17,015 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:17,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 101 [2019-10-02 00:41:17,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:17,055 INFO L567 ElimStorePlain]: treesize reduction 56, result has 53.7 percent of original size [2019-10-02 00:41:17,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:17,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:93, output treesize:65 [2019-10-02 00:41:17,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:17,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:17,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:17,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:17,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:17,298 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-10-02 00:41:17,299 INFO L341 Elim1Store]: treesize reduction 90, result has 74.9 percent of original size [2019-10-02 00:41:17,300 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 6 case distinctions, treesize of input 93 treesize of output 337 [2019-10-02 00:41:17,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:17,396 INFO L567 ElimStorePlain]: treesize reduction 310, result has 27.2 percent of original size [2019-10-02 00:41:17,397 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-10-02 00:41:17,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:144, output treesize:116 [2019-10-02 00:41:17,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:17,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:41:19,648 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.offset_BEFORE_CALL_5 Int) (v_main_~acopy~0.base_BEFORE_CALL_5 Int) (v_main_~a~0.base_BEFORE_CALL_5 Int) (v_main_~i~0_42 Int) (v_main_~i~0_41 Int) (~SIZE~0 Int)) (let ((.cse2 (* 4 ~SIZE~0)) (.cse3 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_5)) (.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_5))) (and (let ((.cse1 (* (- 4) v_main_~i~0_41))) (= (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_5 .cse1 .cse2 (- 4))) (select .cse3 (+ .cse1 .cse2 (- 4))))) (<= v_main_~i~0_42 (+ v_main_~i~0_41 1)) (<= (div ~SIZE~0 2) (+ v_main_~i~0_42 1)) (let ((.cse4 (* 4 v_main_~i~0_42))) (= (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_5 .cse4)) (select .cse3 .cse4))) (not (= v_main_~a~0.base_BEFORE_CALL_5 v_main_~acopy~0.base_BEFORE_CALL_5)) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_41 0) (<= 4 ~SIZE~0) (let ((.cse5 (* (- 4) v_main_~i~0_42))) (= (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_5 .cse5 .cse2 (- 4))) (select .cse3 (+ .cse5 .cse2 (- 4))))) (let ((.cse6 (* 4 v_main_~i~0_41))) (= (select .cse3 .cse6) (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_5 .cse6))))))) is different from true [2019-10-02 00:41:21,816 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.offset_BEFORE_CALL_6 Int) (v_main_~acopy~0.base_BEFORE_CALL_6 Int) (v_main_~i~0_42 Int) (v_main_~i~0_41 Int) (~SIZE~0 Int) (v_main_~a~0.base_BEFORE_CALL_6 Int)) (let ((.cse0 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_6)) (.cse2 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_6)) (.cse5 (* 4 ~SIZE~0))) (and (let ((.cse1 (* 4 v_main_~i~0_41))) (= (select .cse0 .cse1) (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_6 .cse1)))) (<= v_main_~i~0_42 (+ v_main_~i~0_41 1)) (let ((.cse3 (* 4 v_main_~i~0_42))) (= (select .cse0 .cse3) (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_6 .cse3)))) (<= (div ~SIZE~0 2) (+ v_main_~i~0_42 1)) (let ((.cse4 (* (- 4) v_main_~i~0_41))) (= (select .cse0 (+ .cse4 .cse5 (- 4))) (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_6 .cse4 .cse5 (- 4))))) (= (mod ~SIZE~0 2) 0) (not (= v_main_~a~0.base_BEFORE_CALL_6 v_main_~acopy~0.base_BEFORE_CALL_6)) (<= v_main_~i~0_41 0) (<= 4 ~SIZE~0) (let ((.cse6 (* (- 4) v_main_~i~0_42))) (= (select .cse0 (+ .cse6 .cse5 (- 4))) (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_6 .cse6 .cse5 (- 4)))))))) is different from true [2019-10-02 00:41:22,008 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 00:41:22,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:22,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:22,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:22,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:22,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:22,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:22,078 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:22,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 7 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 203 [2019-10-02 00:41:22,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:41:22,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:22,206 INFO L567 ElimStorePlain]: treesize reduction 1172, result has 2.6 percent of original size [2019-10-02 00:41:22,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:22,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:3 [2019-10-02 00:41:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2019-10-02 00:41:22,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:41:22,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21] total 30 [2019-10-02 00:41:22,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 00:41:22,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 00:41:22,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=666, Unknown=2, NotChecked=106, Total=870 [2019-10-02 00:41:22,298 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 30 states. [2019-10-02 00:41:29,735 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 53 [2019-10-02 00:41:31,814 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 55 [2019-10-02 00:41:39,549 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-02 00:41:39,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:41:39,695 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2019-10-02 00:41:39,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 00:41:39,695 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2019-10-02 00:41:39,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:41:39,696 INFO L225 Difference]: With dead ends: 136 [2019-10-02 00:41:39,697 INFO L226 Difference]: Without dead ends: 111 [2019-10-02 00:41:39,698 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=403, Invalid=2905, Unknown=6, NotChecked=226, Total=3540 [2019-10-02 00:41:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-02 00:41:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 66. [2019-10-02 00:41:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-02 00:41:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-10-02 00:41:39,712 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 46 [2019-10-02 00:41:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:41:39,713 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-10-02 00:41:39,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 00:41:39,713 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-10-02 00:41:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 00:41:39,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:41:39,714 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:41:39,714 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:41:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:41:39,715 INFO L82 PathProgramCache]: Analyzing trace with hash -50327652, now seen corresponding path program 7 times [2019-10-02 00:41:39,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:41:39,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:41:39,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:39,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:41:39,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:41:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:41:39,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:41:39,947 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:41:39,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:41:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:41:40,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 00:41:40,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:41:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 00:41:40,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:41:40,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 17 [2019-10-02 00:41:40,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 00:41:40,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 00:41:40,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 00:41:40,112 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 17 states. [2019-10-02 00:41:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:41:40,485 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2019-10-02 00:41:40,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 00:41:40,486 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2019-10-02 00:41:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:41:40,487 INFO L225 Difference]: With dead ends: 133 [2019-10-02 00:41:40,488 INFO L226 Difference]: Without dead ends: 100 [2019-10-02 00:41:40,488 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2019-10-02 00:41:40,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-02 00:41:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 68. [2019-10-02 00:41:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-02 00:41:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-10-02 00:41:40,525 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 48 [2019-10-02 00:41:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:41:40,526 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-10-02 00:41:40,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 00:41:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-10-02 00:41:40,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 00:41:40,531 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:41:40,531 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:41:40,531 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:41:40,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:41:40,532 INFO L82 PathProgramCache]: Analyzing trace with hash -615831910, now seen corresponding path program 8 times [2019-10-02 00:41:40,532 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:41:40,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:41:40,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:40,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:41:40,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:41:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 44 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 00:41:40,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:41:40,878 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:41:40,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:41:40,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:41:40,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:41:40,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-02 00:41:40,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:41:40,968 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 10 treesize of output 8 [2019-10-02 00:41:40,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:40,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:40,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:40,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-02 00:41:41,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:41,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:41,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:41,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2019-10-02 00:41:41,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:41,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:41,116 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-10-02 00:41:41,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:52 [2019-10-02 00:41:43,210 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_7 Int) (v_main_~a~0.base_BEFORE_CALL_7 Int) (~SIZE~0 Int)) (let ((.cse2 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_7)) (.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_7))) (and (= (mod ~SIZE~0 2) 0) (not (= v_main_~a~0.base_BEFORE_CALL_7 v_main_~acopy~0.base_BEFORE_CALL_7)) (let ((.cse1 (+ (* 4 ~SIZE~0) (- 12)))) (= (select .cse0 .cse1) (select .cse2 .cse1))) (= (select .cse2 8) (select .cse0 8))))) is different from true [2019-10-02 00:41:45,335 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_8 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int) (~SIZE~0 Int)) (let ((.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_8)) (.cse1 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_8))) (and (not (= v_main_~a~0.base_BEFORE_CALL_8 v_main_~acopy~0.base_BEFORE_CALL_8)) (= (mod ~SIZE~0 2) 0) (= (select .cse0 8) (select .cse1 8)) (let ((.cse2 (+ (* 4 ~SIZE~0) (- 12)))) (= (select .cse0 .cse2) (select .cse1 .cse2)))))) is different from true [2019-10-02 00:41:45,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:41:45,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2019-10-02 00:41:45,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:41:45,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:41:45,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:41:45,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2019-10-02 00:41:45,509 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 8 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:41:45,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:41:45,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2019-10-02 00:41:45,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 00:41:45,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 00:41:45,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=433, Unknown=2, NotChecked=86, Total=600 [2019-10-02 00:41:45,516 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 25 states. [2019-10-02 00:41:52,290 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-10-02 00:41:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:41:58,643 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2019-10-02 00:41:58,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 00:41:58,646 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-10-02 00:41:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:41:58,647 INFO L225 Difference]: With dead ends: 101 [2019-10-02 00:41:58,647 INFO L226 Difference]: Without dead ends: 99 [2019-10-02 00:41:58,649 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=129, Invalid=744, Unknown=5, NotChecked=114, Total=992 [2019-10-02 00:41:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-02 00:41:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 67. [2019-10-02 00:41:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-02 00:41:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-10-02 00:41:58,668 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 50 [2019-10-02 00:41:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:41:58,668 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-10-02 00:41:58,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 00:41:58,669 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-10-02 00:41:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 00:41:58,673 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:41:58,674 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:41:58,674 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:41:58,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:41:58,674 INFO L82 PathProgramCache]: Analyzing trace with hash 958082708, now seen corresponding path program 9 times [2019-10-02 00:41:58,674 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:41:58,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:41:58,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:58,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:41:58,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:41:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:41:59,374 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2019-10-02 00:41:59,510 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 28 [2019-10-02 00:41:59,798 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 40 [2019-10-02 00:41:59,966 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2019-10-02 00:42:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:42:00,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:42:00,321 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:42:00,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:42:00,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 00:42:00,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:42:00,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-02 00:42:00,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:42:00,402 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 10 treesize of output 8 [2019-10-02 00:42:00,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:42:00,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:42:00,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:42:00,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-10-02 00:42:00,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-02 00:42:00,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:42:00,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:42:00,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:42:00,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-10-02 00:42:00,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,621 INFO L341 Elim1Store]: treesize reduction 36, result has 57.1 percent of original size [2019-10-02 00:42:00,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 85 [2019-10-02 00:42:00,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:42:00,651 INFO L567 ElimStorePlain]: treesize reduction 40, result has 60.8 percent of original size [2019-10-02 00:42:00,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:42:00,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:90, output treesize:62 [2019-10-02 00:42:00,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 121 [2019-10-02 00:42:00,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:42:00,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:00,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 117 [2019-10-02 00:42:00,900 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:42:00,963 INFO L567 ElimStorePlain]: treesize reduction 107, result has 47.3 percent of original size [2019-10-02 00:42:00,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:42:00,963 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:259, output treesize:96 [2019-10-02 00:42:01,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:01,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:42:01,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:42:05,697 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 43 [2019-10-02 00:42:10,893 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2019-10-02 00:42:10,894 INFO L341 Elim1Store]: treesize reduction 56, result has 80.6 percent of original size [2019-10-02 00:42:10,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 91 treesize of output 251 [2019-10-02 00:42:10,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:10,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:11,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 00:42:12,076 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 518 DAG size of output: 19 [2019-10-02 00:42:12,077 INFO L567 ElimStorePlain]: treesize reduction 12149, result has 0.2 percent of original size [2019-10-02 00:42:12,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:42:12,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:116, output treesize:3 [2019-10-02 00:42:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 00:42:12,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:42:12,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2019-10-02 00:42:12,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 00:42:12,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 00:42:12,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1139, Unknown=1, NotChecked=0, Total=1260 [2019-10-02 00:42:12,186 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 36 states. [2019-10-02 00:42:13,096 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-10-02 00:42:20,539 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 44 [2019-10-02 00:42:20,756 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 47 [2019-10-02 00:42:22,923 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 45 [2019-10-02 00:42:25,234 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 47 [2019-10-02 00:42:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:26,309 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2019-10-02 00:42:26,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 00:42:26,309 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 52 [2019-10-02 00:42:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:26,310 INFO L225 Difference]: With dead ends: 106 [2019-10-02 00:42:26,311 INFO L226 Difference]: Without dead ends: 64 [2019-10-02 00:42:26,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=476, Invalid=2945, Unknown=1, NotChecked=0, Total=3422 [2019-10-02 00:42:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-02 00:42:26,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-10-02 00:42:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-02 00:42:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-10-02 00:42:26,323 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 52 [2019-10-02 00:42:26,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:26,323 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-10-02 00:42:26,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 00:42:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-10-02 00:42:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 00:42:26,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:26,324 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:42:26,324 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:26,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:26,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1251971026, now seen corresponding path program 10 times [2019-10-02 00:42:26,325 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:26,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:26,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:26,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:42:26,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:42:27,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:42:27,564 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:42:27,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:42:27,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:42:27,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:42:27,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-02 00:42:27,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:42:27,639 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 10 treesize of output 8 [2019-10-02 00:42:27,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:42:27,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:42:27,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:42:27,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-02 00:42:28,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:28,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:28,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:28,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:28,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:28,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 67 [2019-10-02 00:42:28,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:42:28,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:28,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:28,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:42:28,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 63 [2019-10-02 00:42:28,084 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 00:42:28,126 INFO L567 ElimStorePlain]: treesize reduction 70, result has 41.2 percent of original size [2019-10-02 00:42:28,127 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-10-02 00:42:28,127 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:49 [2019-10-02 00:42:30,290 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_12 Int) (v_main_~acopy~0.offset_BEFORE_CALL_12 Int) (v_main_~a~0.base_BEFORE_CALL_12 Int) (v_main_~a~0.offset_BEFORE_CALL_12 Int) (~SIZE~0 Int)) (let ((.cse2 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_12)) (.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_12))) (and (let ((.cse1 (* 4 ~SIZE~0))) (= (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_12 .cse1 (- 12))) (select .cse2 (+ v_main_~a~0.offset_BEFORE_CALL_12 .cse1 (- 12))))) (< 2 (div ~SIZE~0 2)) (not (= v_main_~acopy~0.base_BEFORE_CALL_12 v_main_~a~0.base_BEFORE_CALL_12)) (<= ~SIZE~0 6) (= (select .cse2 (+ v_main_~a~0.offset_BEFORE_CALL_12 8)) (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_12 8)))))) is different from true [2019-10-02 00:42:34,150 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_13 Int) (v_main_~a~0.offset_BEFORE_CALL_13 Int) (v_main_~a~0.base_BEFORE_CALL_13 Int) (v_main_~acopy~0.offset_BEFORE_CALL_13 Int) (~SIZE~0 Int)) (let ((.cse2 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_13)) (.cse0 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_13))) (and (< 2 (div ~SIZE~0 2)) (let ((.cse1 (* 4 ~SIZE~0))) (= (select .cse0 (+ v_main_~a~0.offset_BEFORE_CALL_13 .cse1 (- 12))) (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_13 .cse1 (- 12))))) (not (= v_main_~acopy~0.base_BEFORE_CALL_13 v_main_~a~0.base_BEFORE_CALL_13)) (<= ~SIZE~0 6) (= (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_13 8)) (select .cse0 (+ v_main_~a~0.offset_BEFORE_CALL_13 8)))))) is different from true [2019-10-02 00:42:36,313 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_14 Int) (v_main_~a~0.offset_BEFORE_CALL_14 Int) (v_main_~a~0.base_BEFORE_CALL_14 Int) (v_main_~acopy~0.offset_BEFORE_CALL_14 Int) (~SIZE~0 Int)) (let ((.cse1 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_14)) (.cse0 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_14))) (and (< 2 (div ~SIZE~0 2)) (<= ~SIZE~0 6) (= (select .cse0 (+ v_main_~a~0.offset_BEFORE_CALL_14 8)) (select .cse1 (+ v_main_~acopy~0.offset_BEFORE_CALL_14 8))) (not (= v_main_~acopy~0.base_BEFORE_CALL_14 v_main_~a~0.base_BEFORE_CALL_14)) (let ((.cse2 (* 4 ~SIZE~0))) (= (select .cse1 (+ v_main_~acopy~0.offset_BEFORE_CALL_14 .cse2 (- 12))) (select .cse0 (+ v_main_~a~0.offset_BEFORE_CALL_14 .cse2 (- 12)))))))) is different from true [2019-10-02 00:42:36,648 INFO L341 Elim1Store]: treesize reduction 24, result has 71.8 percent of original size [2019-10-02 00:42:36,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 73 [2019-10-02 00:42:36,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:36,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:36,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:36,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:42:36,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-10-02 00:42:36,675 INFO L567 ElimStorePlain]: treesize reduction 61, result has 20.8 percent of original size [2019-10-02 00:42:36,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:42:36,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:3 [2019-10-02 00:42:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2019-10-02 00:42:36,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:42:36,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2019-10-02 00:42:36,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-02 00:42:36,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-02 00:42:36,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1553, Unknown=3, NotChecked=246, Total=1980 [2019-10-02 00:42:36,768 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 45 states. [2019-10-02 00:42:44,995 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 36 [2019-10-02 00:42:49,267 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2019-10-02 00:42:51,351 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 37 [2019-10-02 00:42:58,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:58,595 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2019-10-02 00:42:58,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 00:42:58,595 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 58 [2019-10-02 00:42:58,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:58,598 INFO L225 Difference]: With dead ends: 156 [2019-10-02 00:42:58,598 INFO L226 Difference]: Without dead ends: 121 [2019-10-02 00:42:58,600 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=770, Invalid=4783, Unknown=9, NotChecked=444, Total=6006 [2019-10-02 00:42:58,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-02 00:42:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 80. [2019-10-02 00:42:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-02 00:42:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-10-02 00:42:58,615 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 58 [2019-10-02 00:42:58,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:58,615 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-10-02 00:42:58,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-02 00:42:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-10-02 00:42:58,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 00:42:58,616 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:58,616 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:42:58,616 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:58,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:58,616 INFO L82 PathProgramCache]: Analyzing trace with hash -734961236, now seen corresponding path program 11 times [2019-10-02 00:42:58,616 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:58,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:58,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:58,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:42:58,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 31 proven. 33 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 00:42:59,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:42:59,145 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:42:59,180 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:42:59,440 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-10-02 00:42:59,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:42:59,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 00:42:59,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:42:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 00:42:59,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:42:59,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-10-02 00:42:59,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 00:42:59,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 00:42:59,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2019-10-02 00:42:59,739 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 26 states. [2019-10-02 00:43:00,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:43:00,802 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2019-10-02 00:43:00,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 00:43:00,803 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 60 [2019-10-02 00:43:00,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:43:00,805 INFO L225 Difference]: With dead ends: 175 [2019-10-02 00:43:00,805 INFO L226 Difference]: Without dead ends: 142 [2019-10-02 00:43:00,806 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=296, Invalid=1110, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 00:43:00,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-02 00:43:00,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 82. [2019-10-02 00:43:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-02 00:43:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2019-10-02 00:43:00,824 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 60 [2019-10-02 00:43:00,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:43:00,825 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2019-10-02 00:43:00,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 00:43:00,825 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2019-10-02 00:43:00,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 00:43:00,825 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:43:00,825 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:43:00,826 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:43:00,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:43:00,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2090228790, now seen corresponding path program 12 times [2019-10-02 00:43:00,826 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:43:00,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:43:00,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:00,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:43:00,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 17 proven. 54 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 00:43:01,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:43:01,132 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:43:01,170 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:43:01,274 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-10-02 00:43:01,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:43:01,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 00:43:01,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:43:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 16 proven. 49 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 00:43:01,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:43:01,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 21 [2019-10-02 00:43:01,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 00:43:01,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 00:43:01,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-10-02 00:43:01,384 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 21 states. [2019-10-02 00:43:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:43:01,976 INFO L93 Difference]: Finished difference Result 171 states and 178 transitions. [2019-10-02 00:43:01,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 00:43:01,976 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2019-10-02 00:43:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:43:01,977 INFO L225 Difference]: With dead ends: 171 [2019-10-02 00:43:01,977 INFO L226 Difference]: Without dead ends: 128 [2019-10-02 00:43:01,978 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2019-10-02 00:43:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-02 00:43:01,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 84. [2019-10-02 00:43:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-02 00:43:01,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2019-10-02 00:43:01,994 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 62 [2019-10-02 00:43:01,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:43:01,994 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2019-10-02 00:43:01,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 00:43:01,995 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2019-10-02 00:43:01,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 00:43:01,995 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:43:01,996 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:43:01,996 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:43:01,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:43:01,996 INFO L82 PathProgramCache]: Analyzing trace with hash 88712776, now seen corresponding path program 13 times [2019-10-02 00:43:01,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:43:01,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:43:01,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:01,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:43:01,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:43:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 82 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 00:43:02,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:43:02,364 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:43:02,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:43:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:43:02,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-02 00:43:02,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:43:02,888 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-10-02 00:43:02,888 INFO L341 Elim1Store]: treesize reduction 357, result has 32.6 percent of original size [2019-10-02 00:43:02,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 107 treesize of output 229 [2019-10-02 00:43:02,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:02,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:02,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:02,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:43:02,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:02,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:43:03,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:43:03,128 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:465) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-02 00:43:03,133 INFO L168 Benchmark]: Toolchain (without parser) took 150216.00 ms. Allocated memory was 137.9 MB in the beginning and 357.6 MB in the end (delta: 219.7 MB). Free memory was 85.1 MB in the beginning and 320.3 MB in the end (delta: -235.2 MB). Peak memory consumption was 254.0 MB. Max. memory is 7.1 GB. [2019-10-02 00:43:03,133 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 103.8 MB in the beginning and 103.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 00:43:03,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.07 ms. Allocated memory was 137.9 MB in the beginning and 198.7 MB in the end (delta: 60.8 MB). Free memory was 84.9 MB in the beginning and 177.1 MB in the end (delta: -92.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-10-02 00:43:03,134 INFO L168 Benchmark]: Boogie Preprocessor took 41.52 ms. Allocated memory is still 198.7 MB. Free memory was 177.1 MB in the beginning and 174.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-02 00:43:03,135 INFO L168 Benchmark]: RCFGBuilder took 381.65 ms. Allocated memory is still 198.7 MB. Free memory was 174.7 MB in the beginning and 158.1 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2019-10-02 00:43:03,135 INFO L168 Benchmark]: TraceAbstraction took 149362.13 ms. Allocated memory was 198.7 MB in the beginning and 357.6 MB in the end (delta: 158.9 MB). Free memory was 157.5 MB in the beginning and 320.3 MB in the end (delta: -162.8 MB). Peak memory consumption was 265.5 MB. Max. memory is 7.1 GB. [2019-10-02 00:43:03,138 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 103.8 MB in the beginning and 103.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 422.07 ms. Allocated memory was 137.9 MB in the beginning and 198.7 MB in the end (delta: 60.8 MB). Free memory was 84.9 MB in the beginning and 177.1 MB in the end (delta: -92.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.52 ms. Allocated memory is still 198.7 MB. Free memory was 177.1 MB in the beginning and 174.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 381.65 ms. Allocated memory is still 198.7 MB. Free memory was 174.7 MB in the beginning and 158.1 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 149362.13 ms. Allocated memory was 198.7 MB in the beginning and 357.6 MB in the end (delta: 158.9 MB). Free memory was 157.5 MB in the beginning and 320.3 MB in the end (delta: -162.8 MB). Peak memory consumption was 265.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...