./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer --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.24-6b5699a [2019-11-25 08:56:24,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:56:24,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:56:24,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:56:24,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:56:24,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:56:24,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:56:24,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:56:24,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:56:24,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:56:24,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:56:24,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:56:24,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:56:24,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:56:24,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:56:24,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:56:24,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:56:24,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:56:24,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:56:24,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:56:24,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:56:24,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:56:24,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:56:24,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:56:24,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:56:24,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:56:24,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:56:24,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:56:24,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:56:24,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:56:24,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:56:24,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:56:24,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:56:24,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:56:24,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:56:24,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:56:24,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:56:24,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:56:24,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:56:24,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:56:24,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:56:24,106 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:56:24,129 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:56:24,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:56:24,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:56:24,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:56:24,131 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:56:24,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:56:24,131 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:56:24,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:56:24,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:56:24,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:56:24,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:56:24,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:56:24,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:56:24,132 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:56:24,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:56:24,133 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:56:24,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:56:24,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:56:24,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:56:24,133 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:56:24,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:56:24,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:56:24,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:56:24,134 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:56:24,134 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:56:24,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:56:24,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:56:24,135 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:56:24,135 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer 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-25 08:56:24,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:56:24,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:56:24,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:56:24,332 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:56:24,332 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:56:24,334 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2019-11-25 08:56:24,397 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/data/9517cab13/7d083d0b6131499aa8ac130a39fcfaa1/FLAG78e6a6307 [2019-11-25 08:56:24,811 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:56:24,812 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2019-11-25 08:56:24,824 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/data/9517cab13/7d083d0b6131499aa8ac130a39fcfaa1/FLAG78e6a6307 [2019-11-25 08:56:25,157 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/data/9517cab13/7d083d0b6131499aa8ac130a39fcfaa1 [2019-11-25 08:56:25,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:56:25,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:56:25,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:25,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:56:25,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:56:25,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:25" (1/1) ... [2019-11-25 08:56:25,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34db8181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:25, skipping insertion in model container [2019-11-25 08:56:25,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:25" (1/1) ... [2019-11-25 08:56:25,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:56:25,221 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:56:25,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:25,564 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:56:25,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:25,692 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:56:25,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:25 WrapperNode [2019-11-25 08:56:25,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:25,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:25,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:56:25,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:56:25,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:25" (1/1) ... [2019-11-25 08:56:25,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:25" (1/1) ... [2019-11-25 08:56:25,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:25,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:56:25,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:56:25,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:56:25,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:25" (1/1) ... [2019-11-25 08:56:25,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:25" (1/1) ... [2019-11-25 08:56:25,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:25" (1/1) ... [2019-11-25 08:56:25,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:25" (1/1) ... [2019-11-25 08:56:25,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:25" (1/1) ... [2019-11-25 08:56:25,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:25" (1/1) ... [2019-11-25 08:56:25,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:25" (1/1) ... [2019-11-25 08:56:25,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:56:25,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:56:25,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:56:25,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:56:25,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/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-25 08:56:25,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:56:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:56:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:56:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:56:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:56:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 08:56:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:56:25,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:56:26,376 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:56:26,377 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-25 08:56:26,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:26 BoogieIcfgContainer [2019-11-25 08:56:26,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:56:26,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:56:26,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:56:26,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:56:26,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:56:25" (1/3) ... [2019-11-25 08:56:26,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6457547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:26, skipping insertion in model container [2019-11-25 08:56:26,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:25" (2/3) ... [2019-11-25 08:56:26,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6457547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:26, skipping insertion in model container [2019-11-25 08:56:26,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:26" (3/3) ... [2019-11-25 08:56:26,395 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-1.i [2019-11-25 08:56:26,406 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:56:26,413 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:56:26,424 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:56:26,453 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:56:26,454 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:56:26,454 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:56:26,454 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:56:26,454 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:56:26,454 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:56:26,454 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:56:26,454 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:56:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-25 08:56:26,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:56:26,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:26,481 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-25 08:56:26,482 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:26,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:26,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1240059524, now seen corresponding path program 1 times [2019-11-25 08:56:26,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:26,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343628152] [2019-11-25 08:56:26,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:26,633 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-25 08:56:26,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343628152] [2019-11-25 08:56:26,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:26,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:26,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758723835] [2019-11-25 08:56:26,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:56:26,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:26,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:56:26,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:56:26,657 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-25 08:56:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:26,683 INFO L93 Difference]: Finished difference Result 89 states and 132 transitions. [2019-11-25 08:56:26,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:56:26,685 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-25 08:56:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:26,695 INFO L225 Difference]: With dead ends: 89 [2019-11-25 08:56:26,695 INFO L226 Difference]: Without dead ends: 40 [2019-11-25 08:56:26,699 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-25 08:56:26,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-25 08:56:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-25 08:56:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-25 08:56:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-11-25 08:56:26,741 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 18 [2019-11-25 08:56:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:26,742 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-11-25 08:56:26,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:56:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2019-11-25 08:56:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:56:26,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:26,744 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-25 08:56:26,744 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:26,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:26,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1466688541, now seen corresponding path program 1 times [2019-11-25 08:56:26,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:26,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897916865] [2019-11-25 08:56:26,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:26,853 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-25 08:56:26,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897916865] [2019-11-25 08:56:26,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:26,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:56:26,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241913429] [2019-11-25 08:56:26,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:56:26,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:26,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:56:26,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:56:26,856 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 6 states. [2019-11-25 08:56:26,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:26,977 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2019-11-25 08:56:26,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:56:26,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-25 08:56:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:26,978 INFO L225 Difference]: With dead ends: 82 [2019-11-25 08:56:26,978 INFO L226 Difference]: Without dead ends: 53 [2019-11-25 08:56:26,979 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-25 08:56:26,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-25 08:56:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-11-25 08:56:26,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-25 08:56:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-11-25 08:56:26,986 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 25 [2019-11-25 08:56:26,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:26,986 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-11-25 08:56:26,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:56:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-11-25 08:56:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:56:26,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:26,988 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-25 08:56:26,988 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:26,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:26,988 INFO L82 PathProgramCache]: Analyzing trace with hash -395195180, now seen corresponding path program 1 times [2019-11-25 08:56:26,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:26,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282971902] [2019-11-25 08:56:26,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:27,105 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-25 08:56:27,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282971902] [2019-11-25 08:56:27,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487246310] [2019-11-25 08:56:27,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/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-25 08:56:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:27,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:56:27,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:27,234 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-25 08:56:27,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:56:27,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2019-11-25 08:56:27,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184880229] [2019-11-25 08:56:27,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:56:27,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:27,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:56:27,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:56:27,236 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 7 states. [2019-11-25 08:56:27,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:27,346 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2019-11-25 08:56:27,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:56:27,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-11-25 08:56:27,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:27,347 INFO L225 Difference]: With dead ends: 84 [2019-11-25 08:56:27,347 INFO L226 Difference]: Without dead ends: 55 [2019-11-25 08:56:27,348 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-25 08:56:27,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-25 08:56:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-11-25 08:56:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-25 08:56:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-11-25 08:56:27,353 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 28 [2019-11-25 08:56:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:27,354 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-11-25 08:56:27,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:56:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-11-25 08:56:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:56:27,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:27,355 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-25 08:56:27,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:27,565 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:27,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1510946244, now seen corresponding path program 1 times [2019-11-25 08:56:27,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:27,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037538353] [2019-11-25 08:56:27,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:27,719 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-25 08:56:27,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037538353] [2019-11-25 08:56:27,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:27,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:56:27,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530736510] [2019-11-25 08:56:27,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:56:27,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:27,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:56:27,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:56:27,721 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 8 states. [2019-11-25 08:56:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:27,889 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2019-11-25 08:56:27,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:56:27,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-25 08:56:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:27,891 INFO L225 Difference]: With dead ends: 70 [2019-11-25 08:56:27,891 INFO L226 Difference]: Without dead ends: 65 [2019-11-25 08:56:27,891 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-25 08:56:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-25 08:56:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2019-11-25 08:56:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-25 08:56:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-11-25 08:56:27,903 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 29 [2019-11-25 08:56:27,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:27,903 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-11-25 08:56:27,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:56:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-11-25 08:56:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:56:27,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:27,905 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-25 08:56:27,905 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:27,906 INFO L82 PathProgramCache]: Analyzing trace with hash -353652332, now seen corresponding path program 1 times [2019-11-25 08:56:27,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:27,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056542222] [2019-11-25 08:56:27,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:27,979 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-25 08:56:27,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056542222] [2019-11-25 08:56:27,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208763736] [2019-11-25 08:56:27,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/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-25 08:56:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:28,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:56:28,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:28,096 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-25 08:56:28,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:56:28,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-25 08:56:28,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701232578] [2019-11-25 08:56:28,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:56:28,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:28,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:56:28,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:56:28,100 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 8 states. [2019-11-25 08:56:28,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:28,303 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2019-11-25 08:56:28,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 08:56:28,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-25 08:56:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:28,304 INFO L225 Difference]: With dead ends: 102 [2019-11-25 08:56:28,304 INFO L226 Difference]: Without dead ends: 68 [2019-11-25 08:56:28,305 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-25 08:56:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-25 08:56:28,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2019-11-25 08:56:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-25 08:56:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-11-25 08:56:28,312 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 30 [2019-11-25 08:56:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:28,312 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-11-25 08:56:28,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:56:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-11-25 08:56:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 08:56:28,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:28,316 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-25 08:56:28,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:28,517 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:28,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:28,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1806454861, now seen corresponding path program 2 times [2019-11-25 08:56:28,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:28,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800387858] [2019-11-25 08:56:28,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:28,679 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-25 08:56:28,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800387858] [2019-11-25 08:56:28,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533787271] [2019-11-25 08:56:28,681 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/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-25 08:56:28,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:56:28,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:56:28,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-25 08:56:28,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:28,796 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-25 08:56:28,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:56:28,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:56:28,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:56:28,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-25 08:56:28,818 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-25 08:56:28,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:56:28,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:56:28,825 INFO L496 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-25 08:56:28,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2019-11-25 08:56:28,868 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:56:28,868 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-25 08:56:28,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:56:28,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:56:28,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:56:28,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:4 [2019-11-25 08:56:28,877 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-25 08:56:28,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:56:28,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-25 08:56:28,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931345721] [2019-11-25 08:56:28,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 08:56:28,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:28,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 08:56:28,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:56:28,879 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 11 states. [2019-11-25 08:56:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:29,235 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-11-25 08:56:29,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:56:29,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-11-25 08:56:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:29,237 INFO L225 Difference]: With dead ends: 75 [2019-11-25 08:56:29,237 INFO L226 Difference]: Without dead ends: 70 [2019-11-25 08:56:29,238 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-25 08:56:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-25 08:56:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-25 08:56:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-25 08:56:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-11-25 08:56:29,250 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 34 [2019-11-25 08:56:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:29,252 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-11-25 08:56:29,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 08:56:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-11-25 08:56:29,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 08:56:29,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:29,257 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-25 08:56:29,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:29,469 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:29,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:29,469 INFO L82 PathProgramCache]: Analyzing trace with hash 217180203, now seen corresponding path program 3 times [2019-11-25 08:56:29,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:29,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191954030] [2019-11-25 08:56:29,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:29,758 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-25 08:56:29,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191954030] [2019-11-25 08:56:29,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306936577] [2019-11-25 08:56:29,758 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/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-25 08:56:29,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-25 08:56:29,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:56:29,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-25 08:56:29,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:29,986 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-25 08:56:29,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:56:29,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2019-11-25 08:56:29,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401897862] [2019-11-25 08:56:29,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-25 08:56:29,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:29,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 08:56:29,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:56:29,988 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 17 states. [2019-11-25 08:56:30,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:30,509 INFO L93 Difference]: Finished difference Result 213 states and 262 transitions. [2019-11-25 08:56:30,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-25 08:56:30,509 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-11-25 08:56:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:30,510 INFO L225 Difference]: With dead ends: 213 [2019-11-25 08:56:30,511 INFO L226 Difference]: Without dead ends: 205 [2019-11-25 08:56:30,511 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-25 08:56:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-25 08:56:30,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 97. [2019-11-25 08:56:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-25 08:56:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2019-11-25 08:56:30,528 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 35 [2019-11-25 08:56:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:30,529 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2019-11-25 08:56:30,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-25 08:56:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2019-11-25 08:56:30,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 08:56:30,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:30,530 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-25 08:56:30,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:30,733 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:30,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:30,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1805693939, now seen corresponding path program 4 times [2019-11-25 08:56:30,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:30,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948949921] [2019-11-25 08:56:30,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:30,965 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-25 08:56:30,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948949921] [2019-11-25 08:56:30,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425113311] [2019-11-25 08:56:30,965 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/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-25 08:56:31,047 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-25 08:56:31,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:56:31,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-25 08:56:31,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:31,064 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-25 08:56:31,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:56:31,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:56:31,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:56:31,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-25 08:56:31,116 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-25 08:56:31,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:56:31,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:56:31,129 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-25 08:56:31,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:56:31,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:56:31,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:56:31,138 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-11-25 08:56:31,185 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:56:31,186 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-25 08:56:31,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:56:31,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:56:31,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:56:31,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-11-25 08:56:31,239 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-25 08:56:31,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:56:31,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:56:31,260 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-25 08:56:31,261 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:56:31,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:56:31,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:56:31,272 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2019-11-25 08:56:31,578 INFO L343 Elim1Store]: treesize reduction 8, result has 92.9 percent of original size [2019-11-25 08:56:31,579 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-25 08:56:31,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:31,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:31,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:32,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,146 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:56:32,217 INFO L567 ElimStorePlain]: treesize reduction 92, result has 45.6 percent of original size [2019-11-25 08:56:32,258 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:56:32,259 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-25 08:56:32,260 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:56:32,299 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.7 percent of original size [2019-11-25 08:56:32,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:56:32,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:56:32,302 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:7 [2019-11-25 08:56:32,310 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-25 08:56:32,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:56:32,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-11-25 08:56:32,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557363709] [2019-11-25 08:56:32,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-25 08:56:32,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:32,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-25 08:56:32,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-11-25 08:56:32,312 INFO L87 Difference]: Start difference. First operand 97 states and 125 transitions. Second operand 20 states. [2019-11-25 08:56:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:32,931 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2019-11-25 08:56:32,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:56:32,932 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-25 08:56:32,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:32,933 INFO L225 Difference]: With dead ends: 168 [2019-11-25 08:56:32,933 INFO L226 Difference]: Without dead ends: 158 [2019-11-25 08:56:32,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2019-11-25 08:56:32,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-25 08:56:32,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 129. [2019-11-25 08:56:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-25 08:56:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 166 transitions. [2019-11-25 08:56:32,969 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 166 transitions. Word has length 36 [2019-11-25 08:56:32,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:32,969 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 166 transitions. [2019-11-25 08:56:32,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-25 08:56:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 166 transitions. [2019-11-25 08:56:32,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 08:56:32,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:32,973 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-25 08:56:33,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:33,176 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:33,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1169066102, now seen corresponding path program 1 times [2019-11-25 08:56:33,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:33,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343946047] [2019-11-25 08:56:33,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:33,256 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-25 08:56:33,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343946047] [2019-11-25 08:56:33,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182593739] [2019-11-25 08:56:33,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/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-25 08:56:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:33,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-25 08:56:33,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:33,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:33,372 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-25 08:56:33,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:56:33,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-25 08:56:33,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999372179] [2019-11-25 08:56:33,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 08:56:33,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:33,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 08:56:33,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:56:33,373 INFO L87 Difference]: Start difference. First operand 129 states and 166 transitions. Second operand 11 states. [2019-11-25 08:56:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:33,758 INFO L93 Difference]: Finished difference Result 375 states and 494 transitions. [2019-11-25 08:56:33,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-25 08:56:33,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-11-25 08:56:33,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:33,762 INFO L225 Difference]: With dead ends: 375 [2019-11-25 08:56:33,762 INFO L226 Difference]: Without dead ends: 289 [2019-11-25 08:56:33,763 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-25 08:56:33,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-25 08:56:33,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 141. [2019-11-25 08:56:33,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:56:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2019-11-25 08:56:33,803 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 38 [2019-11-25 08:56:33,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:33,803 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2019-11-25 08:56:33,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 08:56:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2019-11-25 08:56:33,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 08:56:33,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:33,805 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-25 08:56:34,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:34,009 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:34,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:34,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1846037516, now seen corresponding path program 1 times [2019-11-25 08:56:34,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:34,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378857133] [2019-11-25 08:56:34,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:34,099 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-25 08:56:34,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378857133] [2019-11-25 08:56:34,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723159574] [2019-11-25 08:56:34,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/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-25 08:56:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:34,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:56:34,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:34,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:56:34,207 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-25 08:56:34,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:56:34,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2019-11-25 08:56:34,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631387781] [2019-11-25 08:56:34,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:56:34,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:34,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:56:34,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:56:34,208 INFO L87 Difference]: Start difference. First operand 141 states and 178 transitions. Second operand 7 states. [2019-11-25 08:56:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:34,415 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2019-11-25 08:56:34,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:56:34,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-11-25 08:56:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:34,418 INFO L225 Difference]: With dead ends: 273 [2019-11-25 08:56:34,418 INFO L226 Difference]: Without dead ends: 241 [2019-11-25 08:56:34,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:56:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-25 08:56:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 157. [2019-11-25 08:56:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-25 08:56:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2019-11-25 08:56:34,441 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 38 [2019-11-25 08:56:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:34,442 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2019-11-25 08:56:34,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:56:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2019-11-25 08:56:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 08:56:34,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:34,443 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-25 08:56:34,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:34,649 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:34,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:34,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2055902770, now seen corresponding path program 1 times [2019-11-25 08:56:34,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:34,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580230582] [2019-11-25 08:56:34,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:34,707 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:34,707 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:56:34,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:56:34 BoogieIcfgContainer [2019-11-25 08:56:34,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:56:34,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:56:34,776 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:56:34,776 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:56:34,777 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:26" (3/4) ... [2019-11-25 08:56:34,779 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:56:34,854 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d0eb0f61-bc2c-46ed-a1c5-ef81f09b6e1c/bin/uautomizer/witness.graphml [2019-11-25 08:56:34,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:56:34,856 INFO L168 Benchmark]: Toolchain (without parser) took 9695.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.5 MB). Free memory was 944.8 MB in the beginning and 860.6 MB in the end (delta: 84.2 MB). Peak memory consumption was 396.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:34,856 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:56:34,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:34,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.74 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-25 08:56:34,857 INFO L168 Benchmark]: Boogie Preprocessor took 40.09 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-25 08:56:34,857 INFO L168 Benchmark]: RCFGBuilder took 578.86 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: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:34,858 INFO L168 Benchmark]: TraceAbstraction took 8396.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 873.2 MB in the end (delta: 188.8 MB). Peak memory consumption was 372.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:34,858 INFO L168 Benchmark]: Witness Printer took 79.01 ms. Allocated memory is still 1.3 GB. Free memory was 873.2 MB in the beginning and 860.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:34,860 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 531.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.74 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. * Boogie Preprocessor took 40.09 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 578.86 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: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8396.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 873.2 MB in the end (delta: 188.8 MB). Peak memory consumption was 372.8 MB. Max. memory is 11.5 GB. * Witness Printer took 79.01 ms. Allocated memory is still 1.3 GB. Free memory was 873.2 MB in the beginning and 860.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 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: 8.3s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 2.7s, 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.2s 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.3s SatisfiabilityAnalysisTime, 2.8s 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...