./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27142e71f3089c5c3b5bf4f358882e993f701ffc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:02:32,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:02:32,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:02:32,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:02:32,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:02:32,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:02:32,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:02:32,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:02:32,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:02:32,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:02:32,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:02:32,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:02:32,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:02:32,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:02:32,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:02:32,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:02:32,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:02:32,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:02:32,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:02:32,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:02:32,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:02:32,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:02:32,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:02:32,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:02:32,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:02:32,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:02:32,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:02:32,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:02:32,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:02:32,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:02:32,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:02:32,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:02:32,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:02:32,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:02:32,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:02:32,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:02:32,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:02:32,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:02:32,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:02:32,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:02:32,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:02:32,784 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:02:32,799 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:02:32,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:02:32,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:02:32,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:02:32,802 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:02:32,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:02:32,803 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:02:32,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:02:32,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:02:32,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:02:32,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:02:32,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:02:32,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:02:32,804 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:02:32,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:02:32,805 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:02:32,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:02:32,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:02:32,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:02:32,806 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:02:32,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:02:32,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:02:32,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:02:32,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:02:32,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:02:32,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:02:32,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:02:32,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:02:32,809 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:02:32,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 27142e71f3089c5c3b5bf4f358882e993f701ffc [2019-11-28 17:02:33,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:02:33,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:02:33,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:02:33,152 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:02:33,153 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:02:33,154 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2019-11-28 17:02:33,230 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f4c9f942/b59fa42eb98d48a1a4589c694f1e7ff4/FLAG1bb027c9f [2019-11-28 17:02:33,806 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:02:33,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2019-11-28 17:02:33,830 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f4c9f942/b59fa42eb98d48a1a4589c694f1e7ff4/FLAG1bb027c9f [2019-11-28 17:02:34,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f4c9f942/b59fa42eb98d48a1a4589c694f1e7ff4 [2019-11-28 17:02:34,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:02:34,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:02:34,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:02:34,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:02:34,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:02:34,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:02:34" (1/1) ... [2019-11-28 17:02:34,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b51af9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:34, skipping insertion in model container [2019-11-28 17:02:34,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:02:34" (1/1) ... [2019-11-28 17:02:34,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:02:34,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:02:34,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:02:34,551 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:02:34,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:02:34,663 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:02:34,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:34 WrapperNode [2019-11-28 17:02:34,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:02:34,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:02:34,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:02:34,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:02:34,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:34" (1/1) ... [2019-11-28 17:02:34,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:34" (1/1) ... [2019-11-28 17:02:34,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:02:34,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:02:34,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:02:34,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:02:34,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:34" (1/1) ... [2019-11-28 17:02:34,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:34" (1/1) ... [2019-11-28 17:02:34,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:34" (1/1) ... [2019-11-28 17:02:34,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:34" (1/1) ... [2019-11-28 17:02:34,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:34" (1/1) ... [2019-11-28 17:02:34,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:34" (1/1) ... [2019-11-28 17:02:34,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:34" (1/1) ... [2019-11-28 17:02:34,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:02:34,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:02:34,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:02:34,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:02:34,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:34" (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-11-28 17:02:34,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 17:02:34,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:02:34,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 17:02:34,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 17:02:34,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 17:02:34,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 17:02:34,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:02:34,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:02:35,350 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:02:35,351 INFO L287 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-28 17:02:35,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:02:35 BoogieIcfgContainer [2019-11-28 17:02:35,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:02:35,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:02:35,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:02:35,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:02:35,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:02:34" (1/3) ... [2019-11-28 17:02:35,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e95a061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:02:35, skipping insertion in model container [2019-11-28 17:02:35,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:34" (2/3) ... [2019-11-28 17:02:35,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e95a061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:02:35, skipping insertion in model container [2019-11-28 17:02:35,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:02:35" (3/3) ... [2019-11-28 17:02:35,360 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-1.i [2019-11-28 17:02:35,370 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:02:35,378 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:02:35,387 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:02:35,407 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:02:35,407 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:02:35,407 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:02:35,408 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:02:35,408 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:02:35,408 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:02:35,408 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:02:35,408 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:02:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-28 17:02:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 17:02:35,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:35,428 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:35,428 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:35,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1240059524, now seen corresponding path program 1 times [2019-11-28 17:02:35,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:35,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957316193] [2019-11-28 17:02:35,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:35,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957316193] [2019-11-28 17:02:35,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:02:35,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:02:35,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008915630] [2019-11-28 17:02:35,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:02:35,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:35,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:02:35,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:02:35,591 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-28 17:02:35,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:35,615 INFO L93 Difference]: Finished difference Result 89 states and 132 transitions. [2019-11-28 17:02:35,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:02:35,616 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-28 17:02:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:35,626 INFO L225 Difference]: With dead ends: 89 [2019-11-28 17:02:35,627 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 17:02:35,630 INFO L630 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-11-28 17:02:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 17:02:35,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-28 17:02:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 17:02:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-11-28 17:02:35,672 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 18 [2019-11-28 17:02:35,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:35,673 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-11-28 17:02:35,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:02:35,673 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2019-11-28 17:02:35,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:02:35,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:35,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:35,675 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:35,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1466688541, now seen corresponding path program 1 times [2019-11-28 17:02:35,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:35,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183685075] [2019-11-28 17:02:35,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:35,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183685075] [2019-11-28 17:02:35,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:02:35,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:02:35,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809189909] [2019-11-28 17:02:35,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:02:35,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:35,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:02:35,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:02:35,847 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 6 states. [2019-11-28 17:02:35,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:35,981 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2019-11-28 17:02:35,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:02:35,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 17:02:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:35,985 INFO L225 Difference]: With dead ends: 82 [2019-11-28 17:02:35,986 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 17:02:35,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:02:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 17:02:36,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-11-28 17:02:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 17:02:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-11-28 17:02:36,006 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 25 [2019-11-28 17:02:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:36,006 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-11-28 17:02:36,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:02:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-11-28 17:02:36,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 17:02:36,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:36,009 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:36,010 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:36,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:36,011 INFO L82 PathProgramCache]: Analyzing trace with hash -395195180, now seen corresponding path program 1 times [2019-11-28 17:02:36,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:36,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288354081] [2019-11-28 17:02:36,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:36,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288354081] [2019-11-28 17:02:36,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82459393] [2019-11-28 17:02:36,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:36,263 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:02:36,273 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:36,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 17:02:36,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2019-11-28 17:02:36,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511707173] [2019-11-28 17:02:36,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:02:36,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:36,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:02:36,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:02:36,327 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 7 states. [2019-11-28 17:02:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:36,487 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2019-11-28 17:02:36,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:02:36,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-11-28 17:02:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:36,489 INFO L225 Difference]: With dead ends: 84 [2019-11-28 17:02:36,489 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 17:02:36,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:02:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 17:02:36,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-11-28 17:02:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 17:02:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-11-28 17:02:36,498 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 28 [2019-11-28 17:02:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:36,498 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-11-28 17:02:36,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:02:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-11-28 17:02:36,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 17:02:36,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:36,500 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:36,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:36,703 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:36,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:36,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1510946244, now seen corresponding path program 1 times [2019-11-28 17:02:36,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:36,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859938266] [2019-11-28 17:02:36,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:36,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859938266] [2019-11-28 17:02:36,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:02:36,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 17:02:36,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763406618] [2019-11-28 17:02:36,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:02:36,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:36,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:02:36,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:02:36,871 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 8 states. [2019-11-28 17:02:37,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:37,051 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2019-11-28 17:02:37,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:02:37,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-28 17:02:37,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:37,054 INFO L225 Difference]: With dead ends: 70 [2019-11-28 17:02:37,054 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 17:02:37,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:02:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 17:02:37,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2019-11-28 17:02:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 17:02:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-11-28 17:02:37,064 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 29 [2019-11-28 17:02:37,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:37,065 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-11-28 17:02:37,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:02:37,065 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-11-28 17:02:37,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:02:37,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:37,067 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:37,067 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:37,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:37,068 INFO L82 PathProgramCache]: Analyzing trace with hash -353652332, now seen corresponding path program 1 times [2019-11-28 17:02:37,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:37,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846864283] [2019-11-28 17:02:37,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:02:37,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846864283] [2019-11-28 17:02:37,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852408341] [2019-11-28 17:02:37,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:37,286 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 17:02:37,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:02:37,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:02:37,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-28 17:02:37,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855550942] [2019-11-28 17:02:37,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:02:37,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:37,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:02:37,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:02:37,329 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 8 states. [2019-11-28 17:02:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:37,548 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2019-11-28 17:02:37,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 17:02:37,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-28 17:02:37,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:37,550 INFO L225 Difference]: With dead ends: 102 [2019-11-28 17:02:37,550 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 17:02:37,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-11-28 17:02:37,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 17:02:37,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2019-11-28 17:02:37,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 17:02:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-11-28 17:02:37,564 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 30 [2019-11-28 17:02:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:37,565 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-11-28 17:02:37,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:02:37,565 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-11-28 17:02:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 17:02:37,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:37,570 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:37,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:37,775 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:37,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:37,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1806454861, now seen corresponding path program 2 times [2019-11-28 17:02:37,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:37,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114545898] [2019-11-28 17:02:37,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:37,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114545898] [2019-11-28 17:02:37,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997268381] [2019-11-28 17:02:37,941 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:38,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:02:38,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:02:38,019 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 17:02:38,022 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:38,061 INFO L377 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 11 treesize of output 7 [2019-11-28 17:02:38,062 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:38,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:38,068 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:38,068 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-28 17:02:38,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 16 [2019-11-28 17:02:38,087 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:38,094 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:38,095 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:38,096 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2019-11-28 17:02:38,166 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:38,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2019-11-28 17:02:38,167 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:38,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:38,170 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:38,170 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:4 [2019-11-28 17:02:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:38,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:02:38,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-28 17:02:38,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356933458] [2019-11-28 17:02:38,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 17:02:38,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:38,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 17:02:38,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:02:38,185 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 11 states. [2019-11-28 17:02:38,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:38,563 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-11-28 17:02:38,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:02:38,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-11-28 17:02:38,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:38,565 INFO L225 Difference]: With dead ends: 75 [2019-11-28 17:02:38,565 INFO L226 Difference]: Without dead ends: 70 [2019-11-28 17:02:38,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-11-28 17:02:38,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-28 17:02:38,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-28 17:02:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 17:02:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-11-28 17:02:38,596 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 34 [2019-11-28 17:02:38,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:38,597 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-11-28 17:02:38,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 17:02:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-11-28 17:02:38,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 17:02:38,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:38,599 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:38,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:38,803 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:38,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:38,804 INFO L82 PathProgramCache]: Analyzing trace with hash 217180203, now seen corresponding path program 3 times [2019-11-28 17:02:38,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:38,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021295533] [2019-11-28 17:02:38,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 17:02:39,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021295533] [2019-11-28 17:02:39,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683121208] [2019-11-28 17:02:39,119 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:39,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 17:02:39,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:02:39,197 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-28 17:02:39,200 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 17:02:39,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:02:39,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2019-11-28 17:02:39,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642138895] [2019-11-28 17:02:39,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 17:02:39,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:39,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 17:02:39,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-11-28 17:02:39,325 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 17 states. [2019-11-28 17:02:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:39,848 INFO L93 Difference]: Finished difference Result 213 states and 262 transitions. [2019-11-28 17:02:39,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 17:02:39,848 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-11-28 17:02:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:39,850 INFO L225 Difference]: With dead ends: 213 [2019-11-28 17:02:39,850 INFO L226 Difference]: Without dead ends: 205 [2019-11-28 17:02:39,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-11-28 17:02:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-28 17:02:39,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 97. [2019-11-28 17:02:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 17:02:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2019-11-28 17:02:39,881 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 35 [2019-11-28 17:02:39,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:39,882 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2019-11-28 17:02:39,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 17:02:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2019-11-28 17:02:39,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 17:02:39,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:39,883 INFO L410 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, 1, 1, 1, 1] [2019-11-28 17:02:40,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:40,091 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:40,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:40,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1805693939, now seen corresponding path program 4 times [2019-11-28 17:02:40,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:40,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175771570] [2019-11-28 17:02:40,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:40,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175771570] [2019-11-28 17:02:40,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865020867] [2019-11-28 17:02:40,369 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:40,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:02:40,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:02:40,436 INFO L264 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-28 17:02:40,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:40,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 17:02:40,448 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:40,469 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,469 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-28 17:02:40,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 17:02:40,501 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,508 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:40,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 17:02:40,513 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,522 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:40,522 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,523 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-11-28 17:02:40,570 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:40,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 17:02:40,571 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,582 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:40,582 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,582 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-11-28 17:02:40,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-28 17:02:40,622 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,635 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:40,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-28 17:02:40,644 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:40,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,662 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2019-11-28 17:02:41,063 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-28 17:02:41,065 INFO L343 Elim1Store]: treesize reduction 8, result has 92.9 percent of original size [2019-11-28 17:02:41,066 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 163 [2019-11-28 17:02:41,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,747 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:41,813 INFO L614 ElimStorePlain]: treesize reduction 92, result has 45.6 percent of original size [2019-11-28 17:02:41,855 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:41,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 104 [2019-11-28 17:02:41,857 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:41,897 INFO L614 ElimStorePlain]: treesize reduction 12, result has 72.7 percent of original size [2019-11-28 17:02:41,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:41,901 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:41,901 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:7 [2019-11-28 17:02:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:41,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:02:41,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-11-28 17:02:41,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369768042] [2019-11-28 17:02:41,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 17:02:41,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:41,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 17:02:41,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-11-28 17:02:41,912 INFO L87 Difference]: Start difference. First operand 97 states and 125 transitions. Second operand 20 states. [2019-11-28 17:02:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:42,574 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2019-11-28 17:02:42,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 17:02:42,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-28 17:02:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:42,576 INFO L225 Difference]: With dead ends: 168 [2019-11-28 17:02:42,576 INFO L226 Difference]: Without dead ends: 158 [2019-11-28 17:02:42,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2019-11-28 17:02:42,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-28 17:02:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 129. [2019-11-28 17:02:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-28 17:02:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 166 transitions. [2019-11-28 17:02:42,594 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 166 transitions. Word has length 36 [2019-11-28 17:02:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:42,594 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 166 transitions. [2019-11-28 17:02:42,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 17:02:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 166 transitions. [2019-11-28 17:02:42,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 17:02:42,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:42,596 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:42,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:42,806 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:42,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:42,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1169066102, now seen corresponding path program 1 times [2019-11-28 17:02:42,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:42,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349569522] [2019-11-28 17:02:42,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 17:02:42,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349569522] [2019-11-28 17:02:42,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370856426] [2019-11-28 17:02:42,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:42,966 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 17:02:42,968 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:43,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 17:02:43,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:02:43,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-28 17:02:43,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54948480] [2019-11-28 17:02:43,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 17:02:43,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:43,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 17:02:43,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:02:43,034 INFO L87 Difference]: Start difference. First operand 129 states and 166 transitions. Second operand 11 states. [2019-11-28 17:02:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:43,419 INFO L93 Difference]: Finished difference Result 375 states and 494 transitions. [2019-11-28 17:02:43,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 17:02:43,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-11-28 17:02:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:43,423 INFO L225 Difference]: With dead ends: 375 [2019-11-28 17:02:43,423 INFO L226 Difference]: Without dead ends: 289 [2019-11-28 17:02:43,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2019-11-28 17:02:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-28 17:02:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 141. [2019-11-28 17:02:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-28 17:02:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2019-11-28 17:02:43,443 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 38 [2019-11-28 17:02:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:43,444 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2019-11-28 17:02:43,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 17:02:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2019-11-28 17:02:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 17:02:43,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:43,445 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:43,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:43,648 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:43,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:43,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1846037516, now seen corresponding path program 1 times [2019-11-28 17:02:43,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:43,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185771394] [2019-11-28 17:02:43,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 17:02:43,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185771394] [2019-11-28 17:02:43,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113854353] [2019-11-28 17:02:43,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:43,803 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 17:02:43,805 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:43,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 17:02:43,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 17:02:43,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2019-11-28 17:02:43,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809441541] [2019-11-28 17:02:43,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:02:43,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:43,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:02:43,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:02:43,834 INFO L87 Difference]: Start difference. First operand 141 states and 178 transitions. Second operand 7 states. [2019-11-28 17:02:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:44,048 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2019-11-28 17:02:44,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:02:44,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-11-28 17:02:44,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:44,050 INFO L225 Difference]: With dead ends: 273 [2019-11-28 17:02:44,050 INFO L226 Difference]: Without dead ends: 241 [2019-11-28 17:02:44,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:02:44,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-28 17:02:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 157. [2019-11-28 17:02:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-28 17:02:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2019-11-28 17:02:44,075 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 38 [2019-11-28 17:02:44,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:44,076 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2019-11-28 17:02:44,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:02:44,076 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2019-11-28 17:02:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 17:02:44,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:44,078 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:44,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:44,281 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:44,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:44,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2055902770, now seen corresponding path program 1 times [2019-11-28 17:02:44,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:44,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370064993] [2019-11-28 17:02:44,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:02:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:02:44,412 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:02:44,412 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:02:44,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:02:44 BoogieIcfgContainer [2019-11-28 17:02:44,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:02:44,479 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:02:44,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:02:44,479 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:02:44,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:02:35" (3/4) ... [2019-11-28 17:02:44,482 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:02:44,557 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:02:44,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:02:44,558 INFO L168 Benchmark]: Toolchain (without parser) took 10477.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.8 MB). Free memory was 951.0 MB in the beginning and 1.3 GB in the end (delta: -352.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:02:44,559 INFO L168 Benchmark]: CDTParser took 0.90 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:02:44,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:44,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:44,560 INFO L168 Benchmark]: Boogie Preprocessor took 37.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:02:44,561 INFO L168 Benchmark]: RCFGBuilder took 593.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:44,561 INFO L168 Benchmark]: TraceAbstraction took 9125.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -226.2 MB). Peak memory consumption was 404.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:44,562 INFO L168 Benchmark]: Witness Printer took 78.18 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:44,564 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.90 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 581.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 593.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9125.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -226.2 MB). Peak memory consumption was 404.4 MB. Max. memory is 11.5 GB. * Witness Printer took 78.18 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L609] int len = from; [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; [L616] const int len = _get_nondet_int(2, 5); [L617] SLL s = sll_create(len); [L564] SLL head = ((void *)0); [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND FALSE !(len-- > 0) [L573] return head; [L617] SLL s = sll_create(len); [L609] int len = from; [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() [L610] COND TRUE len < until && __VERIFIER_nondet_int() [L611] len++ [L610] len < until && __VERIFIER_nondet_int() [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; [L618] const int k = _get_nondet_int(0, len - 1); [L619] int i = 0; [L620] i < k && __VERIFIER_nondet_int() [L620] i < k && __VERIFIER_nondet_int() [L620] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L625] EXPR \read(s) [L576] int len = 0; [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND FALSE !(\read(head)) [L581] return len; [L625] COND TRUE k + len != sll_length(s) [L630] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 1 error locations. Result: UNSAFE, OverallTime: 9.0s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 504 SDtfs, 1527 SDslu, 2484 SDs, 0 SdLazy, 1177 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 234 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 441 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 588 NumberOfCodeBlocks, 584 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 533 ConstructedInterpolants, 3 QuantifiedInterpolants, 123694 SizeOfPredicates, 78 NumberOfNonLiveVariables, 1122 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 87/138 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...