./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/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_91ccff60-6014-48e4-a899-90c9586c0959/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/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-678e011 [2019-11-20 07:45:15,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:45:15,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:45:15,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:45:15,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:45:15,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:45:15,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:45:15,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:45:15,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:45:16,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:45:16,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:45:16,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:45:16,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:45:16,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:45:16,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:45:16,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:45:16,008 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:45:16,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:45:16,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:45:16,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:45:16,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:45:16,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:45:16,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:45:16,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:45:16,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:45:16,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:45:16,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:45:16,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:45:16,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:45:16,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:45:16,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:45:16,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:45:16,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:45:16,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:45:16,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:45:16,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:45:16,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:45:16,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:45:16,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:45:16,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:45:16,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:45:16,037 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 07:45:16,054 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:45:16,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:45:16,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:45:16,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:45:16,056 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:45:16,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:45:16,056 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:45:16,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 07:45:16,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:45:16,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:45:16,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 07:45:16,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 07:45:16,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 07:45:16,057 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:45:16,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:45:16,058 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:45:16,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 07:45:16,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:45:16,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:45:16,058 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 07:45:16,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 07:45:16,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:45:16,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:45:16,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 07:45:16,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 07:45:16,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 07:45:16,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 07:45:16,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 07:45:16,060 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_91ccff60-6014-48e4-a899-90c9586c0959/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-20 07:45:16,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:45:16,223 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:45:16,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:45:16,231 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:45:16,231 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:45:16,233 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2019-11-20 07:45:16,292 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/bin/uautomizer/data/83815277d/a4619325d72c465d806eb387622f2338/FLAGe5684c1d3 [2019-11-20 07:45:16,770 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:45:16,771 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2019-11-20 07:45:16,783 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/bin/uautomizer/data/83815277d/a4619325d72c465d806eb387622f2338/FLAGe5684c1d3 [2019-11-20 07:45:17,100 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/bin/uautomizer/data/83815277d/a4619325d72c465d806eb387622f2338 [2019-11-20 07:45:17,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:45:17,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:45:17,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:45:17,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:45:17,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:45:17,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:45:17" (1/1) ... [2019-11-20 07:45:17,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103de9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:45:17, skipping insertion in model container [2019-11-20 07:45:17,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:45:17" (1/1) ... [2019-11-20 07:45:17,117 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:45:17,164 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:45:17,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:45:17,512 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:45:17,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:45:17,648 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:45:17,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:45:17 WrapperNode [2019-11-20 07:45:17,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:45:17,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:45:17,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:45:17,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:45:17,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:45:17" (1/1) ... [2019-11-20 07:45:17,680 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:45:17" (1/1) ... [2019-11-20 07:45:17,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:45:17,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:45:17,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:45:17,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:45:17,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:45:17" (1/1) ... [2019-11-20 07:45:17,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:45:17" (1/1) ... [2019-11-20 07:45:17,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:45:17" (1/1) ... [2019-11-20 07:45:17,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:45:17" (1/1) ... [2019-11-20 07:45:17,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:45:17" (1/1) ... [2019-11-20 07:45:17,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:45:17" (1/1) ... [2019-11-20 07:45:17,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:45:17" (1/1) ... [2019-11-20 07:45:17,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:45:17,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:45:17,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:45:17,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:45:17,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:45:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/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-20 07:45:17,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 07:45:17,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 07:45:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 07:45:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 07:45:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 07:45:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 07:45:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:45:17,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:45:18,232 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:45:18,232 INFO L285 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-20 07:45:18,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:45:18 BoogieIcfgContainer [2019-11-20 07:45:18,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:45:18,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 07:45:18,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 07:45:18,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 07:45:18,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:45:17" (1/3) ... [2019-11-20 07:45:18,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34840169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:45:18, skipping insertion in model container [2019-11-20 07:45:18,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:45:17" (2/3) ... [2019-11-20 07:45:18,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34840169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:45:18, skipping insertion in model container [2019-11-20 07:45:18,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:45:18" (3/3) ... [2019-11-20 07:45:18,243 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-1.i [2019-11-20 07:45:18,252 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 07:45:18,257 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 07:45:18,264 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 07:45:18,283 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 07:45:18,283 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 07:45:18,283 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 07:45:18,283 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:45:18,283 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:45:18,283 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 07:45:18,284 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:45:18,284 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 07:45:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-20 07:45:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 07:45:18,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:45:18,300 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-20 07:45:18,301 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:45:18,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:45:18,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1240059524, now seen corresponding path program 1 times [2019-11-20 07:45:18,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:45:18,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532023491] [2019-11-20 07:45:18,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:45:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:45:18,406 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-20 07:45:18,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532023491] [2019-11-20 07:45:18,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:45:18,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:45:18,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995309414] [2019-11-20 07:45:18,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 07:45:18,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:45:18,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 07:45:18,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 07:45:18,425 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-20 07:45:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:45:18,443 INFO L93 Difference]: Finished difference Result 89 states and 132 transitions. [2019-11-20 07:45:18,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 07:45:18,444 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-20 07:45:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:45:18,450 INFO L225 Difference]: With dead ends: 89 [2019-11-20 07:45:18,451 INFO L226 Difference]: Without dead ends: 40 [2019-11-20 07:45:18,453 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-20 07:45:18,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-20 07:45:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-20 07:45:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-20 07:45:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-11-20 07:45:18,483 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 18 [2019-11-20 07:45:18,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:45:18,483 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-11-20 07:45:18,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 07:45:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2019-11-20 07:45:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 07:45:18,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:45:18,484 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-20 07:45:18,485 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:45:18,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:45:18,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1466688541, now seen corresponding path program 1 times [2019-11-20 07:45:18,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:45:18,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328764601] [2019-11-20 07:45:18,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:45:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:45:18,615 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-20 07:45:18,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328764601] [2019-11-20 07:45:18,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:45:18,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 07:45:18,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810095400] [2019-11-20 07:45:18,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 07:45:18,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:45:18,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 07:45:18,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 07:45:18,625 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 6 states. [2019-11-20 07:45:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:45:18,771 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2019-11-20 07:45:18,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:45:18,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-20 07:45:18,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:45:18,775 INFO L225 Difference]: With dead ends: 82 [2019-11-20 07:45:18,775 INFO L226 Difference]: Without dead ends: 53 [2019-11-20 07:45:18,776 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-20 07:45:18,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-20 07:45:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-11-20 07:45:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-20 07:45:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-11-20 07:45:18,791 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 25 [2019-11-20 07:45:18,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:45:18,792 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-11-20 07:45:18,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 07:45:18,792 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-11-20 07:45:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 07:45:18,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:45:18,793 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-20 07:45:18,794 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:45:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:45:18,794 INFO L82 PathProgramCache]: Analyzing trace with hash -395195180, now seen corresponding path program 1 times [2019-11-20 07:45:18,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:45:18,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341105229] [2019-11-20 07:45:18,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:45:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:45:18,932 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-20 07:45:18,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341105229] [2019-11-20 07:45:18,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414216145] [2019-11-20 07:45:18,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/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-20 07:45:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:45:19,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 07:45:19,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:45:19,064 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-20 07:45:19,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 07:45:19,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2019-11-20 07:45:19,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091610105] [2019-11-20 07:45:19,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 07:45:19,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:45:19,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 07:45:19,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:45:19,069 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 7 states. [2019-11-20 07:45:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:45:19,210 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2019-11-20 07:45:19,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 07:45:19,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-11-20 07:45:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:45:19,212 INFO L225 Difference]: With dead ends: 84 [2019-11-20 07:45:19,212 INFO L226 Difference]: Without dead ends: 55 [2019-11-20 07:45:19,213 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-20 07:45:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-20 07:45:19,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-11-20 07:45:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 07:45:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-11-20 07:45:19,220 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 28 [2019-11-20 07:45:19,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:45:19,220 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-11-20 07:45:19,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 07:45:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-11-20 07:45:19,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 07:45:19,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:45:19,221 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-20 07:45:19,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:45:19,425 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:45:19,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:45:19,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1510946244, now seen corresponding path program 1 times [2019-11-20 07:45:19,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:45:19,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548495489] [2019-11-20 07:45:19,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:45:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:45:19,538 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-20 07:45:19,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548495489] [2019-11-20 07:45:19,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:45:19,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 07:45:19,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838180645] [2019-11-20 07:45:19,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 07:45:19,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:45:19,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 07:45:19,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:45:19,540 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 8 states. [2019-11-20 07:45:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:45:19,716 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2019-11-20 07:45:19,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 07:45:19,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-20 07:45:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:45:19,717 INFO L225 Difference]: With dead ends: 70 [2019-11-20 07:45:19,717 INFO L226 Difference]: Without dead ends: 65 [2019-11-20 07:45:19,718 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-20 07:45:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-20 07:45:19,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2019-11-20 07:45:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-20 07:45:19,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-11-20 07:45:19,732 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 29 [2019-11-20 07:45:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:45:19,733 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-11-20 07:45:19,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 07:45:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-11-20 07:45:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 07:45:19,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:45:19,734 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-20 07:45:19,735 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:45:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:45:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash -353652332, now seen corresponding path program 1 times [2019-11-20 07:45:19,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:45:19,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292847375] [2019-11-20 07:45:19,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:45:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:45:19,864 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-20 07:45:19,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292847375] [2019-11-20 07:45:19,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426103199] [2019-11-20 07:45:19,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/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-20 07:45:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:45:19,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 07:45:19,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:45:19,978 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-20 07:45:19,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:45:19,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-20 07:45:19,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759265171] [2019-11-20 07:45:19,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 07:45:19,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:45:19,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 07:45:19,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:45:19,983 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 8 states. [2019-11-20 07:45:20,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:45:20,195 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2019-11-20 07:45:20,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 07:45:20,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-20 07:45:20,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:45:20,197 INFO L225 Difference]: With dead ends: 102 [2019-11-20 07:45:20,197 INFO L226 Difference]: Without dead ends: 68 [2019-11-20 07:45:20,198 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-20 07:45:20,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-20 07:45:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2019-11-20 07:45:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-20 07:45:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-11-20 07:45:20,206 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 30 [2019-11-20 07:45:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:45:20,207 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-11-20 07:45:20,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 07:45:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-11-20 07:45:20,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 07:45:20,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:45:20,208 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-20 07:45:20,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:45:20,412 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:45:20,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:45:20,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1806454861, now seen corresponding path program 2 times [2019-11-20 07:45:20,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:45:20,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199372301] [2019-11-20 07:45:20,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:45:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:45:20,546 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-20 07:45:20,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199372301] [2019-11-20 07:45:20,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111779996] [2019-11-20 07:45:20,547 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/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-20 07:45:20,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 07:45:20,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:45:20,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-20 07:45:20,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:45:20,684 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-20 07:45:20,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:45:20,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:45:20,691 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-20 07:45:20,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-20 07:45:20,708 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-20 07:45:20,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:45:20,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:45:20,719 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-20 07:45:20,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2019-11-20 07:45:20,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:45:20,759 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-20 07:45:20,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:45:20,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:45:20,762 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-20 07:45:20,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:4 [2019-11-20 07:45:20,766 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-20 07:45:20,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:45:20,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-20 07:45:20,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242910058] [2019-11-20 07:45:20,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 07:45:20,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:45:20,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 07:45:20,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-20 07:45:20,768 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 11 states. [2019-11-20 07:45:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:45:21,092 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-11-20 07:45:21,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 07:45:21,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-11-20 07:45:21,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:45:21,093 INFO L225 Difference]: With dead ends: 75 [2019-11-20 07:45:21,093 INFO L226 Difference]: Without dead ends: 70 [2019-11-20 07:45:21,094 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-20 07:45:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-20 07:45:21,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-20 07:45:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 07:45:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-11-20 07:45:21,105 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 34 [2019-11-20 07:45:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:45:21,107 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-11-20 07:45:21,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 07:45:21,107 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-11-20 07:45:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 07:45:21,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:45:21,110 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-20 07:45:21,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:45:21,310 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:45:21,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:45:21,311 INFO L82 PathProgramCache]: Analyzing trace with hash 217180203, now seen corresponding path program 3 times [2019-11-20 07:45:21,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:45:21,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235904395] [2019-11-20 07:45:21,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:45:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:45:21,559 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-20 07:45:21,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235904395] [2019-11-20 07:45:21,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381226678] [2019-11-20 07:45:21,559 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/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-20 07:45:21,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-20 07:45:21,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:45:21,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 07:45:21,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:45:21,739 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-20 07:45:21,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:45:21,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2019-11-20 07:45:21,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551874872] [2019-11-20 07:45:21,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 07:45:21,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:45:21,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 07:45:21,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-11-20 07:45:21,741 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 17 states. [2019-11-20 07:45:22,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:45:22,230 INFO L93 Difference]: Finished difference Result 213 states and 262 transitions. [2019-11-20 07:45:22,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 07:45:22,230 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-11-20 07:45:22,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:45:22,232 INFO L225 Difference]: With dead ends: 213 [2019-11-20 07:45:22,232 INFO L226 Difference]: Without dead ends: 205 [2019-11-20 07:45:22,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-11-20 07:45:22,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-20 07:45:22,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 97. [2019-11-20 07:45:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-20 07:45:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2019-11-20 07:45:22,250 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 35 [2019-11-20 07:45:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:45:22,250 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2019-11-20 07:45:22,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 07:45:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2019-11-20 07:45:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 07:45:22,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:45:22,252 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-20 07:45:22,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:45:22,466 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:45:22,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:45:22,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1805693939, now seen corresponding path program 4 times [2019-11-20 07:45:22,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:45:22,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165981984] [2019-11-20 07:45:22,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:45:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:45:22,688 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-20 07:45:22,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165981984] [2019-11-20 07:45:22,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615952148] [2019-11-20 07:45:22,689 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/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-20 07:45:22,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 07:45:22,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:45:22,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-20 07:45:22,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:45:22,785 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-20 07:45:22,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:45:22,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:45:22,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:45:22,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-20 07:45:22,827 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-20 07:45:22,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:45:22,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:45:22,840 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-20 07:45:22,840 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:45:22,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:45:22,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:45:22,849 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-11-20 07:45:22,916 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:45:22,917 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-20 07:45:22,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:45:22,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:45:22,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:45:22,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-11-20 07:45:22,959 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-20 07:45:22,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:45:22,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:45:22,977 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-20 07:45:22,978 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:45:22,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:45:22,998 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-20 07:45:22,999 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2019-11-20 07:45:23,354 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-20 07:45:23,355 INFO L343 Elim1Store]: treesize reduction 8, result has 92.9 percent of original size [2019-11-20 07:45:23,355 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-20 07:45:23,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:23,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:23,897 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-20 07:45:23,986 INFO L567 ElimStorePlain]: treesize reduction 92, result has 45.6 percent of original size [2019-11-20 07:45:24,030 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:45:24,031 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-20 07:45:24,032 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:45:24,060 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.7 percent of original size [2019-11-20 07:45:24,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:45:24,063 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-20 07:45:24,063 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:7 [2019-11-20 07:45:24,071 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-20 07:45:24,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:45:24,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-11-20 07:45:24,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315418720] [2019-11-20 07:45:24,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 07:45:24,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:45:24,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 07:45:24,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-11-20 07:45:24,073 INFO L87 Difference]: Start difference. First operand 97 states and 125 transitions. Second operand 20 states. [2019-11-20 07:45:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:45:24,639 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2019-11-20 07:45:24,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 07:45:24,640 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-20 07:45:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:45:24,641 INFO L225 Difference]: With dead ends: 168 [2019-11-20 07:45:24,641 INFO L226 Difference]: Without dead ends: 158 [2019-11-20 07:45:24,642 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-20 07:45:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-20 07:45:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 129. [2019-11-20 07:45:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-20 07:45:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 166 transitions. [2019-11-20 07:45:24,658 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 166 transitions. Word has length 36 [2019-11-20 07:45:24,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:45:24,659 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 166 transitions. [2019-11-20 07:45:24,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 07:45:24,659 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 166 transitions. [2019-11-20 07:45:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 07:45:24,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:45:24,661 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-20 07:45:24,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:45:24,867 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:45:24,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:45:24,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1169066102, now seen corresponding path program 1 times [2019-11-20 07:45:24,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:45:24,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909235385] [2019-11-20 07:45:24,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:45:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:45:24,944 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-20 07:45:24,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909235385] [2019-11-20 07:45:24,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24405365] [2019-11-20 07:45:24,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/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-20 07:45:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:45:25,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 07:45:25,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:45:25,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:25,063 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-20 07:45:25,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:45:25,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-20 07:45:25,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099739420] [2019-11-20 07:45:25,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 07:45:25,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:45:25,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 07:45:25,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-20 07:45:25,065 INFO L87 Difference]: Start difference. First operand 129 states and 166 transitions. Second operand 11 states. [2019-11-20 07:45:25,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:45:25,457 INFO L93 Difference]: Finished difference Result 375 states and 494 transitions. [2019-11-20 07:45:25,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 07:45:25,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-11-20 07:45:25,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:45:25,460 INFO L225 Difference]: With dead ends: 375 [2019-11-20 07:45:25,460 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 07:45:25,462 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-20 07:45:25,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 07:45:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 141. [2019-11-20 07:45:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 07:45:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2019-11-20 07:45:25,495 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 38 [2019-11-20 07:45:25,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:45:25,496 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2019-11-20 07:45:25,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 07:45:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2019-11-20 07:45:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 07:45:25,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:45:25,498 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-20 07:45:25,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:45:25,705 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:45:25,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:45:25,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1846037516, now seen corresponding path program 1 times [2019-11-20 07:45:25,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:45:25,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722698346] [2019-11-20 07:45:25,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:45:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:45:25,766 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-20 07:45:25,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722698346] [2019-11-20 07:45:25,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723080910] [2019-11-20 07:45:25,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/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-20 07:45:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:45:25,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 07:45:25,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:45:25,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:45:25,879 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-20 07:45:25,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 07:45:25,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2019-11-20 07:45:25,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903217495] [2019-11-20 07:45:25,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 07:45:25,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:45:25,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 07:45:25,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 07:45:25,881 INFO L87 Difference]: Start difference. First operand 141 states and 178 transitions. Second operand 7 states. [2019-11-20 07:45:26,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:45:26,062 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2019-11-20 07:45:26,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 07:45:26,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-11-20 07:45:26,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:45:26,064 INFO L225 Difference]: With dead ends: 273 [2019-11-20 07:45:26,064 INFO L226 Difference]: Without dead ends: 241 [2019-11-20 07:45:26,065 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-20 07:45:26,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-20 07:45:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 157. [2019-11-20 07:45:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-20 07:45:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2019-11-20 07:45:26,086 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 38 [2019-11-20 07:45:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:45:26,087 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2019-11-20 07:45:26,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 07:45:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2019-11-20 07:45:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 07:45:26,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:45:26,088 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-20 07:45:26,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:45:26,291 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:45:26,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:45:26,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2055902770, now seen corresponding path program 1 times [2019-11-20 07:45:26,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:45:26,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088996322] [2019-11-20 07:45:26,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:45:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:45:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:45:26,348 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:45:26,348 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 07:45:26,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:45:26 BoogieIcfgContainer [2019-11-20 07:45:26,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 07:45:26,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:45:26,402 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:45:26,402 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:45:26,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:45:18" (3/4) ... [2019-11-20 07:45:26,404 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 07:45:26,476 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_91ccff60-6014-48e4-a899-90c9586c0959/bin/uautomizer/witness.graphml [2019-11-20 07:45:26,477 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:45:26,478 INFO L168 Benchmark]: Toolchain (without parser) took 9374.89 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 227.0 MB). Free memory was 940.8 MB in the beginning and 1.2 GB in the end (delta: -281.5 MB). Peak memory consumption was 257.5 MB. Max. memory is 11.5 GB. [2019-11-20 07:45:26,478 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:45:26,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-20 07:45:26,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.11 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 07:45:26,480 INFO L168 Benchmark]: Boogie Preprocessor took 36.62 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-20 07:45:26,480 INFO L168 Benchmark]: RCFGBuilder took 490.02 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2019-11-20 07:45:26,481 INFO L168 Benchmark]: TraceAbstraction took 8166.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.1 GB in the beginning and 883.1 MB in the end (delta: 200.8 MB). Peak memory consumption was 250.6 MB. Max. memory is 11.5 GB. [2019-11-20 07:45:26,481 INFO L168 Benchmark]: Witness Printer took 75.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 32.0 MB). Free memory was 883.1 MB in the beginning and 1.2 GB in the end (delta: -339.2 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. [2019-11-20 07:45:26,484 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 545.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.11 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.62 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 490.02 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8166.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.1 GB in the beginning and 883.1 MB in the end (delta: 200.8 MB). Peak memory consumption was 250.6 MB. Max. memory is 11.5 GB. * Witness Printer took 75.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 32.0 MB). Free memory was 883.1 MB in the beginning and 1.2 GB in the end (delta: -339.2 MB). Peak memory consumption was 4.7 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.1s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 504 SDtfs, 1527 SDslu, 2484 SDs, 0 SdLazy, 1177 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s 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.4s SatisfiabilityAnalysisTime, 2.6s 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...