./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/ifeqn4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/ifeqn4.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb0916d32e80eb99af2bf326ffd82fd2d4cfa9bc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/ifeqn4.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb0916d32e80eb99af2bf326ffd82fd2d4cfa9bc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:18:55,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:18:55,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:18:55,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:18:55,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:18:55,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:18:55,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:18:55,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:18:55,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:18:55,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:18:55,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:18:55,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:18:55,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:18:55,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:18:55,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:18:55,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:18:55,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:18:55,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:18:55,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:18:55,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:18:55,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:18:55,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:18:55,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:18:55,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:18:55,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:18:55,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:18:55,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:18:55,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:18:55,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:18:55,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:18:55,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:18:55,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:18:55,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:18:55,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:18:55,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:18:55,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:18:55,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:18:55,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:18:55,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:18:55,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:18:55,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:18:55,409 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:18:55,418 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:18:55,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:18:55,419 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:18:55,419 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:18:55,419 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:18:55,419 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:18:55,419 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:18:55,420 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:18:55,420 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:18:55,420 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:18:55,420 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:18:55,420 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:18:55,420 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:18:55,420 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:18:55,420 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:18:55,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:18:55,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:18:55,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:18:55,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:18:55,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:18:55,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:18:55,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:18:55,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:18:55,422 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:18:55,422 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:18:55,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:18:55,422 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:18:55,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:18:55,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:18:55,423 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:18:55,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:18:55,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:18:55,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:18:55,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:18:55,423 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:18:55,424 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:18:55,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:18:55,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:18:55,424 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:18:55,424 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:18:55,424 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan 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 -> Taipan 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 -> cb0916d32e80eb99af2bf326ffd82fd2d4cfa9bc [2019-12-07 19:18:55,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:18:55,538 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:18:55,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:18:55,542 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:18:55,542 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:18:55,543 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/../../sv-benchmarks/c/array-fpi/ifeqn4.c [2019-12-07 19:18:55,585 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/data/78c65fe07/371ebdb4f4194dd2a7f12ffad30f54cb/FLAG457b2b18d [2019-12-07 19:18:55,925 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:18:55,925 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/sv-benchmarks/c/array-fpi/ifeqn4.c [2019-12-07 19:18:55,929 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/data/78c65fe07/371ebdb4f4194dd2a7f12ffad30f54cb/FLAG457b2b18d [2019-12-07 19:18:55,938 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/data/78c65fe07/371ebdb4f4194dd2a7f12ffad30f54cb [2019-12-07 19:18:55,940 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:18:55,940 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:18:55,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:18:55,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:18:55,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:18:55,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:18:55" (1/1) ... [2019-12-07 19:18:55,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea804c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:18:55, skipping insertion in model container [2019-12-07 19:18:55,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:18:55" (1/1) ... [2019-12-07 19:18:55,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:18:55,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:18:56,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:18:56,108 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:18:56,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:18:56,133 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:18:56,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:18:56 WrapperNode [2019-12-07 19:18:56,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:18:56,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:18:56,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:18:56,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:18:56,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:18:56" (1/1) ... [2019-12-07 19:18:56,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:18:56" (1/1) ... [2019-12-07 19:18:56,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:18:56,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:18:56,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:18:56,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:18:56,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:18:56" (1/1) ... [2019-12-07 19:18:56,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:18:56" (1/1) ... [2019-12-07 19:18:56,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:18:56" (1/1) ... [2019-12-07 19:18:56,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:18:56" (1/1) ... [2019-12-07 19:18:56,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:18:56" (1/1) ... [2019-12-07 19:18:56,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:18:56" (1/1) ... [2019-12-07 19:18:56,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:18:56" (1/1) ... [2019-12-07 19:18:56,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:18:56,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:18:56,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:18:56,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:18:56,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:18:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/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-12-07 19:18:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:18:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 19:18:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:18:56,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:18:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 19:18:56,448 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:18:56,448 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 19:18:56,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:18:56 BoogieIcfgContainer [2019-12-07 19:18:56,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:18:56,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:18:56,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:18:56,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:18:56,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:18:55" (1/3) ... [2019-12-07 19:18:56,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff90677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:18:56, skipping insertion in model container [2019-12-07 19:18:56,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:18:56" (2/3) ... [2019-12-07 19:18:56,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff90677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:18:56, skipping insertion in model container [2019-12-07 19:18:56,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:18:56" (3/3) ... [2019-12-07 19:18:56,454 INFO L109 eAbstractionObserver]: Analyzing ICFG ifeqn4.c [2019-12-07 19:18:56,461 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:18:56,465 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 19:18:56,472 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 19:18:56,486 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:18:56,486 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:18:56,486 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:18:56,486 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:18:56,487 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:18:56,487 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:18:56,487 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:18:56,487 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:18:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-12-07 19:18:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 19:18:56,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:56,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:18:56,500 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:56,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:56,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1907558339, now seen corresponding path program 1 times [2019-12-07 19:18:56,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:56,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476502023] [2019-12-07 19:18:56,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:56,573 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 19:18:56,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1872087126] [2019-12-07 19:18:56,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/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-12-07 19:18:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:56,608 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 19:18:56,611 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:18:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:18:56,638 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:18:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:18:56,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476502023] [2019-12-07 19:18:56,646 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:18:56,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872087126] [2019-12-07 19:18:56,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:56,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 19:18:56,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550878938] [2019-12-07 19:18:56,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:18:56,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:56,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:18:56,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:18:56,660 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-12-07 19:18:56,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:56,726 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2019-12-07 19:18:56,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:18:56,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 19:18:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:56,733 INFO L225 Difference]: With dead ends: 20 [2019-12-07 19:18:56,733 INFO L226 Difference]: Without dead ends: 10 [2019-12-07 19:18:56,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:18:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-12-07 19:18:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-12-07 19:18:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-12-07 19:18:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-12-07 19:18:56,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2019-12-07 19:18:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:56,755 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-12-07 19:18:56,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:18:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-12-07 19:18:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 19:18:56,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:56,756 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:18:56,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:18:56,957 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:56,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:56,957 INFO L82 PathProgramCache]: Analyzing trace with hash 943394408, now seen corresponding path program 1 times [2019-12-07 19:18:56,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:56,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354807197] [2019-12-07 19:18:56,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:56,987 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 19:18:56,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763298979] [2019-12-07 19:18:56,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/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-12-07 19:18:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:57,024 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 19:18:57,025 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:18:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:18:57,034 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:18:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:18:57,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354807197] [2019-12-07 19:18:57,039 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:18:57,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763298979] [2019-12-07 19:18:57,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:57,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2019-12-07 19:18:57,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581742201] [2019-12-07 19:18:57,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:18:57,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:57,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:18:57,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:18:57,042 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2019-12-07 19:18:57,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:57,104 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-12-07 19:18:57,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:18:57,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 19:18:57,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:57,105 INFO L225 Difference]: With dead ends: 21 [2019-12-07 19:18:57,105 INFO L226 Difference]: Without dead ends: 16 [2019-12-07 19:18:57,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:18:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-07 19:18:57,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-12-07 19:18:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-12-07 19:18:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-12-07 19:18:57,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2019-12-07 19:18:57,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:57,108 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-12-07 19:18:57,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:18:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-12-07 19:18:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:18:57,109 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:57,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:18:57,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:18:57,310 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:57,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:57,310 INFO L82 PathProgramCache]: Analyzing trace with hash -820589996, now seen corresponding path program 1 times [2019-12-07 19:18:57,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:57,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532059182] [2019-12-07 19:18:57,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:57,341 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 19:18:57,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [252308088] [2019-12-07 19:18:57,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/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-12-07 19:18:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:57,375 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 19:18:57,376 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:18:57,416 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-12-07 19:18:57,416 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:18:57,420 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:18:57,420 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:18:57,421 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 19:18:57,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:18:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:18:57,445 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:18:57,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:18:57,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:18:57,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:18:57,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:18:57,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:18:57,551 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:18:57,551 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2019-12-07 19:18:57,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:18:57,555 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:18:57,556 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:18:57,556 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_1], 1=[v_arrayElimCell_2]} [2019-12-07 19:18:57,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532059182] [2019-12-07 19:18:57,561 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:18:57,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252308088] [2019-12-07 19:18:57,561 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@56667b08 [2019-12-07 19:18:57,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [884034695] [2019-12-07 19:18:57,577 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2019-12-07 19:18:57,577 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:18:57,580 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:18:57,584 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:18:57,585 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:18:57,606 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@56667b08 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 19:18:57,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:57,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 19:18:57,607 ERROR L206 FreeRefinementEngine]: Strategy SIFA_TAIPAN failed to provide any proof altough trace is infeasible [2019-12-07 19:18:57,607 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:18:57,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:18:57,817 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-12-07 19:18:57,817 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-12-07 19:18:57,817 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-12-07 19:18:57,817 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-12-07 19:18:57,818 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-12-07 19:18:57,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-12-07 19:18:57,818 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-12-07 19:18:57,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-12-07 19:18:57,832 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 19:18:57,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:18:57 BoogieIcfgContainer [2019-12-07 19:18:57,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:18:57,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:18:57,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:18:57,834 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:18:57,835 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:18:56" (3/4) ... [2019-12-07 19:18:57,839 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 19:18:57,839 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:18:57,842 INFO L168 Benchmark]: Toolchain (without parser) took 1900.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 944.7 MB in the beginning and 961.4 MB in the end (delta: -16.7 MB). Peak memory consumption was 84.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:18:57,842 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:18:57,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 193.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -150.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 19:18:57,844 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:18:57,845 INFO L168 Benchmark]: Boogie Preprocessor took 16.35 ms. Allocated memory is still 1.1 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-12-07 19:18:57,846 INFO L168 Benchmark]: RCFGBuilder took 274.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-12-07 19:18:57,847 INFO L168 Benchmark]: TraceAbstraction took 1383.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 961.4 MB in the end (delta: 100.3 MB). Peak memory consumption was 100.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:18:57,848 INFO L168 Benchmark]: Witness Printer took 5.92 ms. Allocated memory is still 1.1 GB. Free memory is still 961.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:18:57,852 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 193.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -150.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.35 ms. Allocated memory is still 1.1 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. * RCFGBuilder took 274.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1383.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 961.4 MB in the end (delta: 100.3 MB). Peak memory consumption was 100.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.92 ms. Allocated memory is still 1.1 GB. Free memory is still 961.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 10]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L14] int N; [L18] N = __VERIFIER_nondet_int() [L19] COND FALSE !(N <= 0) [L22] long long i; [L23] long long *a = malloc(sizeof(long long)*N); [L24] long long *b = malloc(sizeof(long long)*N); [L26] i=0 [L26] COND TRUE i main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan 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 -> Taipan 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 -> cb0916d32e80eb99af2bf326ffd82fd2d4cfa9bc [2019-12-07 19:18:59,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:18:59,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:18:59,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:18:59,479 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:18:59,480 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:18:59,480 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/../../sv-benchmarks/c/array-fpi/ifeqn4.c [2019-12-07 19:18:59,519 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/data/c38189d10/0d094bab36a94c498a661fec85fc2026/FLAGce61e2078 [2019-12-07 19:18:59,844 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:18:59,844 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/sv-benchmarks/c/array-fpi/ifeqn4.c [2019-12-07 19:18:59,848 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/data/c38189d10/0d094bab36a94c498a661fec85fc2026/FLAGce61e2078 [2019-12-07 19:18:59,857 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/data/c38189d10/0d094bab36a94c498a661fec85fc2026 [2019-12-07 19:18:59,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:18:59,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:18:59,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:18:59,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:18:59,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:18:59,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:18:59" (1/1) ... [2019-12-07 19:18:59,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb84b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:18:59, skipping insertion in model container [2019-12-07 19:18:59,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:18:59" (1/1) ... [2019-12-07 19:18:59,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:18:59,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:19:00,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:19:00,011 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:19:00,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:19:00,036 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:19:00,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:00 WrapperNode [2019-12-07 19:19:00,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:19:00,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:19:00,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:19:00,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:19:00,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:00" (1/1) ... [2019-12-07 19:19:00,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:00" (1/1) ... [2019-12-07 19:19:00,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:19:00,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:19:00,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:19:00,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:19:00,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:00" (1/1) ... [2019-12-07 19:19:00,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:00" (1/1) ... [2019-12-07 19:19:00,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:00" (1/1) ... [2019-12-07 19:19:00,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:00" (1/1) ... [2019-12-07 19:19:00,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:00" (1/1) ... [2019-12-07 19:19:00,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:00" (1/1) ... [2019-12-07 19:19:00,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:00" (1/1) ... [2019-12-07 19:19:00,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:19:00,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:19:00,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:19:00,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:19:00,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/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-12-07 19:19:00,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-12-07 19:19:00,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 19:19:00,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:19:00,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:19:00,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-12-07 19:19:00,402 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:19:00,402 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 19:19:00,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:19:00 BoogieIcfgContainer [2019-12-07 19:19:00,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:19:00,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:19:00,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:19:00,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:19:00,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:18:59" (1/3) ... [2019-12-07 19:19:00,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0ed7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:19:00, skipping insertion in model container [2019-12-07 19:19:00,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:00" (2/3) ... [2019-12-07 19:19:00,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0ed7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:19:00, skipping insertion in model container [2019-12-07 19:19:00,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:19:00" (3/3) ... [2019-12-07 19:19:00,408 INFO L109 eAbstractionObserver]: Analyzing ICFG ifeqn4.c [2019-12-07 19:19:00,415 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:19:00,418 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 19:19:00,426 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 19:19:00,440 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:19:00,440 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:19:00,440 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:19:00,440 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:19:00,440 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:19:00,440 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:19:00,440 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:19:00,440 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:19:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-12-07 19:19:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:19:00,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:19:00,453 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:19:00,453 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:19:00,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:19:00,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1201566748, now seen corresponding path program 1 times [2019-12-07 19:19:00,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:19:00,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400320266] [2019-12-07 19:19:00,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 19:19:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:19:00,540 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 19:19:00,543 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:19:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:19:00,552 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:19:00,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:19:00,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400320266] [2019-12-07 19:19:00,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:19:00,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 19:19:00,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704427885] [2019-12-07 19:19:00,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 19:19:00,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:19:00,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 19:19:00,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 19:19:00,569 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-12-07 19:19:00,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:19:00,580 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2019-12-07 19:19:00,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 19:19:00,581 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-12-07 19:19:00,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:19:00,587 INFO L225 Difference]: With dead ends: 36 [2019-12-07 19:19:00,587 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 19:19:00,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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-12-07 19:19:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 19:19:00,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 19:19:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 19:19:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-12-07 19:19:00,610 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-12-07 19:19:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:19:00,610 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-12-07 19:19:00,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 19:19:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-12-07 19:19:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:19:00,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:19:00,611 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:19:00,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 19:19:00,812 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:19:00,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:19:00,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1920794649, now seen corresponding path program 1 times [2019-12-07 19:19:00,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:19:00,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3791021] [2019-12-07 19:19:00,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 19:19:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:19:00,947 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:19:00,948 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:19:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:19:00,971 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:19:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:19:00,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3791021] [2019-12-07 19:19:00,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:19:00,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 19:19:00,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326057502] [2019-12-07 19:19:00,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:19:00,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:19:00,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:19:00,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:19:00,986 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 4 states. [2019-12-07 19:19:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:19:01,096 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-12-07 19:19:01,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:19:01,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 19:19:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:19:01,097 INFO L225 Difference]: With dead ends: 34 [2019-12-07 19:19:01,097 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 19:19:01,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:19:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 19:19:01,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-12-07 19:19:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 19:19:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-12-07 19:19:01,102 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 10 [2019-12-07 19:19:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:19:01,102 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-12-07 19:19:01,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:19:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-12-07 19:19:01,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:19:01,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:19:01,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:19:01,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 19:19:01,304 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:19:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:19:01,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1948223762, now seen corresponding path program 1 times [2019-12-07 19:19:01,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:19:01,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309175453] [2019-12-07 19:19:01,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 19:19:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:19:01,425 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 19:19:01,426 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:19:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:19:01,491 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:19:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:19:01,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309175453] [2019-12-07 19:19:01,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1248934710] [2019-12-07 19:19:01,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:19:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:19:01,740 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 19:19:01,741 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:19:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:19:01,776 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:19:01,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:19:01,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:19:01,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 6, 6] total 13 [2019-12-07 19:19:01,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537768806] [2019-12-07 19:19:01,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:19:01,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:19:01,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:19:01,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:19:01,818 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 7 states. [2019-12-07 19:19:01,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:19:01,951 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2019-12-07 19:19:01,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:19:01,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-12-07 19:19:01,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:19:01,958 INFO L225 Difference]: With dead ends: 28 [2019-12-07 19:19:01,959 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 19:19:01,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:19:01,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 19:19:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-12-07 19:19:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 19:19:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-12-07 19:19:01,962 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2019-12-07 19:19:01,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:19:01,962 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-12-07 19:19:01,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:19:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-12-07 19:19:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:19:01,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:19:01,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:19:02,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3,5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:19:02,365 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:19:02,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:19:02,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1326513248, now seen corresponding path program 1 times [2019-12-07 19:19:02,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:19:02,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071059283] [2019-12-07 19:19:02,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 19:19:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:19:02,495 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 19:19:02,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:19:02,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:02,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:02,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2019-12-07 19:19:02,531 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:19:02,540 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:19:02,541 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:19:02,541 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:24 [2019-12-07 19:19:02,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:19:02,585 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:19:03,129 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 65 treesize of output 61 [2019-12-07 19:19:03,137 INFO L343 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2019-12-07 19:19:03,138 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 830 treesize of output 762 [2019-12-07 19:19:03,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:03,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:04,441 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 19:19:04,464 INFO L614 ElimStorePlain]: treesize reduction 69923, result has 0.0 percent of original size [2019-12-07 19:19:04,465 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:19:04,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:19:04,465 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:19:04,466 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:1 [2019-12-07 19:19:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:19:04,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071059283] [2019-12-07 19:19:04,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:19:04,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 9 [2019-12-07 19:19:04,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68294714] [2019-12-07 19:19:04,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:19:04,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:19:04,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:19:04,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:19:04,468 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 9 states. [2019-12-07 19:19:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:19:05,554 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-12-07 19:19:05,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:19:05,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-12-07 19:19:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:19:05,562 INFO L225 Difference]: With dead ends: 38 [2019-12-07 19:19:05,562 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 19:19:05,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:19:05,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 19:19:05,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2019-12-07 19:19:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 19:19:05,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-12-07 19:19:05,566 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2019-12-07 19:19:05,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:19:05,566 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-12-07 19:19:05,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:19:05,566 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-12-07 19:19:05,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:19:05,567 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:19:05,567 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:19:05,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 19:19:05,768 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:19:05,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:19:05,768 INFO L82 PathProgramCache]: Analyzing trace with hash 448494114, now seen corresponding path program 1 times [2019-12-07 19:19:05,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:19:05,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224249499] [2019-12-07 19:19:05,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 19:19:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:19:05,865 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 19:19:05,866 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:19:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:19:05,871 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:19:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:19:05,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224249499] [2019-12-07 19:19:05,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:19:05,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 19:19:05,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645443301] [2019-12-07 19:19:05,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:19:05,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:19:05,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:19:05,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:19:05,873 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 3 states. [2019-12-07 19:19:05,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:19:05,982 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-12-07 19:19:05,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:19:05,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 19:19:05,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:19:05,991 INFO L225 Difference]: With dead ends: 48 [2019-12-07 19:19:05,991 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 19:19:05,991 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:19:05,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 19:19:05,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-12-07 19:19:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 19:19:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-12-07 19:19:05,995 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2019-12-07 19:19:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:19:05,995 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-12-07 19:19:05,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:19:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-12-07 19:19:05,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:19:05,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:19:05,996 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:19:06,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 19:19:06,197 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:19:06,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:19:06,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1927436336, now seen corresponding path program 1 times [2019-12-07 19:19:06,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:19:06,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493861415] [2019-12-07 19:19:06,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 19:19:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:19:06,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 19:19:06,327 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:19:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:19:06,387 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:19:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:19:06,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493861415] [2019-12-07 19:19:06,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2071688771] [2019-12-07 19:19:06,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:19:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:19:06,668 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 19:19:06,668 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:19:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:19:06,698 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:19:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:19:06,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:19:06,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 7, 7] total 15 [2019-12-07 19:19:06,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619284128] [2019-12-07 19:19:06,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:19:06,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:19:06,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:19:06,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:19:06,733 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 8 states. [2019-12-07 19:19:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:19:07,402 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2019-12-07 19:19:07,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:19:07,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-12-07 19:19:07,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:19:07,409 INFO L225 Difference]: With dead ends: 58 [2019-12-07 19:19:07,409 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 19:19:07,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-12-07 19:19:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 19:19:07,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2019-12-07 19:19:07,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 19:19:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-12-07 19:19:07,412 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2019-12-07 19:19:07,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:19:07,412 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-12-07 19:19:07,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:19:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-12-07 19:19:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:19:07,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:19:07,413 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:19:07,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk,8 mathsat -unsat_core_generation=3 [2019-12-07 19:19:07,815 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:19:07,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:19:07,816 INFO L82 PathProgramCache]: Analyzing trace with hash 131437949, now seen corresponding path program 1 times [2019-12-07 19:19:07,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:19:07,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091989264] [2019-12-07 19:19:07,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 19:19:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:19:07,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 19:19:07,977 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:19:07,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:07,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:07,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2019-12-07 19:19:07,996 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:19:08,006 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:19:08,006 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:19:08,006 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2019-12-07 19:19:08,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,055 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:19:08,056 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:19:08,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:19:08,059 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:19:08,059 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:19:08,091 INFO L343 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2019-12-07 19:19:08,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 184 treesize of output 165 [2019-12-07 19:19:08,093 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:19:08,152 INFO L614 ElimStorePlain]: treesize reduction 112, result has 62.5 percent of original size [2019-12-07 19:19:08,153 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:19:08,153 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:187, output treesize:187 [2019-12-07 19:19:08,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:19:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:19:08,260 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:19:08,927 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-12-07 19:19:09,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091989264] [2019-12-07 19:19:09,597 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 19:19:09,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [813920193] [2019-12-07 19:19:09,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:19:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:19:09,822 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 19:19:09,823 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:19:09,825 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@786feb4 [2019-12-07 19:19:09,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410939640] [2019-12-07 19:19:09,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d78648a-2f77-487e-9e36-c67c5252335d/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:19:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:19:09,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 19:19:09,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:19:09,927 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@786feb4 [2019-12-07 19:19:09,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:19:09,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 19:19:09,927 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 19:19:09,927 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:19:10,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:19:10,543 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 19:19:10,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:19:10 BoogieIcfgContainer [2019-12-07 19:19:10,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:19:10,543 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:19:10,543 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:19:10,543 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:19:10,544 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:19:00" (3/4) ... [2019-12-07 19:19:10,546 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 19:19:10,546 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:19:10,547 INFO L168 Benchmark]: Toolchain (without parser) took 10686.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:19:10,547 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:19:10,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.65 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:19:10,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:19:10,548 INFO L168 Benchmark]: Boogie Preprocessor took 24.82 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-12-07 19:19:10,548 INFO L168 Benchmark]: RCFGBuilder took 286.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 19:19:10,549 INFO L168 Benchmark]: TraceAbstraction took 10139.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 152.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.9 MB). Peak memory consumption was 131.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:19:10,549 INFO L168 Benchmark]: Witness Printer took 2.75 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:19:10,551 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.65 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.82 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 286.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10139.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 152.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.9 MB). Peak memory consumption was 131.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.75 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 10]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L14] int N; [L18] N = __VERIFIER_nondet_int() [L19] COND FALSE !(N <= 0) [L22] long long i; [L23] long long *a = malloc(sizeof(long long)*N); [L24] long long *b = malloc(sizeof(long long)*N); [L26] i=0 [L26] COND TRUE i