./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0684b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0684b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9898ce33ba90bf1deafb76b4145359648bf729c6 ........................................................................................................................................................................................................................................................................................................................................................................................... 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_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0684b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9898ce33ba90bf1deafb76b4145359648bf729c6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:45:41,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:45:41,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:45:41,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:45:41,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:45:41,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:45:41,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:45:41,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:45:41,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:45:41,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:45:41,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:45:41,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:45:41,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:45:41,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:45:41,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:45:41,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:45:41,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:45:41,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:45:41,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:45:41,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:45:41,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:45:41,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:45:41,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:45:41,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:45:41,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:45:41,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:45:41,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:45:41,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:45:41,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:45:41,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:45:41,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:45:41,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:45:41,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:45:41,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:45:41,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:45:41,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:45:41,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:45:41,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:45:41,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:45:41,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:45:41,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:45:41,724 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:45:41,736 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:45:41,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:45:41,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:45:41,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:45:41,738 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:45:41,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:45:41,738 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:45:41,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:45:41,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:45:41,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:45:41,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:45:41,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:45:41,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:45:41,740 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:45:41,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:45:41,741 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:45:41,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:45:41,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:45:41,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:45:41,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:45:41,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:45:41,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:45:41,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:45:41,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:45:41,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:45:41,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:45:41,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:45:41,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:45:41,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9898ce33ba90bf1deafb76b4145359648bf729c6 [2019-11-15 23:45:41,769 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:45:41,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:45:41,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:45:41,783 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:45:41,783 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:45:41,784 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0684b.c [2019-11-15 23:45:41,836 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/data/7e3c22b92/41fc1c92b83d4c5aaf92774b7bdc77ad/FLAG3139c3b8c [2019-11-15 23:45:42,309 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:45:42,309 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/sv-benchmarks/c/float-newlib/double_req_bl_0684b.c [2019-11-15 23:45:42,319 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/data/7e3c22b92/41fc1c92b83d4c5aaf92774b7bdc77ad/FLAG3139c3b8c [2019-11-15 23:45:42,336 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/data/7e3c22b92/41fc1c92b83d4c5aaf92774b7bdc77ad [2019-11-15 23:45:42,339 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:45:42,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:45:42,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:42,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:45:42,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:45:42,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:42" (1/1) ... [2019-11-15 23:45:42,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ed864e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:42, skipping insertion in model container [2019-11-15 23:45:42,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:42" (1/1) ... [2019-11-15 23:45:42,361 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:45:42,399 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:45:42,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:42,720 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:45:42,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:42,818 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:45:42,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:42 WrapperNode [2019-11-15 23:45:42,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:42,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:42,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:45:42,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:45:42,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:42" (1/1) ... [2019-11-15 23:45:42,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:42" (1/1) ... [2019-11-15 23:45:42,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:42,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:45:42,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:45:42,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:45:42,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:42" (1/1) ... [2019-11-15 23:45:42,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:42" (1/1) ... [2019-11-15 23:45:42,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:42" (1/1) ... [2019-11-15 23:45:42,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:42" (1/1) ... [2019-11-15 23:45:42,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:42" (1/1) ... [2019-11-15 23:45:42,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:42" (1/1) ... [2019-11-15 23:45:42,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:42" (1/1) ... [2019-11-15 23:45:42,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:45:42,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:45:42,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:45:43,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:45:43,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:45:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:45:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-15 23:45:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:45:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-15 23:45:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:45:43,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:45:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:45:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-15 23:45:43,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:45:43,848 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:45:43,848 INFO L284 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-15 23:45:43,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:43 BoogieIcfgContainer [2019-11-15 23:45:43,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:45:43,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:45:43,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:45:43,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:45:43,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:45:42" (1/3) ... [2019-11-15 23:45:43,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578268b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:45:43, skipping insertion in model container [2019-11-15 23:45:43,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:42" (2/3) ... [2019-11-15 23:45:43,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578268b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:45:43, skipping insertion in model container [2019-11-15 23:45:43,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:43" (3/3) ... [2019-11-15 23:45:43,856 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0684b.c [2019-11-15 23:45:43,864 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:45:43,871 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:45:43,881 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:45:43,904 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:45:43,904 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:45:43,904 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:45:43,905 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:45:43,905 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:45:43,905 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:45:43,905 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:45:43,905 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:45:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-15 23:45:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:45:43,936 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:43,936 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:43,938 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:43,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:43,941 INFO L82 PathProgramCache]: Analyzing trace with hash -617567418, now seen corresponding path program 1 times [2019-11-15 23:45:43,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:43,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814592262] [2019-11-15 23:45:43,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:43,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:43,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:44,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814592262] [2019-11-15 23:45:44,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:44,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:44,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481099500] [2019-11-15 23:45:44,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:45:44,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:44,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:45:44,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:45:44,091 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 2 states. [2019-11-15 23:45:44,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:44,119 INFO L93 Difference]: Finished difference Result 246 states and 412 transitions. [2019-11-15 23:45:44,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:45:44,121 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-15 23:45:44,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:44,131 INFO L225 Difference]: With dead ends: 246 [2019-11-15 23:45:44,131 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:45:44,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:45:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:45:44,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-15 23:45:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 23:45:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2019-11-15 23:45:44,174 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 15 [2019-11-15 23:45:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:44,175 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2019-11-15 23:45:44,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:45:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2019-11-15 23:45:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:45:44,176 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:44,176 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:44,176 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:44,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:44,177 INFO L82 PathProgramCache]: Analyzing trace with hash -397782484, now seen corresponding path program 1 times [2019-11-15 23:45:44,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:44,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506374155] [2019-11-15 23:45:44,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:44,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:44,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:44,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506374155] [2019-11-15 23:45:44,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:44,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:44,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696655584] [2019-11-15 23:45:44,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:44,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:44,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:44,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:44,275 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand 3 states. [2019-11-15 23:45:44,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:44,304 INFO L93 Difference]: Finished difference Result 229 states and 326 transitions. [2019-11-15 23:45:44,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:44,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 23:45:44,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:44,306 INFO L225 Difference]: With dead ends: 229 [2019-11-15 23:45:44,306 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:45:44,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:45:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-15 23:45:44,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 23:45:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2019-11-15 23:45:44,323 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 18 [2019-11-15 23:45:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:44,324 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2019-11-15 23:45:44,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2019-11-15 23:45:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:45:44,325 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:44,325 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:44,325 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:44,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:44,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1006577033, now seen corresponding path program 1 times [2019-11-15 23:45:44,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:44,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803111984] [2019-11-15 23:45:44,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:44,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:44,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:44,862 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:44,865 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:45:44,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:45:44 BoogieIcfgContainer [2019-11-15 23:45:44,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:45:44,949 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:45:44,950 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:45:44,950 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:45:44,950 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:43" (3/4) ... [2019-11-15 23:45:44,954 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:45:44,954 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:45:44,957 INFO L168 Benchmark]: Toolchain (without parser) took 2616.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 944.7 MB in the beginning and 963.6 MB in the end (delta: -18.8 MB). Peak memory consumption was 137.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:44,958 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:45:44,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 476.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:44,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.67 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:44,962 INFO L168 Benchmark]: Boogie Preprocessor took 94.50 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:44,962 INFO L168 Benchmark]: RCFGBuilder took 850.15 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: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:44,963 INFO L168 Benchmark]: TraceAbstraction took 1096.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 963.6 MB in the end (delta: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:44,963 INFO L168 Benchmark]: Witness Printer took 6.02 ms. Allocated memory is still 1.2 GB. Free memory is still 963.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:45:44,966 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 476.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.67 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.50 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 850.15 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: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1096.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 963.6 MB in the end (delta: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 11.5 GB. * Witness Printer took 6.02 ms. Allocated memory is still 1.2 GB. Free memory is still 963.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 286]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 52, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 285. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L60-L62] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L139-L140] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L276] double x = __VERIFIER_nondet_double(); [L277] double y = -1.0 / 0.0; [L260] __int32_t hx; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L262] ieee_double_shape_type gh_u; [L263] gh_u.value = (x) [L264] EXPR gh_u.parts.msw [L264] (hx) = gh_u.parts.msw [L266] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L280] isfinite_double(x) && isinf_double(y) [L246] __int32_t hx, lx; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L248] ieee_double_shape_type ew_u; [L249] ew_u.value = (x) [L250] EXPR ew_u.parts.msw [L250] (hx) = ew_u.parts.msw [L251] EXPR ew_u.parts.lsw [L251] (lx) = ew_u.parts.lsw [L253] hx &= 0x7fffffff [L254] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L255] hx = 0x7ff00000 - hx [L256] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L280] isfinite_double(x) && isinf_double(y) VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L280] COND TRUE isfinite_double(x) && isinf_double(y) [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L148] ieee_double_shape_type ew_u; [L149] ew_u.value = (x) [L150] EXPR ew_u.parts.msw [L150] (hx) = ew_u.parts.msw [L151] EXPR ew_u.parts.lsw [L151] (lx) = ew_u.parts.lsw [L153] ix = hx & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L155] ieee_double_shape_type ew_u; [L156] ew_u.value = (y) [L157] EXPR ew_u.parts.msw [L157] (hy) = ew_u.parts.msw [L158] EXPR ew_u.parts.lsw [L158] (ly) = ew_u.parts.lsw [L160] iy = hy & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L161-L162] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L163] return x + y; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L282] double res = __ieee754_atan2(y, x); [L285] COND TRUE res != -pi_o_2 VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L286] __VERIFIER_error() VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 343 SDtfs, 0 SDslu, 163 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 23:45:47,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:45:47,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:45:47,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:45:47,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:45:47,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:45:47,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:45:47,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:45:47,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:45:47,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:45:47,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:45:47,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:45:47,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:45:47,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:45:47,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:45:47,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:45:47,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:45:47,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:45:47,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:45:47,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:45:47,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:45:47,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:45:47,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:45:47,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:45:47,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:45:47,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:45:47,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:45:47,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:45:47,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:45:47,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:45:47,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:45:47,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:45:47,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:45:47,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:45:47,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:45:47,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:45:47,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:45:47,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:45:47,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:45:47,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:45:47,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:45:47,150 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 23:45:47,171 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:45:47,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:45:47,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:45:47,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:45:47,172 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:45:47,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:45:47,173 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:45:47,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:45:47,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:45:47,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:45:47,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:45:47,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:45:47,174 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:45:47,174 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:45:47,174 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:45:47,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:45:47,175 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:45:47,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:45:47,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:45:47,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:45:47,175 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:45:47,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:45:47,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:45:47,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:45:47,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:45:47,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:45:47,176 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:45:47,176 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:45:47,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:45:47,177 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:45:47,177 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9898ce33ba90bf1deafb76b4145359648bf729c6 [2019-11-15 23:45:47,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:45:47,214 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:45:47,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:45:47,218 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:45:47,218 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:45:47,219 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0684b.c [2019-11-15 23:45:47,275 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/data/2faeba240/a280fe450c414fefa8dd7fc5ee0b48b1/FLAG04e7f9e61 [2019-11-15 23:45:47,689 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:45:47,689 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/sv-benchmarks/c/float-newlib/double_req_bl_0684b.c [2019-11-15 23:45:47,696 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/data/2faeba240/a280fe450c414fefa8dd7fc5ee0b48b1/FLAG04e7f9e61 [2019-11-15 23:45:48,096 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/data/2faeba240/a280fe450c414fefa8dd7fc5ee0b48b1 [2019-11-15 23:45:48,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:45:48,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:45:48,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:48,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:45:48,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:45:48,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:48" (1/1) ... [2019-11-15 23:45:48,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61429a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:48, skipping insertion in model container [2019-11-15 23:45:48,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:48" (1/1) ... [2019-11-15 23:45:48,114 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:45:48,148 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:45:48,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:48,375 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:45:48,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:48,535 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:45:48,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:48 WrapperNode [2019-11-15 23:45:48,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:48,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:48,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:45:48,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:45:48,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:48" (1/1) ... [2019-11-15 23:45:48,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:48" (1/1) ... [2019-11-15 23:45:48,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:48,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:45:48,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:45:48,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:45:48,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:48" (1/1) ... [2019-11-15 23:45:48,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:48" (1/1) ... [2019-11-15 23:45:48,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:48" (1/1) ... [2019-11-15 23:45:48,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:48" (1/1) ... [2019-11-15 23:45:48,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:48" (1/1) ... [2019-11-15 23:45:48,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:48" (1/1) ... [2019-11-15 23:45:48,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:48" (1/1) ... [2019-11-15 23:45:48,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:45:48,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:45:48,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:45:48,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:45:48,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:45:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-15 23:45:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-15 23:45:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:45:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-15 23:45:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:45:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:45:48,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:45:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:45:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:46:24,868 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:46:24,869 INFO L284 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-15 23:46:24,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:46:24 BoogieIcfgContainer [2019-11-15 23:46:24,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:46:24,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:46:24,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:46:24,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:46:24,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:45:48" (1/3) ... [2019-11-15 23:46:24,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287e0578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:46:24, skipping insertion in model container [2019-11-15 23:46:24,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:48" (2/3) ... [2019-11-15 23:46:24,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287e0578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:46:24, skipping insertion in model container [2019-11-15 23:46:24,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:46:24" (3/3) ... [2019-11-15 23:46:24,878 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0684b.c [2019-11-15 23:46:24,888 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:46:24,897 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:46:24,907 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:46:24,947 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:46:24,947 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:46:24,948 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:46:24,948 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:46:24,948 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:46:24,948 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:46:24,949 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:46:24,949 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:46:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-15 23:46:24,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:46:24,978 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:24,979 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:24,981 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:24,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:24,986 INFO L82 PathProgramCache]: Analyzing trace with hash -617567418, now seen corresponding path program 1 times [2019-11-15 23:46:24,998 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:46:24,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112967311] [2019-11-15 23:46:24,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/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-11-15 23:46:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:25,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 23:46:25,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:25,413 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:46:25,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:25,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112967311] [2019-11-15 23:46:25,427 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:25,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 23:46:25,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735405853] [2019-11-15 23:46:25,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:46:25,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:46:25,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:46:25,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:46:25,449 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 2 states. [2019-11-15 23:46:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:25,507 INFO L93 Difference]: Finished difference Result 246 states and 412 transitions. [2019-11-15 23:46:25,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:46:25,509 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-15 23:46:25,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:25,526 INFO L225 Difference]: With dead ends: 246 [2019-11-15 23:46:25,526 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:46:25,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:46:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:46:25,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-15 23:46:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 23:46:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2019-11-15 23:46:25,592 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 15 [2019-11-15 23:46:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:25,593 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2019-11-15 23:46:25,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:46:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2019-11-15 23:46:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:46:25,595 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:25,596 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:25,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-15 23:46:25,797 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:25,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:25,798 INFO L82 PathProgramCache]: Analyzing trace with hash -397782484, now seen corresponding path program 1 times [2019-11-15 23:46:25,800 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:46:25,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984855725] [2019-11-15 23:46:25,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/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-11-15 23:46:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:26,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:46:26,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:26,236 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:46:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:26,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984855725] [2019-11-15 23:46:26,239 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:26,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 23:46:26,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900735676] [2019-11-15 23:46:26,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:26,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:46:26,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:26,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:26,245 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand 3 states. [2019-11-15 23:46:26,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:26,317 INFO L93 Difference]: Finished difference Result 229 states and 326 transitions. [2019-11-15 23:46:26,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:26,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 23:46:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:26,320 INFO L225 Difference]: With dead ends: 229 [2019-11-15 23:46:26,320 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:46:26,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-11-15 23:46:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:46:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-15 23:46:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 23:46:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2019-11-15 23:46:26,332 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 18 [2019-11-15 23:46:26,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:26,332 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2019-11-15 23:46:26,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2019-11-15 23:46:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:46:26,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:26,334 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:26,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-15 23:46:26,537 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:26,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1006577033, now seen corresponding path program 1 times [2019-11-15 23:46:26,539 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:46:26,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145917832] [2019-11-15 23:46:26,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/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-11-15 23:46:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:27,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 23:46:27,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:27,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:46:31,622 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-15 23:46:34,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2019-11-15 23:46:34,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:46:34,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2019-11-15 23:46:34,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:34,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:34,396 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:34,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2019-11-15 23:46:34,397 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:34,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:34,410 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:46:34,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:34,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:46:34,452 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:95, output treesize:56 [2019-11-15 23:46:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:34,741 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:46:34,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:46:35,012 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:35,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 61 [2019-11-15 23:46:35,050 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:35,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 41 [2019-11-15 23:46:35,052 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:35,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:35,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-15 23:46:35,089 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:35,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:35,102 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:46:35,129 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:35,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 44 [2019-11-15 23:46:35,151 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:35,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2019-11-15 23:46:35,152 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:35,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:35,170 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:46:35,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:35,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 23:46:35,199 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:108, output treesize:50 [2019-11-15 23:46:35,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:46:36,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:46:36,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:46:36,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:46:36,828 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-15 23:46:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:36,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145917832] [2019-11-15 23:46:36,849 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:36,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2019-11-15 23:46:36,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143212940] [2019-11-15 23:46:36,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 23:46:36,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:46:36,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 23:46:36,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=401, Unknown=2, NotChecked=0, Total=462 [2019-11-15 23:46:36,851 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. Second operand 22 states. [2019-11-15 23:46:37,410 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-15 23:46:37,761 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-11-15 23:46:37,985 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-11-15 23:46:40,298 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-15 23:46:42,583 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 55 [2019-11-15 23:46:44,778 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 23:46:47,037 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-15 23:46:49,245 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-15 23:46:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:49,840 INFO L93 Difference]: Finished difference Result 131 states and 183 transitions. [2019-11-15 23:46:49,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:46:49,849 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-11-15 23:46:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:49,850 INFO L225 Difference]: With dead ends: 131 [2019-11-15 23:46:49,850 INFO L226 Difference]: Without dead ends: 58 [2019-11-15 23:46:49,851 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=225, Invalid=765, Unknown=2, NotChecked=0, Total=992 [2019-11-15 23:46:49,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-15 23:46:49,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-15 23:46:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-15 23:46:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2019-11-15 23:46:49,860 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 22 [2019-11-15 23:46:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:49,860 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2019-11-15 23:46:49,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 23:46:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2019-11-15 23:46:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:46:49,861 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:49,861 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:50,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-15 23:46:50,069 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:50,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash -990191373, now seen corresponding path program 1 times [2019-11-15 23:46:50,071 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:46:50,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208013600] [2019-11-15 23:46:50,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-15 23:46:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:50,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:46:50,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:50,606 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-15 23:46:50,854 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-15 23:46:51,010 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-15 23:46:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:51,014 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:46:53,277 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-15 23:46:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:53,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208013600] [2019-11-15 23:46:53,282 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:53,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-15 23:46:53,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285501152] [2019-11-15 23:46:53,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:46:53,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:46:53,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:46:53,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:46:53,283 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 10 states. [2019-11-15 23:46:53,809 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-15 23:46:53,969 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-15 23:46:54,271 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-15 23:46:54,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:54,470 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-11-15 23:46:54,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:46:54,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-11-15 23:46:54,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:54,473 INFO L225 Difference]: With dead ends: 62 [2019-11-15 23:46:54,473 INFO L226 Difference]: Without dead ends: 56 [2019-11-15 23:46:54,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:46:54,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-15 23:46:54,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-15 23:46:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-15 23:46:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-11-15 23:46:54,481 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 27 [2019-11-15 23:46:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:54,481 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-15 23:46:54,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:46:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2019-11-15 23:46:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:46:54,483 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:54,483 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:54,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-15 23:46:54,693 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:54,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:54,693 INFO L82 PathProgramCache]: Analyzing trace with hash 266488550, now seen corresponding path program 1 times [2019-11-15 23:46:54,694 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:46:54,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611552148] [2019-11-15 23:46:54,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/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-11-15 23:46:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:55,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:46:55,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:55,328 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-15 23:46:55,578 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-15 23:46:55,781 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-15 23:46:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:55,785 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:46:58,380 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-15 23:46:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:58,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611552148] [2019-11-15 23:46:58,383 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:58,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-15 23:46:58,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225349762] [2019-11-15 23:46:58,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:46:58,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:46:58,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:46:58,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:46:58,384 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 10 states. [2019-11-15 23:46:59,213 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-15 23:46:59,477 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-15 23:46:59,876 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-15 23:46:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:59,929 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-11-15 23:46:59,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:46:59,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-15 23:46:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:59,931 INFO L225 Difference]: With dead ends: 60 [2019-11-15 23:46:59,931 INFO L226 Difference]: Without dead ends: 50 [2019-11-15 23:46:59,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:46:59,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-15 23:46:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-15 23:46:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 23:46:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2019-11-15 23:46:59,939 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 29 [2019-11-15 23:46:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:59,939 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2019-11-15 23:46:59,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:46:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2019-11-15 23:46:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:46:59,940 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:59,940 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:00,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-15 23:47:00,141 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:00,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:00,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1159958932, now seen corresponding path program 1 times [2019-11-15 23:47:00,142 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:47:00,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853221503] [2019-11-15 23:47:00,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/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-11-15 23:47:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:00,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:47:00,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:00,581 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:47:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:00,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853221503] [2019-11-15 23:47:00,739 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:00,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-15 23:47:00,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445160195] [2019-11-15 23:47:00,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:47:00,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:47:00,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:47:00,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:47:00,741 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 12 states. [2019-11-15 23:47:01,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:01,204 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-11-15 23:47:01,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:47:01,212 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-15 23:47:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:01,213 INFO L225 Difference]: With dead ends: 55 [2019-11-15 23:47:01,213 INFO L226 Difference]: Without dead ends: 33 [2019-11-15 23:47:01,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:47:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-15 23:47:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-15 23:47:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 23:47:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-11-15 23:47:01,219 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-11-15 23:47:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:01,220 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-11-15 23:47:01,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:47:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-11-15 23:47:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:47:01,221 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:01,221 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:01,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-15 23:47:01,439 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:01,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:01,440 INFO L82 PathProgramCache]: Analyzing trace with hash 378053105, now seen corresponding path program 1 times [2019-11-15 23:47:01,440 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:47:01,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990368695] [2019-11-15 23:47:01,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/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-11-15 23:47:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:01,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:47:01,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:01,924 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:47:01,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:02,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:02,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990368695] [2019-11-15 23:47:02,391 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:02,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-15 23:47:02,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719124644] [2019-11-15 23:47:02,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:47:02,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:47:02,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:47:02,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:47:02,392 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2019-11-15 23:47:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:02,869 INFO L93 Difference]: Finished difference Result 38 states and 37 transitions. [2019-11-15 23:47:02,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:47:02,879 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-15 23:47:02,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:02,879 INFO L225 Difference]: With dead ends: 38 [2019-11-15 23:47:02,880 INFO L226 Difference]: Without dead ends: 33 [2019-11-15 23:47:02,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:47:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-15 23:47:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-15 23:47:02,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 23:47:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2019-11-15 23:47:02,885 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 31 [2019-11-15 23:47:02,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:02,886 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2019-11-15 23:47:02,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:47:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2019-11-15 23:47:02,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:47:02,887 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:02,887 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:03,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-15 23:47:03,105 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:03,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1188435438, now seen corresponding path program 1 times [2019-11-15 23:47:03,106 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:47:03,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868367546] [2019-11-15 23:47:03,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0388821-73d1-46a4-b1dc-2a0fc07d6bb5/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-15 23:47:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:04,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 23:47:04,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:04,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:04,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:04,437 INFO L341 Elim1Store]: treesize reduction 57, result has 43.6 percent of original size [2019-11-15 23:47:04,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 99 [2019-11-15 23:47:04,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:04,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:04,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:04,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:04,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:04,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:04,639 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-11-15 23:47:04,639 INFO L567 ElimStorePlain]: treesize reduction 55, result has 68.4 percent of original size [2019-11-15 23:47:04,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:47:04,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:04,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:121, output treesize:119 [2019-11-15 23:47:04,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:47:04,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:47:04,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:47:04,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:04,895 INFO L235 Elim1Store]: Index analysis took 114 ms [2019-11-15 23:47:05,118 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:47:05,119 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:47:05,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 138 treesize of output 235 [2019-11-15 23:47:05,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:05,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:05,286 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:05,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 203 [2019-11-15 23:47:05,287 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:05,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:05,436 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:05,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 208 [2019-11-15 23:47:05,438 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:05,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:05,552 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:05,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 208 [2019-11-15 23:47:05,554 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:07,097 WARN L191 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2019-11-15 23:47:07,097 INFO L567 ElimStorePlain]: treesize reduction 198, result has 72.7 percent of original size [2019-11-15 23:47:07,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,180 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:47:07,188 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:07,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 145 [2019-11-15 23:47:07,189 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:07,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,315 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:47:07,327 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:07,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 150 [2019-11-15 23:47:07,329 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:07,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,443 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:47:07,451 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:07,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 148 [2019-11-15 23:47:07,453 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:07,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,503 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:47:07,511 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:07,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 148 [2019-11-15 23:47:07,512 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:08,532 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2019-11-15 23:47:08,533 INFO L567 ElimStorePlain]: treesize reduction 59, result has 89.7 percent of original size [2019-11-15 23:47:08,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:08,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 23 dim-0 vars, and 4 xjuncts. [2019-11-15 23:47:08,536 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:542, output treesize:512 [2019-11-15 23:47:08,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:08,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:08,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:08,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:08,936 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2019-11-15 23:47:08,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:08,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:08,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:08,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:47:09,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:09,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:10,225 INFO L235 Elim1Store]: Index analysis took 639 ms [2019-11-15 23:47:10,562 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-15 23:47:10,562 INFO L341 Elim1Store]: treesize reduction 16, result has 87.2 percent of original size [2019-11-15 23:47:10,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 157 treesize of output 254 [2019-11-15 23:47:10,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:10,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:11,227 INFO L235 Elim1Store]: Index analysis took 602 ms [2019-11-15 23:47:11,583 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-15 23:47:11,584 INFO L341 Elim1Store]: treesize reduction 16, result has 87.2 percent of original size [2019-11-15 23:47:11,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 157 treesize of output 254 [2019-11-15 23:47:11,585 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:11,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:12,006 INFO L235 Elim1Store]: Index analysis took 386 ms [2019-11-15 23:47:12,261 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-15 23:47:12,261 INFO L341 Elim1Store]: treesize reduction 16, result has 87.2 percent of original size [2019-11-15 23:47:12,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 249 [2019-11-15 23:47:12,263 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:12,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:12,711 INFO L235 Elim1Store]: Index analysis took 371 ms [2019-11-15 23:47:13,133 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-11-15 23:47:13,134 INFO L341 Elim1Store]: treesize reduction 48, result has 73.9 percent of original size [2019-11-15 23:47:13,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 159 treesize of output 281 [2019-11-15 23:47:13,135 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:21,556 WARN L191 SmtUtils]: Spent 8.42 s on a formula simplification. DAG size of input: 275 DAG size of output: 220 [2019-11-15 23:47:21,556 INFO L567 ElimStorePlain]: treesize reduction 302, result has 65.1 percent of original size [2019-11-15 23:47:21,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:21,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:21,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:21,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:21,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:21,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:21,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:21,742 INFO L235 Elim1Store]: Index analysis took 162 ms [2019-11-15 23:47:21,817 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:47:21,843 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:21,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 181 [2019-11-15 23:47:21,845 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:21,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:21,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:21,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:21,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:21,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:21,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:21,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,116 INFO L235 Elim1Store]: Index analysis took 233 ms [2019-11-15 23:47:22,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,229 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:47:22,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:22,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 183 [2019-11-15 23:47:22,257 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:22,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,392 INFO L235 Elim1Store]: Index analysis took 116 ms [2019-11-15 23:47:22,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,449 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:47:22,474 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:22,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 181 [2019-11-15 23:47:22,476 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:22,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:22,583 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:47:22,607 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:22,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 178 [2019-11-15 23:47:22,608 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:24,314 WARN L191 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 254 DAG size of output: 227 [2019-11-15 23:47:24,314 INFO L567 ElimStorePlain]: treesize reduction 111, result has 83.9 percent of original size [2019-11-15 23:47:24,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:24,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:24,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:24,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:24,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 26 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 35 dim-0 vars, and 4 xjuncts. [2019-11-15 23:47:24,320 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 28 variables, input treesize:626, output treesize:580 [2019-11-15 23:47:24,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:24,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:24,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:24,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:28,897 WARN L191 SmtUtils]: Spent 2.45 s on a formula simplification that was a NOOP. DAG size: 299 [2019-11-15 23:47:28,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:28,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:28,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:28,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:31,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:31,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:31,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:31,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:33,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:33,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:33,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:33,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:35,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:35,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:35,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:35,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:38,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:47:38,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:38,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:38,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:38,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:38,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:38,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:38,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:38,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:38,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:40,497 INFO L235 Elim1Store]: Index analysis took 2113 ms [2019-11-15 23:47:41,025 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:47:41,026 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:47:41,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 172 treesize of output 294 [2019-11-15 23:47:41,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:41,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:42,603 INFO L235 Elim1Store]: Index analysis took 1423 ms [2019-11-15 23:47:43,089 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:47:43,089 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:47:43,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 161 treesize of output 258 [2019-11-15 23:47:43,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:43,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:44,573 INFO L235 Elim1Store]: Index analysis took 1323 ms [2019-11-15 23:47:45,023 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:47:45,023 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:47:45,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 159 treesize of output 256 [2019-11-15 23:47:45,025 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:45,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:46,522 INFO L235 Elim1Store]: Index analysis took 1387 ms [2019-11-15 23:47:47,043 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:47:47,043 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:47:47,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 169 treesize of output 291 [2019-11-15 23:47:47,044 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:47,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:48,635 INFO L235 Elim1Store]: Index analysis took 1494 ms [2019-11-15 23:47:49,023 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:47:49,023 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:47:49,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 174 treesize of output 296 [2019-11-15 23:47:49,024 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:49,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:49,864 INFO L235 Elim1Store]: Index analysis took 782 ms [2019-11-15 23:47:50,196 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:47:50,197 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:47:50,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 156 treesize of output 253 [2019-11-15 23:47:50,198 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:51,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:52,685 INFO L235 Elim1Store]: Index analysis took 2397 ms [2019-11-15 23:47:53,271 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 71 [2019-11-15 23:47:53,271 INFO L341 Elim1Store]: treesize reduction 96, result has 62.9 percent of original size [2019-11-15 23:47:53,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 176 treesize of output 323 [2019-11-15 23:47:53,272 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:53,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:53,768 INFO L235 Elim1Store]: Index analysis took 421 ms [2019-11-15 23:47:54,305 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:47:54,305 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:47:54,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 163 treesize of output 285 [2019-11-15 23:47:54,307 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:13,897 WARN L191 SmtUtils]: Spent 19.59 s on a formula simplification. DAG size of input: 338 DAG size of output: 256 [2019-11-15 23:48:13,898 INFO L567 ElimStorePlain]: treesize reduction 1049, result has 43.9 percent of original size [2019-11-15 23:48:13,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:13,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:13,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:13,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:13,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:13,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:14,193 INFO L235 Elim1Store]: Index analysis took 261 ms [2019-11-15 23:48:14,297 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:48:14,346 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:14,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 157 treesize of output 217 [2019-11-15 23:48:14,348 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:14,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:14,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:14,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:14,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:14,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:14,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:14,764 INFO L235 Elim1Store]: Index analysis took 375 ms [2019-11-15 23:48:14,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:14,938 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:48:14,987 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:14,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 154 treesize of output 214 [2019-11-15 23:48:14,988 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:15,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,466 INFO L235 Elim1Store]: Index analysis took 433 ms [2019-11-15 23:48:15,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,632 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:48:15,728 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:15,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 182 treesize of output 270 [2019-11-15 23:48:15,730 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:15,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:16,166 INFO L235 Elim1Store]: Index analysis took 396 ms [2019-11-15 23:48:16,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:16,365 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:48:16,431 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:16,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 159 treesize of output 219 [2019-11-15 23:48:16,432 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:16,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:16,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:16,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:16,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:16,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:16,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:16,581 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:48:16,647 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:16,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 169 treesize of output 229 [2019-11-15 23:48:16,648 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:20,133 WARN L191 SmtUtils]: Spent 3.48 s on a formula simplification. DAG size of input: 316 DAG size of output: 269 [2019-11-15 23:48:20,133 INFO L567 ElimStorePlain]: treesize reduction 233, result has 78.7 percent of original size [2019-11-15 23:48:20,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 38 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 51 dim-0 vars, and 5 xjuncts. [2019-11-15 23:48:20,159 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 40 variables, input treesize:1331, output treesize:862 [2019-11-15 23:48:20,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:20,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,705 WARN L191 SmtUtils]: Spent 6.04 s on a formula simplification. DAG size of input: 416 DAG size of output: 342 [2019-11-15 23:48:30,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:30,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:33,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:33,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:33,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:33,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:35,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:48:35,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:35,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:35,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:35,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:35,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:35,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:35,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:35,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:36,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:36,905 INFO L235 Elim1Store]: Index analysis took 1293 ms [2019-11-15 23:48:37,264 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:48:37,265 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:48:37,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 156 treesize of output 253 [2019-11-15 23:48:37,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:38,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:39,278 INFO L235 Elim1Store]: Index analysis took 1858 ms [2019-11-15 23:48:40,011 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:48:40,012 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:48:40,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 163 treesize of output 285 [2019-11-15 23:48:40,013 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:40,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:41,356 INFO L235 Elim1Store]: Index analysis took 1190 ms [2019-11-15 23:48:41,711 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:48:41,711 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:48:41,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 159 treesize of output 256 [2019-11-15 23:48:41,713 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:43,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:44,333 INFO L235 Elim1Store]: Index analysis took 2440 ms [2019-11-15 23:48:44,966 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 71 [2019-11-15 23:48:44,966 INFO L341 Elim1Store]: treesize reduction 96, result has 62.9 percent of original size [2019-11-15 23:48:44,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 176 treesize of output 323 [2019-11-15 23:48:44,968 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:45,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:45,924 INFO L235 Elim1Store]: Index analysis took 876 ms [2019-11-15 23:48:46,385 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:48:46,385 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:48:46,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 169 treesize of output 291 [2019-11-15 23:48:46,386 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:47,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:48,659 INFO L235 Elim1Store]: Index analysis took 2108 ms [2019-11-15 23:48:49,409 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:48:49,409 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:48:49,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 174 treesize of output 296 [2019-11-15 23:48:49,410 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:49,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:50,973 INFO L235 Elim1Store]: Index analysis took 1491 ms [2019-11-15 23:48:51,416 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:48:51,416 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:48:51,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 172 treesize of output 294 [2019-11-15 23:48:51,417 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:51,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:52,158 INFO L235 Elim1Store]: Index analysis took 631 ms [2019-11-15 23:48:52,564 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:48:52,564 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:48:52,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 161 treesize of output 258 [2019-11-15 23:48:52,565 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:12,815 WARN L191 SmtUtils]: Spent 20.25 s on a formula simplification. DAG size of input: 337 DAG size of output: 254 [2019-11-15 23:49:12,815 INFO L567 ElimStorePlain]: treesize reduction 1057, result has 43.5 percent of original size [2019-11-15 23:49:12,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:12,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:12,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:12,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:12,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:12,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:12,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:12,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:13,451 INFO L235 Elim1Store]: Index analysis took 604 ms [2019-11-15 23:49:13,777 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:49:13,868 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:13,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 178 treesize of output 266 [2019-11-15 23:49:13,869 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:13,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:13,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:13,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:13,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:13,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:14,333 INFO L235 Elim1Store]: Index analysis took 422 ms [2019-11-15 23:49:14,531 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:49:14,580 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:14,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 165 treesize of output 225 [2019-11-15 23:49:14,581 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:14,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:14,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:14,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:14,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:14,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:14,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:14,950 INFO L235 Elim1Store]: Index analysis took 335 ms [2019-11-15 23:49:15,129 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:49:15,175 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:15,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 154 treesize of output 214 [2019-11-15 23:49:15,177 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:15,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:15,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:15,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:15,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:15,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:15,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:15,641 INFO L235 Elim1Store]: Index analysis took 431 ms [2019-11-15 23:49:15,845 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:49:15,894 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:15,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 157 treesize of output 217 [2019-11-15 23:49:15,896 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:15,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:15,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:15,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:15,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:15,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:15,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:16,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:16,082 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:49:16,132 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:16,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 159 treesize of output 219 [2019-11-15 23:49:16,133 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:19,715 WARN L191 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 315 DAG size of output: 268 [2019-11-15 23:49:19,715 INFO L567 ElimStorePlain]: treesize reduction 234, result has 78.5 percent of original size [2019-11-15 23:49:19,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 38 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 51 dim-0 vars, and 5 xjuncts. [2019-11-15 23:49:19,733 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 40 variables, input treesize:1331, output treesize:854 [2019-11-15 23:49:19,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:19,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:22,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:22,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:22,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:22,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:25,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:25,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:25,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:25,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:27,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:27,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:27,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:27,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:29,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:29,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:29,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:29,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:31,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:49:31,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:31,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:31,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:31,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:31,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:31,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:31,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:31,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:32,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:34,008 INFO L235 Elim1Store]: Index analysis took 1967 ms [2019-11-15 23:49:34,485 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:49:34,485 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:49:34,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 159 treesize of output 281 [2019-11-15 23:49:34,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:34,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:36,493 INFO L235 Elim1Store]: Index analysis took 1943 ms [2019-11-15 23:49:37,286 WARN L191 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 71 [2019-11-15 23:49:37,287 INFO L341 Elim1Store]: treesize reduction 96, result has 62.9 percent of original size [2019-11-15 23:49:37,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 172 treesize of output 319 [2019-11-15 23:49:37,288 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:37,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:37,962 INFO L235 Elim1Store]: Index analysis took 627 ms [2019-11-15 23:49:38,283 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:49:38,283 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:49:38,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 152 treesize of output 249 [2019-11-15 23:49:38,285 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:38,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:39,301 INFO L235 Elim1Store]: Index analysis took 967 ms [2019-11-15 23:49:39,718 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:49:39,719 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:49:39,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 168 treesize of output 290 [2019-11-15 23:49:39,720 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:39,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:40,583 INFO L235 Elim1Store]: Index analysis took 817 ms [2019-11-15 23:49:40,995 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:49:40,995 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:49:40,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 165 treesize of output 287 [2019-11-15 23:49:40,997 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:41,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:42,256 INFO L235 Elim1Store]: Index analysis took 1162 ms [2019-11-15 23:49:42,635 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:49:42,635 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:49:42,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 155 treesize of output 252 [2019-11-15 23:49:42,636 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:42,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:43,345 INFO L235 Elim1Store]: Index analysis took 637 ms [2019-11-15 23:49:43,908 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:49:43,908 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:49:43,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 157 treesize of output 254 [2019-11-15 23:49:43,909 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:44,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:44,262 INFO L235 Elim1Store]: Index analysis took 275 ms [2019-11-15 23:49:44,628 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:49:44,628 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:49:44,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 170 treesize of output 292 [2019-11-15 23:49:44,630 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:02,149 WARN L191 SmtUtils]: Spent 17.52 s on a formula simplification. DAG size of input: 334 DAG size of output: 251 [2019-11-15 23:50:02,150 INFO L567 ElimStorePlain]: treesize reduction 1045, result has 43.2 percent of original size [2019-11-15 23:50:02,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,368 INFO L235 Elim1Store]: Index analysis took 185 ms [2019-11-15 23:50:02,414 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:50:02,442 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:02,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 194 [2019-11-15 23:50:02,444 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:02,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,669 INFO L235 Elim1Store]: Index analysis took 192 ms [2019-11-15 23:50:02,716 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:50:02,755 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:02,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 189 [2019-11-15 23:50:02,756 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:02,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,969 INFO L235 Elim1Store]: Index analysis took 193 ms [2019-11-15 23:50:03,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:03,020 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:50:03,061 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:03,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 174 treesize of output 224 [2019-11-15 23:50:03,062 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:03,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:03,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:03,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:03,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:03,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:03,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:03,293 INFO L235 Elim1Store]: Index analysis took 196 ms [2019-11-15 23:50:03,342 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:50:03,369 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:03,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 192 [2019-11-15 23:50:03,370 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:03,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:03,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:03,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:03,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:03,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:03,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:03,447 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:50:03,476 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:03,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 200 [2019-11-15 23:50:03,477 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:06,752 WARN L191 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 293 DAG size of output: 259 [2019-11-15 23:50:06,753 INFO L567 ElimStorePlain]: treesize reduction 136, result has 85.4 percent of original size [2019-11-15 23:50:06,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 37 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 46 dim-0 vars, and 5 xjuncts. [2019-11-15 23:50:06,763 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 39 variables, input treesize:1299, output treesize:794 [2019-11-15 23:50:06,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:09,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:09,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:09,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:09,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:11,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:11,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:11,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:11,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:13,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:13,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:13,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:13,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:15,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:50:15,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:15,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:15,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:15,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:15,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:15,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:15,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:15,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:16,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:16,377 INFO L235 Elim1Store]: Index analysis took 332 ms [2019-11-15 23:50:16,473 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:16,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 159 treesize of output 243 [2019-11-15 23:50:16,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:16,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:16,977 INFO L235 Elim1Store]: Index analysis took 462 ms [2019-11-15 23:50:17,087 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-15 23:50:17,087 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:17,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 162 treesize of output 246 [2019-11-15 23:50:17,088 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:17,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:17,618 INFO L235 Elim1Store]: Index analysis took 497 ms [2019-11-15 23:50:17,718 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:17,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 164 treesize of output 248 [2019-11-15 23:50:17,719 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:17,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:18,114 INFO L235 Elim1Store]: Index analysis took 356 ms [2019-11-15 23:50:18,205 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:18,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 153 treesize of output 237 [2019-11-15 23:50:18,207 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:18,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:18,448 INFO L235 Elim1Store]: Index analysis took 211 ms [2019-11-15 23:50:18,499 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:18,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 151 treesize of output 197 [2019-11-15 23:50:18,500 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:18,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:18,784 INFO L235 Elim1Store]: Index analysis took 247 ms [2019-11-15 23:50:18,830 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:18,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 146 treesize of output 192 [2019-11-15 23:50:18,831 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:19,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:19,664 INFO L235 Elim1Store]: Index analysis took 781 ms [2019-11-15 23:50:19,841 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-15 23:50:19,841 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:19,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 166 treesize of output 296 [2019-11-15 23:50:19,843 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:19,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:20,026 INFO L235 Elim1Store]: Index analysis took 147 ms [2019-11-15 23:50:20,075 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:20,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 149 treesize of output 195 [2019-11-15 23:50:20,076 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:23,840 WARN L191 SmtUtils]: Spent 3.76 s on a formula simplification. DAG size of input: 301 DAG size of output: 262 [2019-11-15 23:50:23,840 INFO L567 ElimStorePlain]: treesize reduction 498, result has 60.0 percent of original size [2019-11-15 23:50:23,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:23,982 INFO L235 Elim1Store]: Index analysis took 119 ms [2019-11-15 23:50:24,016 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:50:24,043 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:24,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 192 [2019-11-15 23:50:24,044 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:24,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:24,305 INFO L235 Elim1Store]: Index analysis took 235 ms [2019-11-15 23:50:24,367 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:50:24,394 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:24,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 183 [2019-11-15 23:50:24,395 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:24,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:24,570 INFO L235 Elim1Store]: Index analysis took 147 ms [2019-11-15 23:50:24,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:24,618 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:50:24,646 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:24,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 183 [2019-11-15 23:50:24,647 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:24,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:24,782 INFO L235 Elim1Store]: Index analysis took 115 ms [2019-11-15 23:50:24,811 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:50:24,872 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:24,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 231 [2019-11-15 23:50:24,873 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:24,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:24,977 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:50:25,002 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:25,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 180 [2019-11-15 23:50:25,003 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:28,371 WARN L191 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 304 DAG size of output: 271 [2019-11-15 23:50:28,371 INFO L567 ElimStorePlain]: treesize reduction 159, result has 82.5 percent of original size [2019-11-15 23:50:28,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:28,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:28,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:28,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:28,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:28,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:28,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:28,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 37 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 46 dim-0 vars, and 5 xjuncts. [2019-11-15 23:50:28,378 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 39 variables, input treesize:1251, output treesize:751 [2019-11-15 23:50:28,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:28,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:28,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:28,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:28,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:28,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:28,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:41,107 WARN L191 SmtUtils]: Spent 5.96 s on a formula simplification. DAG size of input: 390 DAG size of output: 170 [2019-11-15 23:50:41,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:41,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:46,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:46,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:53,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:53,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:53,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:53,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:53,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:53,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:54,273 INFO L235 Elim1Store]: Index analysis took 551 ms [2019-11-15 23:50:54,290 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:54,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 225 treesize of output 151 [2019-11-15 23:50:54,291 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:50:54,723 INFO L235 Elim1Store]: Index analysis took 147 ms [2019-11-15 23:50:54,736 INFO L341 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2019-11-15 23:50:54,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 127 [2019-11-15 23:50:54,737 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:30,131 WARN L191 SmtUtils]: Spent 1.59 m on a formula simplification. DAG size of input: 187 DAG size of output: 160 [2019-11-15 23:52:30,131 INFO L567 ElimStorePlain]: treesize reduction 146, result has 78.4 percent of original size [2019-11-15 23:52:30,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:31,297 INFO L235 Elim1Store]: Index analysis took 818 ms [2019-11-15 23:52:31,304 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:31,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 201 treesize of output 123 [2019-11-15 23:52:31,305 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:33,103 INFO L235 Elim1Store]: Index analysis took 725 ms [2019-11-15 23:52:33,132 INFO L341 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2019-11-15 23:52:33,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 5 case distinctions, treesize of input 221 treesize of output 147 [2019-11-15 23:52:33,134 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:46,148 WARN L191 SmtUtils]: Spent 13.01 s on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2019-11-15 23:52:46,148 INFO L567 ElimStorePlain]: treesize reduction 138, result has 60.7 percent of original size [2019-11-15 23:52:46,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 23 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-15 23:52:46,152 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 25 variables, input treesize:857, output treesize:137 [2019-11-15 23:52:48,624 WARN L191 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2019-11-15 23:52:50,037 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 23:52:51,940 WARN L191 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 23:52:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:52,103 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:53:24,576 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-15 23:53:24,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-15 23:53:24,778 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:580) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 42 more [2019-11-15 23:53:24,781 INFO L168 Benchmark]: Toolchain (without parser) took 456681.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 952.3 MB in the beginning and 852.5 MB in the end (delta: 99.9 MB). Peak memory consumption was 316.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:24,782 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:53:24,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:24,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:24,783 INFO L168 Benchmark]: Boogie Preprocessor took 68.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:24,783 INFO L168 Benchmark]: RCFGBuilder took 36188.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:24,783 INFO L168 Benchmark]: TraceAbstraction took 419909.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.0 GB in the beginning and 852.5 MB in the end (delta: 196.2 MB). Peak memory consumption was 255.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:24,785 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 434.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 36188.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 419909.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.0 GB in the beginning and 852.5 MB in the end (delta: 196.2 MB). Peak memory consumption was 255.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...